Advertisement

A survey of temporal extensions of description logics

  • Alessandro Artale
  • Enrico Franconi
Article

Abstract

This paper surveys the temporal extensions of description logics appearearing in the literature. The analysis considers a large spectrum of approaches appearearing in the temporal description logics area: from the loosely coupled approaches – which comprise, for example, the enhancement of simple description logics with a constraint based mechanism – to the most principled ones – which consider a combined semantics for the abstract and the temporal domains. It will be shown how these latter approaches have a strict connection with temporal logics.

Advantages of using temporal description logics are their high expressivity combined with desirable computational properties – such as decidability, soundness and completeness of deduction procedures. In this survey the computational properties of various families of temporal description logics will be pointed out.

description logics temporal logics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.F. Allen, Temporal reasoning and planning, in: Reasoning about Plans, eds. J.F. Allen, H.A. Kautz, R.N. Pelavin and J.D. Tenenberg (Morgan Kaufmann, 1991) chapter 1, pp. 2-68.Google Scholar
  2. [2]
    A. Artale and E. Franconi, A computational account for a description logic of time and action, in: Proc. of the 4th International Conference on Principles of Knowledge Representation and Reasoning, eds. J. Doyle, E. Sandewall and P. Torasso, Bonn, Germany, May 1994 (Morgan Kaufmann, 1994) pp. 3-14.Google Scholar
  3. [3]
    A. Artale and E. Franconi, A temporal description logic for reasoning about actions and plans, Journal of Artificial Intelligence Research 9 (1998).Google Scholar
  4. [4]
    A. Artale and C. Lutz, A correspondence between temporal description logics, in: Workshop Notes of the Int. Workshop on Description Logics, DL-99, Linköping, Sweden (July 1999) pp. 145-149.Google Scholar
  5. [5]
    F. Baader and P. Hanschke, A scheme for integrating concrete domains into concept languages, in: Proc. of the 12th IJCAI, Sidney, Australia (1991) pp. 446-451.Google Scholar
  6. [6]
    F. Baader and A. Laux, Terminological logics with modal operator, in: Proc. of the 13th IJCAI, Montreal, Canada (1995) pp. 808-814.Google Scholar
  7. [7]
    F. Baader and H.J. Ohlbach, A multidimensional terminological knowledge representation language, Journal of Applied Non-Classical Logic 5 (1995) 153-197.zbMATHMathSciNetGoogle Scholar
  8. [8]
    F. Baader, H.J. Bürckert, J. Heinsohn, B. Hollunder, J. Müller, B. Nebel, W. Nutt and H.J. Profitlich, Terminological knowledge representation: a proposal for a terminological logic, Technical Memo TM-90-04, DFKI, Saarbrücken, Germany (December 1990).Google Scholar
  9. [9]
    C. Bettini, Temporal extensions of terminological languages, Ph.D. thesis, Computer Science Department, University of Milan, Italy (1993).Google Scholar
  10. [10]
    C. Bettini, Time dependent concepts: Representation and reasoning using temporal description logics, Data & Knowledge Engineering 22(1) (1997) 1-38.zbMATHMathSciNetCrossRefGoogle Scholar
  11. [11]
    P. Blackburn, Nominal tense logic, Notre Dame Journal of Formal Logic 34 (1993) 56-83.zbMATHMathSciNetCrossRefGoogle Scholar
  12. [12]
    R.J. Brachman, D.L. McGuiness, P.F. Patel-Schneider, L. Alperin Resnick and A. Borgida, Living with CLASSIC: When and how to use a KL-ONE-like language, in: Principles of Semantic Networks, ed. J. Sowa (Morgan Kaufmann, 1991).Google Scholar
  13. [13]
    J.P. Burgess, Basic tense logic, in: Handbook of Philosophical Logic, Vol. 2, eds. D. Gabbay and F. Guenther (Reidel, Dordrecht, Holland, 1984) pp. 89-133.Google Scholar
  14. [14]
    D. Calvanese, G. De Giacomo, M. Lenzerini and D. Nardi, Reasoning in expressive description logics, in: Handbook of Automated Reasoning, eds. A. Robinson and A. Voronkov (Elsevier Science North-Holland, Amsterdam, 1999).Google Scholar
  15. [15]
    G. De Giacomo and M. Lenzerini, Tbox and abox reasoning in expressive description logics, in: Proc. of the 5th International Conference on Principles of Knowledge Representation and Reasoning, Boston, MA, 1996 (Morgan Kaufmann, 1996) pp. 316-327.Google Scholar
  16. [16]
    G. De Giacomo, Decidability of class-based representation formalisms, Ph.D. thesis, University "La Sapienza", Roma (1995).Google Scholar
  17. [17]
    P.T. Devanbu and D.J. Litman, Plan-based terminological reasoning, in: Proc. of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA, May 1991 (Morgan Kaufmann, 1991) pp. 128-138.Google Scholar
  18. [18]
    P.T. Devanbu and D.J. Litman, Taxonomic plan reasoning, Artificial Intelligence 84 (1996) 1-35.CrossRefGoogle Scholar
  19. [19]
    P.T. Devanbu, R.J. Brachman, P. Selfridge and B. Ballard, Taxonomic plan reasoning, Communication of the ACM 34(5) (1991).Google Scholar
  20. [20]
    F.M. Donini, M. Lenzerini, D. Nardi and W. Nutt, The complexity of concept languages, Technical Report RR-95-07, DFKI, Germany (June 1995); A preliminary version appears in Proc. of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91).Google Scholar
  21. [21]
    F.M. Donini, M. Lenzerini, D. Nardi and A. Schaerf, Reasoning in description logic, in: Principles of Knowledge Representation and Reasoning, ed. G. Brewka, Studies in Logic, Language and Information (CSLI Publications, 1996) pp. 193-238.Google Scholar
  22. [22]
    E.A. Emerson and J.Y. Halpern, Decision procedures and expressiveness in the temporal logic of branching time, Journal of Computer and System Science 30 (1985) 1-24.zbMATHMathSciNetCrossRefGoogle Scholar
  23. [23]
    M. Finger and D. Gabbay, Adding a temporal dimension to a logic system, Journal of Logic, Language and Information 2 (1992) 203-233.MathSciNetCrossRefGoogle Scholar
  24. [24]
    D. Gabbay, I. Hodkinson and M. Reynolds, Temporal Logic (Oxford University Press, 1994).Google Scholar
  25. [25]
    R. Goldblatt, Logics of Time and Computation (CSLI Publications, 1983).Google Scholar
  26. [26]
    V. Haarslev, C. Lutz and R. Möller, Foundation of spatiotemporal reasoning with description logics, in: Proc. of the 6th International Conference on Principles of Knowledge Representation and Reasoning, eds. A. Cohn, L. Schubert and S.C. Shapiro, Trento, Italy, June 1998 (Morgan Kaufmann, 1998) pp. 112-123.Google Scholar
  27. [27]
    J.Y. Halpern and Y. Moses, A guide to the modal logic of knowledge and belief: Preliminary draft, in: Proc. of the 9th IJCAI, Los Angeles, CA (1985) pp. 480-490.Google Scholar
  28. [28]
    J. Y. Halpern and Y. Shoham, A propositional modal logic of time intervals, Journal of ACM 38(4) (1991) 935-962.zbMATHMathSciNetCrossRefGoogle Scholar
  29. [29]
    D. Harel, Dynamic Logic, in: Handbook of Philosophical Logic, Vol. 2, eds. D. Gabbay and F. Guenther (Reidel, Dordrecht, Holland, 1984) pp. 497-604.Google Scholar
  30. [30]
    J. Heinsohn, D. Kudenko, B. Nebel and H.J. Profitlich, RAT: representation of actions using terminological logics, Technical Report, DFKI, Saarbrücken, Germany (November 1992).Google Scholar
  31. [31]
    B. Hollunder and W. Nutt, Subsumption algorithms for concept languages, Technical Report RR-90-04, DFKI, Germany (April 1990).Google Scholar
  32. [32]
    H.A. Kautz, A formal theory of plan recognition and its implementation, in: Reasoning about Plans, eds. J.F. Allen, H.A. Kautz, R.N. Pelavin and J.D. Tenenberg (Morgan Kaufmann, 1991) chapter 2, pp. 69-126.Google Scholar
  33. [33]
    C. Lutz, V. Haarslev and R. Möller, A concept language with role-forming predicate restrictions, Technical Report FBI-HH-M-276/97, Computer Science Department, University of Hamburg, Germany (December 1997).Google Scholar
  34. [34]
    C. Lutz, Reasoning with concrete domains, in: Proc. of the 16th IJCAI, Stockholm, Sweden (1999) pp. 90-95.Google Scholar
  35. [35]
    E. Mays, R. Dionne and R. Weida, K-Rep system overview, SIGART Bulletin 2(3) (1991) 93-97.Google Scholar
  36. [36]
    B. Nebel, Terminological reasoning is inherently intractable, Artificial Intelligence 43 (1990) 235-249.zbMATHMathSciNetCrossRefGoogle Scholar
  37. [37]
    B. Nebel, Terminological cycles: Semantics and computational properties, in: Principles of Semantic Networks, ed. J.F. Sowa (Morgan Kaufmann, 1991) chapter 11, pp. 331-362.Google Scholar
  38. [38]
    D.A. Randell, Z. Cui and A.G. Cohn, A spatial logic based on regions and connections, in: Proc. of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA, 1992 (Morgan Kaufmann, 1992) pp. 522-527.Google Scholar
  39. [39]
    K.D. Schild, A correspondence theory for terminological logics: Preliminary report, in: Proc. of the 12th IJCAI, Sidney, Australia (1991) pp. 466-471.Google Scholar
  40. [40]
    K.D. Schild, Combining terminological logics with tense logic, in: Proceedings of the 6th Portuguese Conference on Artificial Intelligence, EPIA'93 (October 1993).Google Scholar
  41. [41]
    M. Schmidt-Schauß and G. Smolka, Attributive concept descriptions with complements, Artificial Intelligence 48(1) (1991) 1-26.zbMATHMathSciNetCrossRefGoogle Scholar
  42. [42]
    A. Schmiedel, A temporal terminological logic, in: Proc. of AAAI-90, Boston, MA (1990) pp. 640-645.Google Scholar
  43. [43]
    J. van Benthem, The Logic of Time (D. Reidel, Dordrecht, Holland, 1983).Google Scholar
  44. [44]
    Y. Venema, Expressiveness and completeness of an interval tense logic, Notre Dame Journal of Formal Logic 31(4) (1990) 529-547.zbMATHMathSciNetCrossRefGoogle Scholar
  45. [45]
    R.Weida and D. Litman, Terminological reasoning with constraint networks and an application to plan recognition, in: Proc. of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA, October 1992 (Morgan Kaufmann, 1992) pp. 282-293.Google Scholar
  46. [46]
    R. Weida and D. Litman, Subsumption and recognition of heterogeneous constraint networks, in: Proceedings of CAIA-94 (1994).Google Scholar
  47. [47]
    P.Wolper, The tableaux method for temporal logic: An overview, Logique et Analyse 110-111 (1985) 119-136.MathSciNetGoogle Scholar
  48. [48]
    F.Wolter and M. Zakharyaschev, Satisfiability problem in description logics with modal operators, in: Proc. of the 6th International Conference on Principles of Knowledge Representation and Reasoning, eds. A. Cohn, L. Schubert and S.C. Shapiro, Trento, Italy, June 1998 (Morgan Kaufmann, 1998) pp. 512-523.Google Scholar
  49. [49]
    F. Wolter and M. Zakharyaschev, Modal description logics: Modalizing roles, Fundamentae Informaticae 39 (1999) 411-438.zbMATHMathSciNetGoogle Scholar
  50. [50]
    F. Wolter and M. Zakharyaschev, Temporalizing description logics, in: Frontiers of Combining Systems, eds. D. Gabbay and M. de Rijke (Studies Press/Wiley, 1999); also in the Proceedings of Fro-CoS'98, Amsterdam, 1998.Google Scholar
  51. [51]
    W.A.Woods and J.G. Schmolze, The KL-ONE family, Computer and Mathematics with Applications, Special Issue: Semantic Networks in Artificial Intelligence 23(2-5) (1992) 133-177.zbMATHGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Alessandro Artale
    • 1
  • Enrico Franconi
    • 2
  1. 1.Department of ComputationUMISTManchesterUK E-mail
  2. 2.Department of Computer ScienceUniversity of ManchesterUK E-mail

Personalised recommendations