Skip to main content
SpringerLink
Log in

Combining terminological logics with tense logic

  • Conference paper
  • First Online:
Progress in Artificial Intelligence (EPIA 1993)

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

Included in the following conference series:

Abstract

We show how to add full first-order temporal expressiveness to terminological logics. This can be achieved by embedding point-based tense operators in propositionally closed concept languages like ALC. The resulting temporal terminological logics are fully expressive over linear, Dedekind complete time such as ℕ and ℝ in the sense that all first-order temporal formulae over these time structures are expressible. We then prove that augmenting ALC by future-oriented tense operators interpreted over linear, discrete, unbounded time like IN does not increase its computational complexity. To establish this complexity result we show that coherence in ALC augmented by functional roles and their transitive closure is computable in polynomial space. We finally show how to obtain directly an axiomatization and a tableau-based algorithm for the tenselogical extension of terminological logics.

The author is currently under grant of the Deutsche Forschungsgemeinschaft (DFG).

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. James F. Allen. Maintaining knowledge about temporal intervals. Communica-tions of the ACM, 26(11):832–843, 1983.

    Google Scholar 

  2. Ronald J. Brachman and James G. Schmolze. An overview of the KL-ONE knowl-edge representation system. Cognitive Science, 9(2):171–216, 1985.

    Google Scholar 

  3. John P. Burgess. Axioms for tense logic: I. “since” and “until”. Notre Dame Journal of Formal Logic, 23(4):367–374, 1982.

    Google Scholar 

  4. E. Allen Emerson and Joseph Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Science, 30:1–24, 1985.

    Google Scholar 

  5. Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Science, 18:194–211, 1979.

    Google Scholar 

  6. Dov Gabbay, Amir Pnueli, Saharon Shela, and Jonathan Stavi. On the temporal analysis of fairness. In Proceedings of the 7th Symposium on Principles of Programming Languages, Las Vegas, Nevada, 1980.

    Google Scholar 

  7. Robert Goldblatt. Logics of Time and Computation, volume 7 of CSLI Lecture Notes. Chicago University Press, Chicago, Ill., 1987.

    Google Scholar 

  8. Joseph Y. Halpern, Zohar Manna, and Ben Moszkowski. A hardware semantics based on temporal intervals. In Proceedings of 10th International Colloquium on Automata, Languages and Programming, pages 278–291, Barcelona, Spain, 1983.

    Google Scholar 

  9. Joseph Y. Halpern and John Reif. The prepositional dynamic logic of determinis-tic, well-structured programs. Theoretical Computer Science, 27:127–165, 1983.

    Google Scholar 

  10. Joseph Y. Halpern and Yoav Shoham. A propositional modal logic of time intervals. In D. Gabbay and F. Guenther, editors, Proceedings of the Symposium on Logic in Computer Science, IEEE, Boston, 1986.

    Google Scholar 

  11. Hans Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968.

    Google Scholar 

  12. Bernhard Nebel. Terminological Reasoning is Inherently Intractable. Artificial Intelligence, 43:235–249, 1990.

    Google Scholar 

  13. Rohit Parikh. Propositional dynamic logics of programs: A survey. In Proceedings of the Workshop on Logic of Programs, pages 102-144, Zürich, Switzerland, 1979.

    Google Scholar 

  14. Klaus Schild. A correspondence theory for terminological logics: Preliminary report. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 466–471, Sydney, Australia, 1991.

    Google Scholar 

  15. Klaus Schild. A tense-logical extension of terminological logics. KIT Report 92, Department of Computer Science, Technische Universität Berlin, Berlin, FRG, 1991.

    Google Scholar 

  16. Manfred Schmidt-Schauß and Gert Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(1): 1–26, 1991.

    Google Scholar 

  17. Albrecht Schmiedel. A Temporal Terminological Logic. In Proceedings of the 9th National Conference of the American Association for Artificial Intelligence, pages 640–645, Boston, Mass., 1990.

    Google Scholar 

  18. Johan van Benthem. The Logic of Time. Reidel, Dordrecht, Holland, 1984.

    Google Scholar 

  19. Moshe Y. Vardi and Pierre Wolper. Automata theoretic techniques for modal logics of programs (extended abstract). In Proceedings of the 16th ACM Annual Symposium on Theory of Computing, pages 446–456, Washington, D.C., 1984.

    Google Scholar 

  20. Pierre Wolper. Temporal logic can be more expressive. Information & Control, 56:72–99, 1983.

    Google Scholar 

  21. Pierre Wolper. The tableau method for temporal logic: An overview. Logique et Analyse, 110–111:119–136, 1985.

    Google Scholar 

  22. William A. Woods and James G. Schmolze. The KL-ONE family. In F.W. Lehmann, editor, Semantic Networks in Artificial Intelligence, pages 133–178. Pergamon Press, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, 66123, Saarbrücken, FRG

    Klaus Schild

Authors
  1. Klaus Schild
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Miguel Filgueiras Luís Damas

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schild, K. (1993). Combining terminological logics with tense logic. In: Filgueiras, M., Damas, L. (eds) Progress in Artificial Intelligence. EPIA 1993. Lecture Notes in Computer Science, vol 727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57287-2_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-57287-2_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48036-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation