Skip to main content
SpringerLink
Log in
Book cover

LOGIDATA+: Deductive Databases with Complex Objects pp 105–128Cite as

Taxonomic reasoning with cycles in LOGIDATA+

  • Part III: Complex Objects
  • Chapter
  • First Online:

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

Abstract

This paper shows the subsumption computation techniques for a LOGIDATA+ schema allowing cyclic definitions for classes. The formal framework LOGIDATACYC*, which extends LOGIDATA* to perform taxonomic reasoning in the presence of cyclic class definitions is introduced. It includes the notions of possible instances of a schema; legal instance of a schema, defined as the greatest fixed-point of possible instances; subsumption relation. On the basis of this framework, the definitions of coherent type and consistent class are introduced and the necessary algorithms to detect incoherence and compute subsumption in a LOGIDATA+ schema are given. Some examples of subsumption computation show its feasibility for schema design and validation.

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. Baader, F. Terminological cycles in KL-ONE-based KR-languages. In Proceedings of the 8th National Conference of the American Association for Artificial Intelligence, Boston, Mass., 1990.

    Google Scholar 

  2. Beneventano, D. Computation of Subsumption with Cycles in LOGIDATA+. Technical Report 80, CIOC-CNR, Bologna, October 1991.

    Google Scholar 

  3. Beneventano, D., and Bergamaschi, S. Subsumption for Complex Object Data Models. Proceedings of the International Conference on Database Theory, Berlin-1992, Springer Verlag Publisher.

    Google Scholar 

  4. Bergamaschi, S., and Nebel, B. Theoretical fondations of complex object data models Technical Report 5/91, CNR, Progetto Finalizzato Sistemi Informatica e Calcolo Parallelo, Sottoprogetto 5, January 1992.

    Google Scholar 

  5. Kuper, G.M., and Vardi, M.Y. A new approach to database logic. In PODS '84, pages 86–96. SIGACT-SIGMOD-SIGART, ACM Press, 1984.

    Google Scholar 

  6. Lecluse, C., and Richard, P. The O2 data model. In Int. Conf. On Very Large Data Bases, 1989.

    Google Scholar 

  7. Lloyd, J.W. Foundations of Logic Programming. Springer Verlag, Berlin, 1987.

    Google Scholar 

  8. B. Nebel. Terminological cycles: semantics and computational properties. In J. Sowa, editor, Principles of Semantic Networks. Morgan Kaufmann, 1991.

    Google Scholar 

  9. D.A. Schmidt. Denotational Semantics: A Methodology for Languages Development. Allyn and Bacon, Boston, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Informatica e Sistemistica, CIOC-CNR, Viale Risorgimento 2, 40136, Bologna, Italy

    Domenico Beneventano, Sonia Bergamaschi & Claudio Sartori

Authors
  1. Domenico Beneventano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sonia Bergamaschi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Claudio Sartori
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paolo Atzeni

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Beneventano, D., Bergamaschi, S., Sartori, C. (1993). Taxonomic reasoning with cycles in LOGIDATA+ . In: Atzeni, P. (eds) LOGIDATA+: Deductive Databases with Complex Objects. Lecture Notes in Computer Science, vol 701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021893

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56974-9

  • Online ISBN: 978-3-540-47844-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation