Compositionality of Normal Open Logic Programs

Compositionality of programs is an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly been studied for definite programs only. Here, we study compositionality in the context of normal open logic programming. This is a logic for knowledge representation in the context of uncertainty and incomplete knowledge on concepts and on problem domain, in which the compositionality issue turns up very naturally. The semantics of the logic is a generalisation (allowing non-Herbrand interpretations) of the well-founded semantics. We provide a number of results which oAer diAerent suAcient conditions under which the models of the composition of two theories can be related to the intersection of the models of the composing theories. In particular, under these conditions, logical consequence will be preserved under composition. ” 2000 Elsevier Science Inc. All rights reserved.

[1]  Anil Nerode,et al.  Justification semantics: a unifying framework for the semantics of Logic Programs , 1993 .

[2]  Antonio Brogi,et al.  Composing General Logic Programs , 1997, LPNMR.

[3]  Jürgen Dix,et al.  Classifying Semantics of Disjunctive Logic Programs , 1992, JICSLP.

[4]  Robert C. Moore.  The Role of Logic in Knowledge Representation and Commonsense Reasoning , 1982, AAAI.

[5]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[6]  Michael Gelfond,et al.  Definitions in Epistemic Specifications , 1991, LPNMR.

[7]  Danny De Schreye,et al.  Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs , 1993, International Conference on Logic Programming and Non-Monotonic Reasoning.

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

[9]  Jürgen Dix,et al.  Characterizations of the Disjunctive Stable Semantics by Partial Evaluation , 1997, J. Log. Program..

[10]  Murray Shanahan,et al.  A Circumscriptive Calculus of Events , 1995, Artif. Intell..

[11]  Michael Gelfond,et al.  Towards a Theory of Elaboration Tolerance: Logic Programming Approach , 1996, Int. J. Softw. Eng. Knowl. Eng..

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

[13]  José Júlio Alferes,et al.  Hypothetical Reasoning with Well Founded Semantics , 1991, SCAI.

[14]  Evelina Lamma,et al.  Open Logic Theories , 1991, ELP.

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

[16]  Laura Giordano,et al.  A Modal Reconstruction of Blocks and Modules in Logic Programming , 1991, ISLP.

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

[18]  François Bry.  A Compositional Semantics for Logic Programs and Deductive Databases , 1996, JICSLP.

[19]  Marc Denecker,et al.  A Terminological Interpretation of (Abductive) Logic Programming , 1995, LPNMR.

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

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

[22]  Marc Denecker,et al.  Knowledge representation and reasoning in incomplete logic programming , 1993 .

[23]  Luís Monteiro,et al.  Contextual Logic Programming , 1989, ICLP.

[24]  Evelina Lamma,et al.  Normal logic programs as open positive programs , 1992, CNKBS.

[25]  Maurizio Gabbrielli,et al.  Contributions to the Semantics of Open Logic Programs , 1992, FGCS.

[26]  Evelina Lamma,et al.  Modularity in Logic Programming , 1994, J. Log. Program..