On the semantics of logic program composition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3049, Issue , 2004, Pages 115-151

  Brogi, Antonio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048865950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25951-0_5     Document Type: Article

References (42)

1. K. Apt, M. Gabbrielli, and D. Pedreschi. A closer look to declarative interpretations. Journal of Logic Programming, 28 (2):147-180, 1996.
2. K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493-574. Elsevier, 1990. Vol. B.
3. K. R. Apt and R. Bol. Logic Programming and Negation: A Survey. Journal of Logic Programming, 19-20:9-71, 1994.
4. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19-20:73-148, 1994.
5. R. Barbuti, P. Mancarella, D. Pedreschi, and F. Turini. A Transformational Approach to Negation in Logic Programming. Journal of Logic Programming, 8:201228, 1990.
6. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and applications. Journal of Logic Programming, 19-20:149-197, 1994.
7. A. Brogi. Program Construction in Computational Logic. PhD thesis, Department of Computer Science, University of Pisa, 1993.
8. A. Brogi, S. Contiero, and F. Turini. Programming by composing general logic programs. Journal of Logic and Computation, 9(l):7-24, 1999.
9. A. Brogi, E. Lamma, P. Mancarella, and P. Mello. A unifying view for logic programming with non-monotonic reasoning. Theoretical Computer Science, 184(1):159, 1997.
10. A. Brogi, E. Lamma, and P. Mello. Compositional Model-theoretic Semantics for Logic Programs. New Generation Computing, 11(1):1-21, 1992.
11. A. Brogi, P. Mancarella, D. Pedreschi, and F. Turini. Composition Operators for Logic Theories. In J.W. Lloyd, editor, Computational Logic, Symposium Proceedings, pages 117-134. Springer-Verlag, 1990.
12. A. Brogi and F. Turini. Fully abstract compositional semantics for an algebra of logic programs. Theoretical Computer Science, 149(2):201-229, 1995.
13. F. Bry. A Compositional Semantics for Logic Programs and Deductive Databases. In M. Maher, editor, Proc. of the Joint International Conference and Symposium on Logic Programming, pages 453-467, 1996.
14. M. Bugliesi, E. Lamma, and P. Mello. Modularity in logic programming. Journal of Logic Programming, 19,20:443-502, 1994.
15. K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum, 1978.
16. C.V. Damasio and L.M. Pereira. Abduction over 3-valued extended logic programs. In Proc. 3rd Int. Workshop on Logic Programming and Non Monotonic Reasoning, pages 29-42. Springer-Verlag, 1995.
17. P.M. Dung. Negation as hypothesis: An abductive foundation for logic programming. In K. Furukawa, editor, Proc. 8th Int. Conf. on Logic Programming ICLP91, pages 3-17. The MIT Press, 1991.
18. P.M. Dung and P. Ruamviboonsuk. Well-founded reasoning with classical negation. In Proc. 1st Int. Workshop on Logic Programming and Non-Monotonic Reasoning, pages 120-132. The MIT Press, 1991. .
19. K. Eshghi and R.A. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proc. 6th Int. Conf. on Logic Programming ICLP89, pages 234-254. The MIT Press, 1989.
20. S. Etalle and F. Teusink. A Compositional Semantics for Normal Open Programs. In M. Maher, editor, JICSLP 96 Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 468-482, 1996.
21. M. Fitting. A Kriple-Kleene semantics for general logic programs. Journal of Logic Programming, 4:295-312, 1985.
22. M. Gabbrielli, G. Levi, and M. C. Meo. Observable behaviors and equivalences of logic programs. Information and Computation, pages 1-29, 1995.
23. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, 1988, pages 1070-1080. The MIT Press, 1988.
24. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In D.H.D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference and Symposium on Logic Programming, pages 579-597. The MIT Press, 1990.
25. G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. Journal of the ACM, 32(2):280-295, 1985.
26. A.C. Kakas and P. Mancarella. Generalized stable models: a semantics for abduction. In Proceedings of 9th European Conference on Artificial Intelligence ECAI90, pages 385-391. Pitman Publishing, 1990.
27. J.L. Lassez and M.J. Maher. Closures and fairness in the semantics of logic programming. Theoretical Computer Science, 29:167-184, 1984.
28. V. Lifschitz and H. Turner. Splitting a logic program. In P. Van Entenryck, editor, Proc. llth International Conference on Logic Programming, pages 23-37. The MIT Press, 1994.
29. J.W. Lloyd. Foundations of logic programming. Springer-Verlag, second edition, 1987.
30. M.J. Maher. Equivalences of logic programs. In J. Minker, editor, Deductive databases and logic programming, pages 627-658. Morgan Kaufmann, 1988.
31. P. Mancarella and D. Pedreschi. An algebra of logic programs. In R. A. Kowalski and K. A. Bowen, editors, Proceedings Fifth International Conference on Logic Programming, pages 1006-1023. The MIT Press, 1988.
32. R. Milner. Fully abstract models for typed λ-calculi. Theoretical Computer Science, 4:1-23, 1977.
33. R. O'Keefe. Towards an algebra for constructing logic programs. In J. Cohen and J. Conery, editors, Proceedings of IEEE Symposium on Logic Programming, pages 152-160. IEEE Computer Society Press, 1985.
34. L.M. Pereira and J.J. Alferes. .Well founded semantics for logic programs with explicit negation. In Proc. ECAI92, pages 102-106. John Wiley and Sons, 1992.
35. A. Pettorossi and M. Proietti. Transformations of logic programs: Foundations and techniques. Journal of Logic Programming, 19 & 20:261-320, 1994.
36. G.D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-256, 1977.
37. T. Przymusinski. Extended stable semantics for normal and disjunctive programs. In D.H.D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference and Symposium on Logic Programming, pages 459-477. The MIT Press, 1990.
38. T. Przymusinski. Stationary semantics for normal and disjunctive logic programs. In C. Delobel, M. Kifer, and Y. Masunagar, editors, Proceedings of DOOD'91. Springer-Verlag, 1991.
39. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 153-173. Plenum, 1978.
40. M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733-742, 1976.
41. A. van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.
42. S. Verbaeten, M. Denecker, and D. De Schreye. Compositionality of normal open logic programs. Journal of Logic Programming, 41(3):151-183, 2000.