Skip to main content
SpringerLink
Log in

Open logic theories

  • Conference paper
  • First Online:
Extensions of Logic Programming (ELP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 596))

Included in the following conference series:

  • 117 Accesses

Abstract

The handling of evolving knowledge as well as of incomplete knowledge is one of the main issues in knowledge representation systems. On the one hand, evolving knowledge in logic programming can be modeled by providing suitable operators for the dynamic composition of separate theories. On the other hand, when dealing with dynamic composition of separate theories, the Open World Assumption adequately models the aspects of incompleteness of knowledge. A notion of open theory is introduced along with suitable operators for composing and closing theories. It is shown how these operators can be exploited to reconstruct several policies for structuring logic programs. Open theories, as well as the operators for their composition, are provided with a compositional declarative semantics defined in terms of Herbrand models, while a proof theory is given in terms of inference rules. Soundness and completeness results are stated.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.A. Bowen. Meta-level programming and knowledge representation. New Generation Computing. Vol. 3, No. 4, pp. 359–383, 1985.

    Google Scholar 

  2. A. Brogi, E. Lamma, P. Mancarella, and P. Mello. Abductive reasoning in a multitheory framework. In Proceedings Second Congress of The Italian Association for Artificial Intelligence, Palermo (I), October 1991. Lecture Notes in Artificial Intelligence, Vol. 475, Springer-Verlag.

    Google Scholar 

  3. A. Brogi, E. Lamma, and P. Mello. A general framework for structuring logic programs. Technical Report 4/1, CNR — Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, Sottoprogetto 4, 1990.

    Google Scholar 

  4. A. Brogi, E. Lamma, and P. Mello. Inheritance and Hypothetical Reasoning in Logic Programming. In Proceedings of 9th European Conference on Artificial Intelligence, pages 105–110. Pitman, 1990.

    Google Scholar 

  5. A. Brogi, E. Lamma, and P. Mello. Composing Open Logic Theories. Technical Report 4/28, CNR — Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, Sottoprogetto 4, 1991.

    Google Scholar 

  6. 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, Brussels, November 1990.

    Google Scholar 

  7. P. Coscia, P. Franceschi, G. Levi, G. Sardu, and L. Torre. Metalevel definition and compilation of inference engines in the epsilon logic programming environment. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth International Conference on Logic Programming, pages 359–373. The MIT Press, 1988.

    Google Scholar 

  8. K. Eshgi and R.A. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proc. Sixth International Conference on Logic Programming, page 234. The MIT Press, 1989.

    Google Scholar 

  9. D.M. Gabbay and N. Reyle. N-prolog: an extension of prolog with hypothetical implications. Journal of Logic Programming, 4:319–355, 1984.

    Article  Google Scholar 

  10. H. Gaifman and E. Shapiro. Fully abstract compositional semantics for logic programs. In Proc. sixteenth POPL, pages 134–142, 1989.

    Google Scholar 

  11. L. Giordano, A. Martelli, and G.F. Rossi. Local definitions with static scope rules in logic languages. In Proceedings of International Conference FGCS, 1988.

    Google Scholar 

  12. J. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. In Proceedings of Second Workshop on Extensions of Logic Programming. Kista, January 1991.

    Google Scholar 

  13. E. Lamma, P. Mello, and A. Natali. The design of an abstract machine for efficient implementation of contexts in logic programming. In G. Levi and M. Martelli, editors, Proc. Sixth International Conference on Logic Programming, pages 303–317. The MIT Press, 1989.

    Google Scholar 

  14. P. Mancarella and D. Pedreschi. An algebra of logic programs. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth International Conference on Logic Programming, pages 1006–1023. The MIT Press, 1988.

    Google Scholar 

  15. L.T. McCarthy. Clausal intuitionistic logic 1: fixed point semantics. Journal of Logic Programming, 5:1–31, 1988.

    Article  Google Scholar 

  16. P. Mello and A. Natali. Programs as collections of communicating prolog units. In B. Robinet and R. Wichelm, editors, Proceedings of ESOP 86, number 243 in LNCS, pages 274–288. Springer-Verlag, 1986.

    Google Scholar 

  17. P. Mello, A. Natali, and C. Ruggieri. Logic programming in a software engineering perspective. In L. Lusk and R.A. Overbeek, editors, Proc. NACLP, pages 451–458. The MIT Press, 1989.

    Google Scholar 

  18. D. Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, 6:79–108, 1989.

    Article  Google Scholar 

  19. L. Monteiro and A. Porto. Contextual logic programming. In G. Levi and M. Martelli, editors, Proc. Sixth International Conference on Logic Programming, pages 284–302. The MIT Press, 1989.

    Google Scholar 

  20. R.C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25:75–94, 1985.

    Article  Google Scholar 

  21. R. O'Keefe. Towards an algebra for constructing logic programs. In Proceedings of IEEE Symposium on Logic Programming, pages 152–160, 1985.

    Google Scholar 

  22. R. Reiter. On closed world data bases. In H. Gallaire and J.Minker, editors, Logic and Data Bases. Plenum, 1978.

    Google Scholar 

  23. D.T. Sannella and L.A. Wallen. A calculus for the construction of modular prolog programs. In Proceedings of IEEE Symposium on Logic Programming, pages 368–378. IEEE Computer Society Press, 1987.

    Google Scholar 

  24. 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.

    Article  Google Scholar 

  25. D.S. Warren. Database updates in prolog. In Proceedings of International Conference FGCS, pages 244–253, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Antonio Brogi

  2. DEIS, Università di Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Evelina Lamma & Paola Mello

Authors
  1. Antonio Brogi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evelina Lamma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paola Mello
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

L. -H. Eriksson L. Hallnäs P. Schroeder-Heister

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brogi, A., Lamma, E., Mello, P. (1992). Open logic theories. In: Eriksson, L.H., Hallnäs, L., Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1991. Lecture Notes in Computer Science, vol 596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013604

Download citation

  • DOI: https://doi.org/10.1007/BFb0013604

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55498-1

  • Online ISBN: 978-3-540-47114-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation