Algebraic Properties of Idempotent Substitutions

This paper presents an algebra of idempotent substitutions whose operations have many properties. We provide an algorithm to compute these operations and we show how they are related to the standard composition. The theory of Logic Programming can be rewritten in terms of these new operations. The advantages are that both the operational and the declarative semantics of Horn Clause Logic can be formalized in a compositional way and the proofs of standard results, like the switching lemma, get easier and more intuitive. Moreover, this formalization can be naturally extended to a parallel computational model, and therefore it can be regarded as a basis for a theory of concurrent logic programming.

[1]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[2]  Elmar Eder,et al.  Properties of Substitutions and Unifications , 1983, J. Symb. Comput..

[3]  Michael J. Maher,et al.  Logic Programming Language Scheme , 1986, Logic Programming: Functions, Relations, and Equations.

[4]  Michael J. Maher.  Logic Semantics for a Class of Committed-Choice Programs , 1987, ICLP.

[5]  Michael Codish,et al.  Fully abstract denotational semantics for concurrent Prolog , 1987 .

[6]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[7]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[8]  Joost N. Kok,et al.  Uniform Abstraction, Atomicity and Contractions in the Comparative Semantics of Concurrent Prolog , 1988, FGCS.

[9]  Joost N. Kok.  A Compositional Semantics for Concurrent Prolog , 1988, STACS.

[10]  Michael Codish,et al.  Fully abstract denotational semantics for flat Concurrent Prolog , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[11]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[12]  Michael J. Maher,et al.  Unification Revisited , 1988, Foundations of Deductive Databases and Logic Programming..

[13]  Krzysztof Apt.  Introduction to logic programming (revised and extended version) , 1988 .

[14]  C. Palamidessi.  A fixpoint semantics for guarded Horn clauses , 1988 .

[15]  Giorgio Levi,et al.  A New Declarative Semantics for Logic Languages , 1988, ICLP/SLP.

[16]  F. S. Boer,et al.  Semantic Models for a Version of PARLOG , 1989, ICLP.

[17]  Frank S. de Boer,et al.  Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses , 1989, MFCS.

[18]  Giorgio Levi,et al.  Declarative Modeling of the Operational Behavior of Logic Languages , 1989, Theor. Comput. Sci..

[19]  Dana S. Scott,et al.  Concurrent constraint programming languages , 1989 .

[20]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[21]  Michael J. Maher,et al.  Reactive Behaviour Semantics for Concurrent Constraint Logic Programs , 1989, NACLP.

[22]  Corso Italia.  From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic * , 1990 .

[23]  Jean-Marie Jacquet.  Conclog: A Methodological Approach to Concurrent Logic Programming , 1991, Lecture Notes in Computer Science.