N. Dershowitz and N. A. Josephson. Logic programming by completion. In Sten- Ake Tarnlund, editor, Proceedings of the Second International Conference on Logic Programming, Uppsala, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Answer Synthesis as a Formalism for Validation - Richard, Saubion (Correct)
....kind of specification is particularly well suited for mathematical domains of computation (integers, lists, etc. The operational semantics is computed thanks to an alternative resolution mechanism based on an extension of the Knuth Bendix completion procedure, called Linear Completion (LC) [2, 5] (see section 2) From a theoretical point of view, this mechanism is equivalent to Prolog but has a much more efficient behavior than standard SLD resolution. It provides three main advantages : more frequent termination, a synthesis ability and the fact that answers are presented as sets of ....
....completion procedure. This approach is developed in section 3 where we exhibit some examples. 2 Linear completion : a brief review Application of term rewriting systems to provide new execution mechanisms for logic programs has been widely studied : Linear Completion, issued from the works of [5, 2], is such a mechanism. LC has been extended in [1, 11] to a full CLP framework, including constructive negation. 1 By transforming clauses into logical equivalences considered as rewrite rules, logic programs are represented as rewrite programs whose operational mechanism is derived from the ....
N. Dershowitz and N.A. Josephson. Logic Programming by Completion. In Proceedings of the 2nd ICLP, pages 313--320, 1984.
On Completion of Constraint Handling Rules - Abdennadher, Frühwirth (1998) (2 citations) (Correct)
....generic answers, even if a constraint cannot further be simplified. This retains some of the power of logic languages like Prolog, where several answers can be given, while avoiding infinitely many answers. Our approach is similar to the ones that related Prolog and TRS computation methods [DJ84,BH92] Example 8. A CHR formulation of the classical Prolog predicate member as a user defined constraint is (6= is built in) r1 member(X, false. r2 member(X, X ] true. r3 member(X, H T] X 6= H member(X,T) Using CHR, the goal member(X, 1,2,3] delays. However Prolog ....
N. Dershowitz and N. A. Josephson. Logic programming by completion. In Sten- Ake Tarnlund, editor, Proceedings of the Second International Conference on Logic Programming, Uppsala, 1984.
A Rewrite Approach for Constraint Logic Programming - Gilles Richard (1995) (Correct)
....set of solutions (0; 1) 1; 2) This impossibility to give a finite representation of the set of answers for some classes of queries constitutes a drawback of a CLP interpreter. Rewrite techniques help to overcome these problems. In the case of pure logic programs, the rewrite approach of [4] and [3] is very powerful. The main idea underlying these works is to encode predicates as boolean valued functions and to transform logic clauses into rewrite rules taking into account the user intended semantics. The usual evaluation mechanism is extended with linear superposition which ....
N. Dershowitz and N.A. Josephson. Logic programming by completion. In Proceedings of the 2nd ICLP, pages 313--320, 1984.
On Partial Validation of Logic Programs - Limet, Saubion (1997) (1 citation) (Correct)
....integration of different rewriting based techniques. In fact, the first problem is the finite computation of infinite sets of answers. This can be achieved by using an alternative resolution mechanism based on an extension of the Knuth Bendix completion procedure, called Linear Completion (LC) [2, 3] (see section 3) From a theoretical point of view, this mechanism is equivalent to Prolog but has a much more efficient behavior than standard SLD resolution. It provides three main advantages : more frequent termination (by pruning unproductive loops) a synthesis ability (i.e. representation of ....
....i.e. the evaluation mechanism used to compute the operational semantics of the logic program. 3 Linear completion : a brief review Application of term rewriting systems has been widely studied to provide new execution mechanisms for logic programs. Linear Completion is issued from the works of [3, 2] and has been extended in [1] to include constructive negation. By transforming clauses into logical equivalences considered as rewrite rules, logic programs are represented as rewrite programs whose operational mechanism is derived from the Knuth Bendix completion procedure. One of the main ....
N. Dershowitz and N.A. Josephson. Logic Programming by Completion. In Proceedings of the 2nd ICLP, pages 313--320, 1984.
Answer Synthesis for CLP Programs with Negation - Richard, Saubion (1996) (1 citation) (Correct)
.... in the pure logic programming field [5, 33] and to provide new execution mechanisms, generally based on extensions of Knuth Bendix completion procedure [24] allowing to deal with larger classes of formulas than standard Horn clauses [3, 4, 18, 19, 27] In [9] Bonacina and Hsiang, inspired by [14], adapt such techniques to a pure logic programming framework and propose an evaluation mechanism based on a strongly restricted form of Knuth Bendix algorithm : Linear Completion (LC) From a theoretical point of view, this mechanism is equivalent to Prolog but has a really more efficient ....
....rules while these completion procedures work directly with logic clauses. ffl Our system is fully top down (i.e. goal oriented) while usual completion procedures allow bottom up computation steps which could affect efficiency, at least in the pure logic programming case. Our approach, extending [9, 14], integrates both constraints and negation paradigms. The resulting mechanism provides a synthesis and loop avoiding ability due to the introduction of a powerful simplification rule. On the logic programming side, the looping problem receives considerable attention, at least in the pure case ( 7, ....
N. Dershowitz and N.A. Josephson. Logic Programming by Completion. In Proceedings of the 2nd ICLP, pages 313--320, 1984.
Semantic Unification for Convergent Systems - Mitra (1994) (11 citations) Self-citation (Dershowitz) (Correct)
....years, numerous different approaches have been suggested for this combination, including [Barbuti et al. 1986; Bellia and Levi, 1986; Reddy, 1986; Subrahmanyam and You, 1986] see [DeGroot and Lindstrom, 1986] for a survey of the area. One popular idea is based on conditional equational theories [Dershowitz and Josephson, 1984; Goguen and Meseguer, 1984; Fribourg, 1985; Lindstrom, 1985; Dershowitz and Plaisted, 1988; Cheong and Fribourg, 1993] In the equational programming paradigm proposed by Dershowitz and Plaisted [1988] see also [Josephson and Dershowitz, 1989; Dershowitz and Okada, 1990] computation consists ....
N. Dershowitz and A. N. Josephson. Logic programming by completion. Proceedings of the Second International Logic Programming Conference, Uppsala, Sweden, pages 313--320, 1984.
On Completion of Constraint Handling Rules - Abdennadher, Frühwirth (1998) (2 citations) (Correct)
No context found.
N. Dershowitz and N. A. Josephson. Logic programming by completion. In Sten- Ake Tarnlund, editor, Proceedings of the Second International Conference on Logic Programming, Uppsala, 1984.
A New Procedural Interpretation of Horn Clauses with Equality - Degtyarev, Voronkov (1994) (Correct)
No context found.
N. Dershowitz and N.A. Josephson. Logic programming by completion. In S.- A. Tarnlund, editor, 2nd International Logic Programming Conference, pages 312--320, Uppsala, 1984.
Some Termination Properties of Linear Completion - Privault, Richard (Correct)
No context found.
N. Dershowitz, N.A. Josephson "Logic programming by completion", Proceedings of the 2nd ICLP, Uppsala, Sweden, 1984.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC