標題: Titlebook: Algebraic and Logic Programming; 4th International Co Giorgio Levi,Mario Rodríguez-Artalejo Conference proceedings 1994 Springer-Verlag Ber [打印本頁] 作者: CAP 時間: 2025-3-21 17:39
書目名稱Algebraic and Logic Programming影響因子(影響力)
書目名稱Algebraic and Logic Programming影響因子(影響力)學科排名
書目名稱Algebraic and Logic Programming網絡公開度
書目名稱Algebraic and Logic Programming網絡公開度學科排名
書目名稱Algebraic and Logic Programming被引頻次
書目名稱Algebraic and Logic Programming被引頻次學科排名
書目名稱Algebraic and Logic Programming年度引用
書目名稱Algebraic and Logic Programming年度引用學科排名
書目名稱Algebraic and Logic Programming讀者反饋
書目名稱Algebraic and Logic Programming讀者反饋學科排名
作者: Nucleate 時間: 2025-3-21 22:48 作者: SLING 時間: 2025-3-22 03:39 作者: prick-test 時間: 2025-3-22 06:08
https://doi.org/10.1007/978-3-7091-6846-2s to the class of abductive logic programs, we present further evidence for the idea that limited forms of abduction can be added quite naturally to general logic programs. One problem that remains, is the occurrence of inconsistencies. We argue that there are cases in which these do not pose a prob作者: 發(fā)展 時間: 2025-3-22 09:30
Alpha-Synuclein in Cerebrospinal Fluidms are not totally terminating and hence outside the scope of the usual techniques. One of these characterizations can be considered as a sound and complete description of totality of orderings on terms.作者: Hallmark 時間: 2025-3-22 13:06
On modularity of termination and confluence properties of conditional rewrite systems,obtain sufficient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination, (strong) termination, confluence and completeness of conditional rewrite systems.作者: ambivalence 時間: 2025-3-22 19:36 作者: FLINT 時間: 2025-3-23 01:08
Preserving universal termination through unfold/fold,ation both alone and combined with the introduction of a new definition and fold operations. We prove that unfold always preserves universal termination. Moreover we define a restricted version of the Tamaki-Sato‘s transformation sequence and show that it preserves universal termination as well.作者: floodgate 時間: 2025-3-23 01:36
Dementia and the Advance Directiveons over lattice structures. We generalize the known result which states that any semilattice is approximated in the two element lattice. We show that the validity of a universally quantified implication . over a possibly infinite domain can be determined by examining its validity over a simpler dom作者: 通情達理 時間: 2025-3-23 08:36
https://doi.org/10.1007/978-1-4471-2377-4used for each instantiation of the parameters. We present procedures to test sufficient completeness and to prove and disprove inductive properties automatically in parameterized conditional specifications. This new method when limited to non-parameterized conditional specifications, can refute gene作者: myalgia 時間: 2025-3-23 13:21
https://doi.org/10.1007/978-1-4471-2377-4y their identity). We establish simple and general sufficient conditions under which the behavioural validity of some first-order formula with respect to a given first-order specification is equivalent to the standard validity of the same formula in a suitably enriched specification. As a consequenc作者: 時代錯誤 時間: 2025-3-23 15:04
Diagnosis (2): Dementia Disorders,s of various logic and functional programming languages. In [BKW93], we introduced the LSE narrowing strategy which is complete for arbitrary canonical rewriting systems and optimal in the sense that two different LSE narrowing derivations cannot generate the same narrowing substitution. LSE narrowi作者: 法律 時間: 2025-3-23 21:39 作者: 欺騙世家 時間: 2025-3-24 01:17 作者: antidote 時間: 2025-3-24 03:23
https://doi.org/10.1007/978-3-319-75259-4rive concurrency, dependency, and nondeterminism information for such languages. The ability to treat failure information puts CLP programs also in the range of applicability of our semantics: although such programs are not concurrent, the concurrency information derived in the semantics may be inte作者: 拋射物 時間: 2025-3-24 10:23 作者: 成績上升 時間: 2025-3-24 12:19 作者: nepotism 時間: 2025-3-24 18:52
Aging and the nigro-striatal pathway,gy. In this paper we present a computable sequential reduction strategy similar in scope, but simpler and more general. Our strategy can be thought of as an outerrnost-fair-like strategy that is allowed to be unfair to some redex of a term when contracting the redex is useless for the normalization 作者: Fortify 時間: 2025-3-24 20:08
https://doi.org/10.1007/978-4-431-55948-1obtain sufficient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination, (strong) termination, confluence and completeness of conditional rewrite systems.作者: Euphonious 時間: 2025-3-25 03:01
Alpha-Synuclein in Cerebrospinal Fluidssful in special cases. In [5] we introduced the notion of .: basically terms are interpreted compositionally in a total well-founded order, in such a way that rewriting chains map to descending chains. Total termination is thus a semantic notion. It turns out that most of the usual techniques for p作者: AROMA 時間: 2025-3-25 03:31
https://doi.org/10.1007/978-4-431-55948-1 program computes a TRS. For a relevant class of logic programs, called Simply Well Moded (SWM), there is a one-to-one correspondence between computed answer substitutions of the logic program and normal forms of the corresponding TRS. Moreover the transform preserves termination, i.e., a logic prog作者: 類人猿 時間: 2025-3-25 10:50
Louise Colledge,Tim Whitfield,Zuzana Walkerermediate calls performed during the evaluation of a program. This information may be used in abstract interpretation as a basis for proving the soundness of program analyses. An example of this is the “closure analysis” of partial evaluation.作者: Eulogy 時間: 2025-3-25 12:36
Louise Colledge,Tim Whitfield,Zuzana Walker the surjective pairing axiom and a generalization of the .- conversion to patterns. We obtain a . reduction system by turning the extensional axioms as . rules, and then adding some restrictions to these expansions in order to avoid reduction loops. Confluence is proved by composition of modular pr作者: Recess 時間: 2025-3-25 17:44
Revisiting My Mother’s Story, My Storyation both alone and combined with the introduction of a new definition and fold operations. We prove that unfold always preserves universal termination. Moreover we define a restricted version of the Tamaki-Sato‘s transformation sequence and show that it preserves universal termination as well.作者: 菊花 時間: 2025-3-25 21:31 作者: 正論 時間: 2025-3-26 01:32
https://doi.org/10.1007/3-540-58431-5Constraint Logic Programming; Logic Programming; algebraic programming; algebraisches Programmieren; hig作者: 織布機 時間: 2025-3-26 05:50
978-3-540-58431-5Springer-Verlag Berlin Heidelberg 1994作者: BIDE 時間: 2025-3-26 10:39
Algebraic and Logic Programming978-3-540-48791-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Credence 時間: 2025-3-26 14:19
https://doi.org/10.1007/978-4-431-55948-1obtain sufficient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination, (strong) termination, confluence and completeness of conditional rewrite systems.作者: 谷類 時間: 2025-3-26 19:44 作者: amygdala 時間: 2025-3-26 21:00 作者: Habituate 時間: 2025-3-27 04:52 作者: Little 時間: 2025-3-27 05:41 作者: Macronutrients 時間: 2025-3-27 11:10
Proving behavioural theorems with standard first-order logic,y their identity). We establish simple and general sufficient conditions under which the behavioural validity of some first-order formula with respect to a given first-order specification is equivalent to the standard validity of the same formula in a suitably enriched specification. As a consequenc作者: 聾子 時間: 2025-3-27 16:42 作者: 神刊 時間: 2025-3-27 20:54
Compositional analysis for equational Horn programs,ard operational semantics based on (basic) narrowing coincide. We define an abstract narrower mimicking this semantics, and show how it can be used as a basis for efficient AND-compositional program analysis. As an application of our framework, we show a compositional analysis to detect the unsatisf作者: 無動于衷 時間: 2025-3-27 23:41 作者: 走路左晃右晃 時間: 2025-3-28 05:38
From eventual to atomic and locally atomic CC programs: A concurrent semantics,rive concurrency, dependency, and nondeterminism information for such languages. The ability to treat failure information puts CLP programs also in the range of applicability of our semantics: although such programs are not concurrent, the concurrency information derived in the semantics may be inte作者: 推延 時間: 2025-3-28 07:05
Concurrent logic programming as uniform linear proofs,as compared to other linear logic language) provides a simpler operational model that can lead to a more practical language core. The . fragment is proveded to be an abstract logic programming language, that is any sequent can be derived by uniform proofs. The resulting class of computations can be 作者: STIT 時間: 2025-3-28 13:03
Three-valued completion for abductive logic programs,quite elegantly for this purpose. In this paper, we propose a a three-valued completion semantics for abductive logic programs, which solves some problems associated with Console et al‘s two-valued completion semantics. The semantics is a generalization of Kunen‘s completion semantics for general lo作者: 偽造者 時間: 2025-3-28 16:42
A sequential reduction strategy,gy. In this paper we present a computable sequential reduction strategy similar in scope, but simpler and more general. Our strategy can be thought of as an outerrnost-fair-like strategy that is allowed to be unfair to some redex of a term when contracting the redex is useless for the normalization 作者: 疏忽 時間: 2025-3-28 21:56 作者: 胰島素 時間: 2025-3-29 02:50 作者: Alveoli 時間: 2025-3-29 03:17
Logic programs as term rewriting systems, program computes a TRS. For a relevant class of logic programs, called Simply Well Moded (SWM), there is a one-to-one correspondence between computed answer substitutions of the logic program and normal forms of the corresponding TRS. Moreover the transform preserves termination, i.e., a logic prog作者: Harpoon 時間: 2025-3-29 07:28 作者: ectropion 時間: 2025-3-29 12:34 作者: Gossamer 時間: 2025-3-29 16:17 作者: Volatile-Oils 時間: 2025-3-29 19:56
Proving implications by algebraic approximation,ain the size of which is related to the number of constants in .. Both the known as well as the new results have high potential in providing practical automated techniques in various areas of application in computer science.作者: 門窗的側柱 時間: 2025-3-30 00:35
Compositional analysis for equational Horn programs,iability of an equation set with respect to a given equational theory. We also show that our method allows us to perform computations and analysis incrementally in a Constraint Equational setting and that the test of satisfiability in this setting can be done in parallel.作者: rods366 時間: 2025-3-30 07:52
Logic programs as term rewriting systems,ram terminates iff the corresponding TRS terminates. This transform is refined in such a way that the above results hold for a relevant class of unification free programs containing SWM, the class of Flatly Well Moded (FWM) programs.作者: ALB 時間: 2025-3-30 09:12
0302-9743 the papers are organized into sections on theorem proving, narrowing, logic programming, term rewriting, and higher-order programming.978-3-540-58431-5978-3-540-48791-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Aphorism 時間: 2025-3-30 15:39 作者: staging 時間: 2025-3-30 19:46 作者: Duodenitis 時間: 2025-3-30 23:31
Sufficient completeness and parameterized proofs by induction,lete and the constructors are not free. The method has been implemented in the prover SPIKE. Based on computer experiments, the method appears to be more practical and efficient than inductive theorem proving in non-parameterized specifications. Moreover, SPIKE offers facilities to check and complete definitions.作者: intangibility 時間: 2025-3-31 03:20 作者: 管理員 時間: 2025-3-31 09:04
https://doi.org/10.1007/978-1-4471-2377-4 to a given first-order specification is equivalent to the standard validity of the same formula in a suitably enriched specification. As a consequence any proof system for first-order logic can be used to prove the behavioural validity of first-order formulas.作者: 我不死扛 時間: 2025-3-31 11:50
https://doi.org/10.1007/978-3-319-75259-4 the solutions of this geometrical system corresponding to the solutions of the original algebraic problem. As a corollary, unification in planar ternary rings is finitary and constitutes a decidable class of problems for which a type conformal algorithm exists.
