Skip to main content
SpringerLink
Log in

On the Semantics of Logic Program Composition

  • Chapter
Program Development in Computational Logic

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3049))

Abstract

This paper aims at offering an insightful synthesis of different compositional semantics for logic program composition which have been developed in the literature. In particular, we will analyse the notions of program equivalence, compositionality, and full abstraction for logic programs. We will show how the notion of supported interpretation provides a unifying compositional model-theoretic characterisation both of positive programs and of programs containing negation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K., Gabbrielli, M., Pedreschi, D.: A closer look to declarative interpretations. Journal of Logic Programming 28(2), 147–180 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Apt, K.R.: Logic programming. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 493–574. Elsevier, Amsterdam (1990)

    Google Scholar 

  3. Apt, K.R., Bol, R.: Logic Programming and Negation: A Survey. Journal of Logic Programming 19-20, 9–71 (1994)

    Article  MathSciNet  Google Scholar 

  4. Baral, C., Gelfond, M.: Logic programming and knowledge representation. Journal of Logic Programming 19-20, 73–148 (1994)

    Article  MathSciNet  Google Scholar 

  5. Barbuti, R., Mancarella, P., Pedreschi, D., Turini, F.: A Transformational Approach to Negation in Logic Programming. Journal of Logic Programming 8, 201–228 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bossi, A., Gabbrielli, M., Levi, G., Martelli, M.: The s-semantics approach: Theory and applications. Journal of Logic Programming 19-20, 149–197 (1994)

    Article  MathSciNet  Google Scholar 

  7. Brogi, A.: Program Construction in Computational Logic. PhD thesis, Department of Computer Science, University of Pisa (1993)

    Google Scholar 

  8. Brogi, A., Contiero, S., Turini, F.: Programming by composing general logic programs. Journal of Logic and Computation 9(1), 7–24 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Brogi, A., Lamma, E., Mancarella, P., Mello, P.: A unifying view for logic programming with non-monotonic reasoning. Theoretical Computer Science 184(1), 1–59 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  10. Brogi, A., Lamma, E., Mello, P.: Compositional Model-theoretic Semantics for Logic Programs. New Generation Computing 11(1), 1–21 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Brogi, A., Mancarella, P., Pedreschi, D., Turini, F.: Composition Operators for Logic Theories. In: Lloyd, J.W. (ed.) Computational Logic, Symposium Proceedings, pp. 117–134. Springer, Heidelberg (1990)

    Google Scholar 

  12. Brogi, A., Turini, F.: Fully abstract compositional semantics for an algebra of logic programs. Theoretical Computer Science 149(2), 201–229 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bry, F.: A Compositional Semantics for Logic Programs and Deductive Databases. In: Maher, M. (ed.) Proc. of the Joint International Conference and Symposium on Logic Programming, pp. 453–467 (1996)

    Google Scholar 

  14. Bugliesi, M., Lamma, E., Mello, P.: Modularity in logic programming. Journal of Logic Programming 19-20, 443–502 (1994)

    Article  MathSciNet  Google Scholar 

  15. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum, New York (1978)

    Google Scholar 

  16. Damasio, C.V., Pereira, L.M.: Abduction over 3-valued extended logic programs. In: Proc. 3rd Int. Workshop on Logic Programming and Non Monotonic Reasoning, pp. 29–42. Springer, Heidelberg (1995)

    Google Scholar 

  17. Dung, P.M.: Negation as hypothesis: An abductive foundation for logic programming. In: Furukawa, K. (ed.) Proc. 8th Int. Conf. on Logic Programming ICLP 1991, pp. 3–17. The MIT Press, Cambridge (1991)

    Google Scholar 

  18. Dung, P.M., Ruamviboonsuk, P.: Well-founded reasoning with classical negation. In: Proc. 1st Int. Workshop on Logic Programming and Non-Monotonic Reasoning, pp. 120–132. The MIT Press, Cambridge (1991)

    Google Scholar 

  19. Eshghi, K., Kowalski, R.A.: Abduction compared with negation by failure. In: Levi, G., Martelli, M. (eds.) Proc. 6th Int. Conf. on Logic Programming ICLP 1989, pp. 234–254. The MIT Press, Cambridge (1989)

    Google Scholar 

  20. Etalle, S., Teusink, F.: A Compositional Semantics for Normal Open Programs. In: Maher, M. (ed.) JICSLP 96 Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 468–482 (1996)

    Google Scholar 

  21. Fitting, M.: A Kriple-Kleene semantics for general logic programs. Journal of Logic Programming 4, 295–312 (1985)

    Article  MathSciNet  Google Scholar 

  22. Gabbrielli, M., Levi, G., Meo, M.C.: Observable behaviors and equivalences of logic programs. In: Information and Computation, pp. 1–29 (1995)

    Google Scholar 

  23. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pp. 1070–1080. The MIT Press, Cambridge (1988)

    Google Scholar 

  24. Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Warren, D.H.D., Szeredi, P. (eds.) Proceedings of the Seventh International Conference and Symposium on Logic Programming, pp. 579–597. The MIT Press, Cambridge (1990)

    Google Scholar 

  25. Gottlob, G., Leitsch, A.: On the efficiency of subsumption algorithms. Journal of the ACM 32(2), 280–295 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  26. Kakas, A.C., Mancarella, P.: Generalized stable models: a semantics for abduction. In: Proceedings of 9th European Conference on Artificial Intelligence ECAI 1990, pp. 385–391. Pitman Publishing (1990)

    Google Scholar 

  27. Lassez, J.L., Maher, M.J.: Closures and fairness in the semantics of logic programming. Theoretical Computer Science 29, 167–184 (1984)

    Article  MathSciNet  Google Scholar 

  28. Lifschitz, V., Turner, H.: Splitting a logic program. In: Van Entenryck, P. (ed.) Proc. 11th International Conference on Logic Programming, pp. 23–37. The MIT Press, Cambridge (1994)

    Google Scholar 

  29. Lloyd, J.W.: Foundations of logic programming, 2nd edn. Springer, Heidelberg (1987)

    MATH  Google Scholar 

  30. Maher, M.J.: Equivalences of logic programs. In: Minker, J. (ed.) Deductive databases and logic programming, pp. 627–658. Morgan Kaufmann, San Francisco (1988)

    Google Scholar 

  31. Mancarella, P., Pedreschi, D.: An algebra of logic programs. In: Kowalski, R.A., Bowen, K.A. (eds.) Proceedings Fifth International Conference on Logic Programming, pp. 1006–1023. The MIT Press, Cambridge (1988)

    Google Scholar 

  32. Milner, R.: Fully abstract models for typed λ-calculi. Theoretical Computer Science 4, 1–23 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  33. O’Keefe, R.: Towards an algebra for constructing logic programs. In: Cohen, J., Conery, J. (eds.) Proceedings of IEEE Symposium on Logic Programming, pp. 152–160. IEEE Computer Society Press, Los Alamitos (1985)

    Google Scholar 

  34. Pereira, L.M., Alferes, J.J.: Well founded semantics for logic programs with explicit negation. In: Proc. ECAI 1992, pp. 102–106. John Wiley and Sons, Chichester (1992)

    Google Scholar 

  35. Pettorossi, A., Proietti, M.: Transformations of logic programs: Foundations and techniques. Journal of Logic Programming 19 & 20, 261–320 (1994)

    Article  MathSciNet  Google Scholar 

  36. Plotkin, G.D.: LCF considered as a programming language. Theoretical Computer Science 5, 223–256 (1977)

    Article  MathSciNet  Google Scholar 

  37. Przymusinski, T.: Extended stable semantics for normal and disjunctive programs. In: Warren, D.H.D., Szeredi, P. (eds.) Proceedings of the Seventh International Conference and Symposium on Logic Programming, pp. 459–477. The MIT Press, Cambridge (1990)

    Google Scholar 

  38. Przymusinski, T.: Stationary semantics for normal and disjunctive logic programs. In: Delobel, C., Masunaga, Y., Kifer, M. (eds.) DOOD 1991. LNCS, vol. 566, Springer, Heidelberg (1991)

    Google Scholar 

  39. Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 153–173. Plenum, New York (1978)

    Google Scholar 

  40. van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. Journal of the ACM 23(4), 733–742 (1976)

    Article  MATH  Google Scholar 

  41. van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  42. Verbaeten, S., Denecker, M., De Schreye, D.: Compositionality of normal open logic programs. Journal of Logic Programming 41(3), 151–183 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Pisa, Italy

    Antonio Brogi

Authors
  1. Antonio Brogi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Katholieke Universiteit Leuven, Belgium

    Maurice Bruynooghe

  2. School of Computer Science, The University of Manchester, M13 9PL, Manchester, United Kingdom

    Kung-Kiu Lau

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brogi, A. (2004). On the Semantics of Logic Program Composition. In: Bruynooghe, M., Lau, KK. (eds) Program Development in Computational Logic. Lecture Notes in Computer Science, vol 3049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25951-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25951-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22152-4

  • Online ISBN: 978-3-540-25951-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation