Skip to main content
SpringerLink
Log in

Using automata theory for characterizing the semantics of terminological cycles

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

In most of the implemented terminological knowledge representation systems it is not possible to state recursive concept definitions, so-called terminological cycles. One reason is that it is not clear what kind of semantics to use for such cycles. In addition, the inference algorithms used in such systems may go astray in the presence of terminological cycles. In this paper we consider terminological cycles in a very small terminological representation language. For this language, the effect of the three types of semantics introduced by B. Nebel can completely be described with the help of finite automata. These descriptions provide for a rather intuitive understanding of terminologies with recursive definitions, and they give an insight into the essential features of the respective semantics. In addition, one obtains algorithms and complexity results for the subsumption problem and for related inference tasks. The results of this paper may help to decide what kind of semantics is most appropriate for cyclic definitions, depending on the representation task.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.V. Aho and J.D. Ullman, University of data retrieval languages, in:Proceedings of the 6th ACM Symposium on Principles of Programming Languages (1979).

  2. F. Baader, Terminological cycles in KL-ONE-based knowledge representation languages, in:Proceedings of the 8th National Conference of the American Association for Artificial Intelligence, AAAI-90 (Boston, 1990).

  3. F. Baader, Terminological cycles in KL-ONE-based knowledge representation languages, DFKI Research Report RR-90-01, DFKI Kaiserslautern (1990).

  4. F. Baader, Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles, in:Proceedings of the 12th International Joint Conference on Artificial Intelligence, IJCAI-91 (Sydney, 1991).

  5. F. Baader and B. Hollunder, KRIS: Knowledge representation and inference system,SIGART Bulletin 2 (1991).

  6. R.J. Brachman and J.G. Schmolze, An overview of the KL-ONE knowledge representation system,Cognitive Science 16 (1985).

  7. R.J. Brachman, V. Pigman-Gilbert and H.J. Levesque, An essential hybrid reasoning system: Knowledge and symbol level accounts in KRYPTON, in:Proceedings of the 9th International Joint Conference on Artificial Intelligence (Los Angeles, 1985).

  8. J.R. Büchi, On a decision method in restricted second order arithmetic, in:Proceedings of the 1960 Congress on Logic, Methodology and Philosophy of Science (Stanford, 1960).

  9. M. Buchheit, F.M. Donini, W. Nutt and A. Schaerf, Refining the structure of terminological systems: Terminology = Schema + Views, in:Proceedings of the 12th National Conference of the American Association for Artificial Intelligence, AAAI-94 (Seattle, 1994).

  10. R. Dionne, E. Mays and F.J. Oles, A non-well-founded approach to terminological cycles, in:Proceedings of the 10th National Conference of the American Association for Artificial Intelligence, AAAI-92 (San Jose, 1992).

  11. R. Dionne, E. Mays and F.J. Oles, The equivalence of model-theoretic and structural subsumption in description logics, in:Proceedings of the 13th International Joint Conference on Artificial Intelligence, IJCAI-93 (Chambery, 1993).

  12. S. Eilenberg,Automata, Languages and Machines, Vol. A (Academic Press, New York/London, 1974).

    Google Scholar 

  13. J.H. Gallier,Logic for Computer Science, Foundations of Automated Theorem Proving (Harper&Row, New York, 1986).

    Google Scholar 

  14. M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).

    Google Scholar 

  15. G. Giacomo and M. Lenzerini, Concept language with number restrictions and fixpoints, and its relationship with mu-calculus, in:Proceedings of the 11th European Conference on Artificial Intelligence, ECAI-94 (Amsterdam, 1994).

  16. Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic, in:Proceedings of the 26th Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, 1985).

  17. Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic,Annals of Pure and Applied Logic 32 (1986).

  18. P.R. Halmos,Naive Set Theory (Springer-Verlag, New York, 1974).

    Google Scholar 

  19. J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, 1979).

    Google Scholar 

  20. N. Immerman, Relational queries computable in polynomial time,Information and Control 68 (1986).

  21. T.S. Kaczmarek, W. Mark and K. Sondheimer, Recent developments in NIKL, in:Proceedings of the 5th National Conference of the American Association for Artificial Intelligence, AAAI-86 (Philadelphia, 1986).

  22. J.-L. Lassez, V.L. Nguyen and E.A. Sonenberg, Fixed point theorems and semantics: A folk tale.Information Processing Letters 14 (1982).

  23. H.L. Levesque and R.J. Brachman, Expressiveness and tractability in knowledge representation and reasoning,Computational Intelligence 3 (1987).

  24. J.W. Lloyd,Logic Programming, Second, Extended Edition (Springer-Verlag, Berlin, 1987).

    Google Scholar 

  25. R. McNaughton, Testing and generating infinite sequences by a finite automation,Information and Control 9 (1966).

  26. R. MacGregor and R. Bates, The Loom knowledge representation language, Technical Report ISI/RS-87-188, University of Southern California, Information Science Institute (1987).

  27. Z. Manna,Mathematical Theory of Computation (McGraw-Hill, New York, 1974).

    Google Scholar 

  28. J. Minker and J.M. Nicolas, On recursive axioms in deductive databases,Information Systems 8 (1983).

  29. B. Nebel, On terminological cycles, KIT Report 58, Technische Universität Berlin (1987).

  30. B. Nebel,Reasoning and Revision in Hybrid Representation Systems, LNCS, Vol. 422 (Springer-Verlag, Berlin, 1990).

    Google Scholar 

  31. B. Nebel, Terminological reasoning is inherently intractable,Artificial Intelligence 43 (1990).

  32. B. Nebel, Terminological cycles: Semantics and computational properties, in:Formal Aspects of Semantic Networks, ed. J. Sowa (Morgan-Kaufmann, San Mateo, 1991).

    Google Scholar 

  33. P. Patel-Schneider, D.L. McGuinness, R.J. Brachman, L. Alperin Resnick and A. Borgida, The CLASSIC knowledge representation system: Guiding principles and implementation issues,SIGART Bulletin 2 (1991).

  34. J.P. Pecuchet, On the complementation of Büchi automata,Theoretical Computer Science 47 (1986).

  35. J.G. Rosenstein,Linear Ordering (Academic Press, New York, 1982).

    Google Scholar 

  36. K. Schild, A correspondence theory for terminological logics, in:Proceedings of the 12th International Joint Conference on Artificial Intelligence, IJCAI-91 (Sydney, 1991).

  37. K. Schild, Terminological cycles and the propositional μ-calculus, in:Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, KR-94 (Bonn, 1994).

  38. D.A. Schmidt,Denotational Semantics: A Methodology for Language Development (Allyn and Bacon, Boston, 1986).

    Google Scholar 

  39. A.P. Sistla, M.Y. Vardi and P. Wolper, The complementation problem for Büchi automata with applications to temporal logic,Theoretical Computer Science 49 (1987).

  40. W. Thomas, Automata on infinite objects, in: J. Leeuwen (ed.),Handbook of Theoretical Computer Science, Vol. B (Elsevier Science Publishers, Amsterdam, 1990).

    Google Scholar 

  41. M. Vardi, Complexity of relational query languages, in:Proceedings of the 4th ACM Symposium on the Theory of Computing (1982).

  42. L. Vielle, Recursive query processing: The power of logic,Theoretical Computer Science 69 (1989).

  43. C.S. Wu and L.J. Henschen, Answering linear recursive queries in cyclic databases, in:Proceedings of the International Conference on Fifth Generation Computer Systems (Tokyo, 1988).

Download references

Author information

Authors and Affiliations

  1. Lehr- und Forschungsgebiet Theoretische Informatik, RWTH Aachen, Ahornstraße 55, 52074, Aachen, Germany

    Franz Baader

Authors
  1. Franz Baader
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baader, F. Using automata theory for characterizing the semantics of terminological cycles. Ann Math Artif Intell 18, 175–219 (1996). https://doi.org/10.1007/BF02127747

Download citation

  • Issue Date:

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

Keywords

Search

Navigation