An Algebraic Framework for the Definition of Compositional Semantics of Normal Logic Programs

The aim of our work is the definition of compositional semantics for modular units over the class of normal logic programs. In this sense, we propose a declarative semantics for normal logic programs in terms of model classes that is monotonic in the sense that Mod(PUP') is included in Mod(P), for any programs P and P', and we show that in the model class associated to every program there is a least model that can be seen as the semantics of the program, which may be built upwards as the least fix point of a continuous immediate consequence operator. In addition, it is proved that this least model is "typical" for the class of models of the Clark-Kunen's completion of the program. This means that our semantics is equivalent to Clark-Kunen's completion. On the other hand, following the approach defined in a previous paper, it is shown that our semantics constitutes a "specification frame" equipped with the adequate categorical constructions needed to define compositional and fully abstract (categorical) semantics for a number of program units. In particular, we provide acategorical semantics of arbitrary normal logic program fragments which is compositionaland fully abstract with respect to the (standard) union.

[1]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[2]  Hartmut Ehrig,et al.  Institutions for Logic Programming , 1997, Theor. Comput. Sci..

[3]  Hartmut Ehrig,et al.  New Concepts for Amalgamation and Extension in the Framework of Specification Logics , 1993, Current Trends in Theoretical Computer Science.

[4]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[5]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[6]  Arnaud Lallouet,et al.  A Compositional Proof Method of Partial Correctness for Normal Logic Programs , 1995, ILPS.

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

[8]  Joseph A. Goguen,et al.  The Semantics of CLEAR, A Specification Language , 1979, Abstract Software Specifications.

[9]  Danny De Schreye,et al.  Compositionality of Normal Open Logic Programs , 1997, J. Log. Program..

[10]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.

[11]  Dale Miller,et al.  A Logical Analysis of Modules in Logic Programming , 1989, J. Log. Program..

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

[13]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[14]  David Chan,et al.  Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[15]  autoepistemic Zogic.  Logic programming and negation : a survey , 2001 .

[16]  Peter J. Stuckey,et al.  Negation and Constraint Logic Programming , 1995, Inf. Comput..

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

[18]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[19]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[20]  Antonio Brogi,et al.  Programming by Combining General Logic Programs , 1999, J. Log. Comput..

[21]  L. Thorne McCarty,et al.  Adding Negation-as-Failure to Intuitionistic Logic Programming , 1990, NACLP.

[22]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[23]  Michael J. Maher.  A Logic Programming View of CLP , 1993, ICLP.

[24]  Sandro Etalle,et al.  A Compositional Semantics for Normal Open Programs , 1996, JICSLP.

[25]  Joseph A. Goguen,et al.  Institutions: abstract model theory for specification and programming , 1992, JACM.

[26]  Jan van Leeuwen,et al.  Formal models and semantics , 1990 .

[27]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[28]  Hartmut Ehrig,et al.  On Recent Trends in Algebraic Specification , 1989, ICALP.

[29]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[30]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

[32]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[33]  François Fages,et al.  Constructive Negation by Pruning , 1997, J. Log. Program..

[34]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[35]  A. Troelstra,et al.  Constructivism in Mathematics: An Introduction , 1988 .

[36]  Joseph A. Goguen,et al.  Introducing Institutions , 1983, Logic of Programs.

[37]  Michele Bugliesi,et al.  Differential logic programming , 1993, POPL '93.