Skip to main content

On the semantics of inheritance in logic programming: Compositionality and full abstraction

  • Conference paper
  • First Online:
  • 141 Accesses

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

Abstract

We give an account of various semantics for hierarchical logic programs and discuss their properties in terms of compositionality and full abstraction when inheritance is assumed as the underlying composition mechanism. The analysis is carried out along the guidelines of [7] and leads us to conclude that a logical semantics is inherently inadequate to fully capture the computational aspects of program composition. by inheritance.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bossi, M. Gabbrielli, G. Levi, and M. Meo. Contributions to the Semantics of Open Logic Programs. In Proceeding of FGCS'92, 1992.

    Google Scholar 

  2. A. Brogi, E. Lamma, and P. Mello. Structuring Logic Programs: A Unifying Framework and its Declarative and Operational Semantics. Technical Report 4/1, Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, 1990.

    Google Scholar 

  3. A. Brogi, E. Lamma, and P. Mello. Objects in a Logic Programming Framework. In Proc. 2nd Russian Conf. on Logic Programming, Leningrad, 1991.

    Google Scholar 

  4. A. Brogi, E. Lamma, and P. Mello. Compositional Model-theoretic Semantics for Logic Programs. New Generation Computing, 11(2), 1992.

    Google Scholar 

  5. M. Bugliesi. Inheritance Systems in Logic Programming: Semantics and Implementation. Ms Thesis, Dept. of Computer Science, Purdue University, West-Lafayette IN, USA.

    Google Scholar 

  6. M. Bugliesi. A Declarative View of Inheritance in Logic Programming. In Proceedings JICSLP'92, Washington D.C., 1992. MIT press.

    Google Scholar 

  7. H. Gaifman and E. Shapiro. Fully Abstract Compositional Semantics for Logic Programs. In Proceedings of POPL'89, pages 134–142. ACM, 1989.

    Google Scholar 

  8. J. L. Lassez and M. Maher. Closures and Fairness in the Semantics of Logic Programming. Theoretical Computer Sciences, 29:167–184, 1984.

    Google Scholar 

  9. M. Maher. Equivalences of Logic Programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. M. Kaufmann, 1988.

    Google Scholar 

  10. P. Mancarella and D. Pedreschi. An Algebra of Logic Programs. In Proc. 5th Int. Conf. on. Logic Programming, Seattle, 1988. ALP.

    Google Scholar 

  11. M. Martelli, M. Falaschi, G. Levi, and C. Palamedessi. A new Declarative Semantics for Logic Languages. In Proceedings JICSLP'88, Seattle, 1988. MIT press.

    Google Scholar 

  12. A. Meyer. Semantical paradigms: Notes for and Invited Lectures. In Proceedings of 3rd Annual Sym. on Logic in Computer Science. IEEE, 1988.

    Google Scholar 

  13. D. Miller. A Logical Analysis of Modules in Logic Programming. Journal of Logic Programming, 6(2):79–108, 1989.

    Google Scholar 

  14. L. Monteiro and A. Porto. Syntactic and Semantic Inheritance in Logic Programming. PHOENIX Workshop and Seminar on Declarative Programming (to appear).

    Google Scholar 

  15. L. Monteiro and A. Porto. Contextual Logic Programming. In Proc. 6th Int. Conf. on. Logic Programming, Lisbon, 1989. ALP.

    Google Scholar 

  16. R. A. O'Keef. Towards an Algebra for Constructing Logic Programs. In Proc. Symposium on Logic Programming. IEEE, 1985.

    Google Scholar 

  17. U. Reddy. Objects as Closures: Abstarct Semantics of Object Oriented Languages. In Proc. Lisp and Functional Programming, pages 289–297. ACM, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

E. Lamma P. Mello

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bugliesi, M. (1993). On the semantics of inheritance in logic programming: Compositionality and full abstraction. In: Lamma, E., Mello, P. (eds) Extensions of Logic Programming. ELP 1992. Lecture Notes in Computer Science, vol 660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56454-3_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-56454-3_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56454-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics