Resultants Semantics for Prolog

In this paper we study some rst order formulas, called resultants, which can be used to describe in a concise way most of the relevant information associated to SLD-derivations. We rst extend to resultants some classical results of logic programming theory. Then we deene a xpoint semantics for Prolog computed resultants, i.e. those formulas which are obtained by considering the leftmost selection rule. Suitable abstractions of such a semantics are then used to model call patterns and partial answers. Finally we show how these results can be generalized to a larger class of selection rules.

[1]  Laurent Vieille,et al.  Recursive Query Processing: The Power of Logic , 1989, Theor. Comput. Sci..

[2]  Michael J. Maher,et al.  A Unified Treatment of Resolution Strategies for Logic Programs , 1984, ICLP.

[3]  Maurizio Gabbrielli,et al.  A Compositional Semantics for Logic Programs , 1994, Theor. Comput. Sci..

[4]  Sandro Etalle,et al.  Modular Transformations of CLP Programs , 1994, ILPS Workshop: Constraints and Databases.

[5]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[6]  Maurizio Gabbrielli,et al.  Observable Behaviors and Equivalences of Logic Programs , 1995, Inf. Comput..

[7]  Saumya K. Debray,et al.  Formal bases for dataflow analysis of logic programs , 1995 .

[8]  John C. Shepherdson,et al.  Unfold/fold transformations of logic programs , 1992, Mathematical Structures in Computer Science.

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

[10]  Keith L. Clark.  Predicate logic as a computational formalism , 1979 .

[11]  Krzysztof R. Apt,et al.  An Analysis of Loop Checking Mechanisms for Logic Programs , 1991, Theor. Comput. Sci..

[12]  Giorgio Levi,et al.  An Algebraic Theory of Observables , 1994, ILPS.

[13]  Maurizio Gabbrielli,et al.  The s-Semantics Approach: Theory and Applications , 1994, J. Log. Program..

[14]  Maurizio Gabbrielli,et al.  Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns , 1992, ALP.

[15]  Catuscia Palamidessi,et al.  Algebraic Properties of Idempotent Substitutions , 1990, ICALP.

[16]  Maurizio Gabbrielli,et al.  Observational Equivalences for Logic Programs , 1992, Joint International Conference and Symposium on Logic Programming.

[17]  Michael J. Maher,et al.  Oracle Semantics for Prolog , 1992, Inf. Comput..

[18]  Haim Gaifman,et al.  Fully abstract compositional semantics for logic programs , 1989, POPL '89.

[19]  Elmar Eder.  Properties of Substitutions and Unifications , 1983, GWAI.

[20]  Michel Berg,et al.  Independence of the Computation Rule for Sld-resolution with Delay , 1993 .

[21]  Henryk Jan Komorowski,et al.  A specification of an abstract Prolog machine and its application to partial evaluation , 1981 .

[22]  John W. Lloyd,et al.  Partial Evaluation in Logic Programming , 1991, J. Log. Program..

[23]  Jean-Marie Jacquet,et al.  Introduction to Logic Programming , 1993, ICLP Workshop on Construction of Logic Programs.