Compositionality of normal open logic programs

Journal of Logic Programming

Volumn 42, Issue 3, 2000, Pages 151-183

  Verbaeten, Sofie ^a   Denecker, Marc ^a   De Schreye, Danny ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS;

COMPOSITIONALITY; NORMAL OPEN LOGIC PROGRAMMING;

LOGIC PROGRAMMING;

EID: 0033909820     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00003-5     Document Type: Article

References (31)

1. K.R. Apt, R.N. Bol, Logic programming and negation: a survey, Journal of Logic Programming 19 (1994) 9-71.
2. K.R. Apt, M. Bezem, Acyclic programs, in: D.H.D. Warren, P. Szeredi (Ed.), Proceedings of the International Conference on Logic Programming, MIT press, Cambridge, MA, 1990, pp. 617-633.
3. A. Bossi, M. Gabbrielli, G. Levi, M.C. Meo, Contributions to the semantics of open logic programs, in: ICOT (Ed.), Proceedings of the International Conference on Fifth Generating Computer Systems, 1992.
4. S. Brass, J. Dix, Characterizations of the disjunctive stable semantics by partial evaluation, Journal of Logic Programming 3 (XXII) (1997) 207-228.
5. A. Brogi, Program construction in computational logic, Ph.D. Thesis, Dipartimento di Informatica Universita di Pisa, 1993.
6. A. Brogi, S. Contiero, F. Turini, Composing general logic programs, in: J. Dix, U. Furbach, A. Nerode (Eds.), Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'97, Lecture Notes in Computer Science 1265, Springer, Berlin, 1997, pp. 274-289.
7. A. Brogi, E. Lamma, P. Mancarella, P. Mello, Normal logic programs as open positive programs, in: K. Apt (Ed.), Proceedings of JICSLP, MIT press, Cambridge, MA, 1992, pp. 783-797.
8. A. Brogi, E. Lamma, P. Mello, Open logic theories, in: L.-H. Eriksson, L. Hallnas, P. Schroeder-Heister (Eds.), Proceedings of the Second International Workshop on Extensions of Logic Programming, Springer, Berlin, 1991, pp. 73-88.
9. A. Brogi, E. Lamma, P. Mello, Compositional model-theoretic semantics for logic programs, New Generation Computing 11 (1) (1992) 1-21.
10. F. Bry, A compositional semantics for logic programs and deductive databases, in: M. Maher (Ed.), Proceedings of JICSLP, MIT press, Cambridge, MA, 1996, pp. 453-467.
11. M. Bugliesi, E. Lamma, P. Mello, Modularity in logic programming, Journal of Logic Programming 20 (1994) 443-502.
12. M. Denecker, Knowledge representation and reasoning in incomplete logic programming, Ph.D. Thesis, Department of Computer Science, K.U. Leuven, 1993.
13. M. Denecker, A terminological interpretation of (Abductive) logic programming, in: V.W. Marek, A. Nerode, M. Truszczynski (Eds.), International Conference on Logic Programming and Nonmonotonic Reasoning, Springer, Lecture notes in Artificial Intelligence 928, 1995, pp. 15-29.
14. M. Denecker, D. De Schreye, Justification semantics: a unifying framework for the semantics of logic programs, in: L.M. Pereira, A. Nerode (Eds.), Proc. of the Second International Workshop on Logic Programming and Nonmonotonic Reasoning, MIT press, Cambridge, MA, 1993, pp. 365-379.
15. Jürgen Dix, Classifying semantics of disjunctive logic programs, in: K.R. Apt (Ed.), Proceedings of the 1992 Joint International Conference and Symposium, MIT Press, Cambridge, MA, 1992, pp. 798-812.
16. J. Dix, A classification-theory of semantics of normal logic programs: II. Weak properties, Fundamenta Informaticae 3 (XXII) (1995) 228-257.
17. A. Lallouet, G. Ferrand, A compositional proof method of partial correctness for normal logic programs, in: J. Lloyd (Ed.), Proceedings of ILPS, MIT press, Cambridge, MA, 1995, pp. 210-223.
18. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: R.A. Kowalski, K.A. Bowen (Eds.), Proceedings of the Fifth International Joint Conference and Symposium on Logic Programming, MIT press, Cambridge, MA, 1988, pp. 1070-1080.
19. M. Gelfond, H. Przymusinska, Definitions in epistemic specifications, in: A. Nerode, W. Marek, V.S. Subrahmanian (Eds.), Proceedings of the First International Workshop on Logic Programming and Non-monotonic Reasoning, MIT press, Cambridge, MA, 1991, pp. 245-259.
20. M. Gelfond, H. Przymusinska, Toward a theory of elaboration tolerance for logic programs, International Journal on Software and Knowledge Engineering 6 (1) (1996) 89-112.
21. L. Giordano, A. Martelli, A modal reconstruction of blocks and modules in logic programming, in: V.A. Saraswat, K. Ueda (Eds.), Proceedings of the International Logic Programming Symposium, The MIT Press, Cambridge, MA, 1991, pp. 239-253.
22. R.A. Kowalski, M. Sergot, A logic-based calculus of events, New Generation Computing 4 (4) (1986) 319-340.
23. V. Lifschitz, H. Turner, Splitting a logic program, in: P. van Hentenryck (Ed.), Proceedings of the 11th International Conference on Logic Programming, MIT press, Cambridge, MA, 1994, pp. 23-38.
24. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
25. L. Monteiro, A. Porto, Contextual logic programming, in: G. Levi, M. Martelli (Eds.), Proceedings of the Sixth International Conference on Logic Programming, MIT press, Cambridge, MA, 1989, pp. 284-299.
26. R.C. Moore, The role of logic in knowledge representation and commonsense reasoning, in: D.L. Waltz (Ed.), Proceedings of AAAI-82, AAAI Press, 1982, pp. 428-433.
27. L.M. Pereira, J.N. Aparicio, J.J. Alferes, Hypothetical reasoning with well-founded semantics, in: B. Mayoh (Ed.), Proceedings of the Third Scandinavian Conference on AI, IOS Press, 1991.
28. F. Teusink, S. Etalle, A compositional semantics for normal open programs, in: M. Maher (Ed.), Proceedings of JICSLP, MIT press, Cambridge, MA, 1996, pp. 468-482.
29. M. Shanahan, A circumscriptive calculus of events, Artificial Intelligence 77 (1995) 249-284.
30. A. Van Gelder, K.A. Ross, J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38 (3) (1991) 620-650.
31. S. Verbaeten, M. Denecker, D. De Schreye, Compositionality of normal open logic programs, in: J. Maluszynski (Ed.), Proceedings of the International Logic Programming Symposium, The MIT Press, Cambridge, MA, 1997, pp. 371-386.