Composing General Logic Programs

The program composition approach can be fruitfully applied to combine general logic programs, i.e. logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation capabilities of logic programming for non-monotonic reasoning. Examples of modular programming, hierarchical reasoning, constraints, and rules with exceptions will be illustrated. The semantics of programs and program compositions is defined in terms of three-valued logic [15]. The computational interpretation of program compositions is formalised by an equivalence preserving syntactic transformation of arbitrary program compositions into standard general programs.

[1]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

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

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

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

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

[6]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[7]  Antonio Brogi,et al.  Modular logic programming , 1994, TOPL.

[8]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[9]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[10]  Krzysztof R. Apt,et al.  Logic Programming and Negation: A Survey , 1994, The Journal of Logic Programming.

[11]  Franco Turini,et al.  A Transformational Approach to Negation in Logic Programming , 1990, J. Log. Program..

[12]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[13]  Wlodzimierz Drabent,et al.  Completeness of SLDNF-Resolution for Nonfloundering Queries , 1993, J. Log. Program..

[14]  Francis G. McCabe,et al.  Logic and objects , 1992, Prentice Hall International Series in Computer Science.

[15]  Antonio Brogi,et al.  Fully Abstract Composition Semantics for an Algebra of Logic Programs , 1995, Theor. Comput. Sci..

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

[17]  Robert A. Kowalski,et al.  Problems and Promises of Computational Logic , 1990 .

[18]  Hendrik Decker,et al.  Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution , 1989, CSL.

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

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

[21]  John W. Lloyd,et al.  A Basis for Deductive Database Systems , 1985, J. Log. Program..

[22]  Evelina Lamma,et al.  A Unifying View for Logic Programming with Non-Monotonic Reasoning , 1997, Theor. Comput. Sci..