Expressiveness of concept expressions in first-order description logics

Artificial Intelligence

Volumn 107, Issue 2, 1999, Pages 303-333

  Kurtonina, Natasha ^a   De Rijke, Maarten ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS;

FIRST-ORDER DESCRIPTION LOGICS;

KNOWLEDGE REPRESENTATION;

EID: 0033077039     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(98)00109-X     Document Type: Article

References (27)

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. F. Baader, A formal definition for the expressive power of terminological knowledge representation languages, J. Logic Comput. 7 (1997) 33-54.
3. P. Buneman, S. Davidson, G. Hillebrand, D. Suciu, A query language and optimization techniques for unstructured data, in: Proc. 1996 ACM SIGMOD International Conference on Management of Data, 1996.
4. J. Van Benthem, Modal Logic and Classical Logic, Bibliopolis, Napoli, 1985.
5. J. Barwise, S. Feferman (EdS.), Model-Theoretic Logics, Springer, Berlin, 1985.
6. A. Borgida, On the relative expressiveness of description logics and predicate logics, Artificial Intelligence 82 (1996) 353-367.
7. M. Cadoli, L. Palopoli, M. Lenzerini, Datalog and description logics: Expressive power, in: Proc. International Workshop on Database Programming Languages 1997, Lecture Notes in Computer Science, Vol. 1369, Springer, Berlin, 1998.
8. G. De Giacomo, M. Lenzerini, A uniform framework for concept definitions in description logics, J. Artificial Intelligence Research 6 (1997) 87-110.
9. F.M. Donini, M. Lenzerini, D. Nardi, W. Nutt, The complexity of concept languages, Inform, and Comput. 134 (1997) 1-58.
10. F.M. Donini, M. Lenzerini, D. Nardi, A. Schaerf, Reasoning in description logics, in: G. Brewka (Ed.), Principles of Knowledge Representation, Studies in Logic, Language and Information, CSLI Publications, Stanford, CA, 1996, pp. 191-236.
11. K. Doets, Basic Model Theory, CSLI Publications, Stanford, CA, 1996.
12. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, AMS, Providence, RI, 1974, pp. 43-74.
13. D.M. Gabbay, Expressive functional completeness in tense logic, in: U. Mönnich (Ed.), Aspects of Philosophical Logic, Reidel, Dordrecht, 1981, pp. 91-117.
14. E. Hemaspaandra, 1998 (personal communication).
15. W. Hodges, Model Theory, Cambridge University Press, Cambridge, UK, 1993.
16. M. Hollenberg, Bisimulations for Intersection, Manuscript, University of Utrecht, 1996.
17. N. Immerman, D. Kozen, Definability with bounded number of bound variables, in: Proc. LICS-87, Washington, 1987, Computer Society Press.
18. N. Immerman, Relational queries computable in polynomial time, Inform, and Control 68 (1986) 86-104.
19. D. Janin, I. Walukiewicz, On the expressive completeness of the propositional μ-calculus w.r.t. monadic second-order logic, in: Proc. CONCUR-96, 1996.
20. N. Kurtonina, M. De Rijke, Bisimulations for temporal logic. J. Logic, Language and Information 6 (1997) 403-425.
21. N. Kurtonina, M. De Rijke, Simulating without negation, J Logic Comput. 7 (1997) 503-524.
22. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
23. S. Popkorn, First Steps in Modal Logic, Cambridge University Press, Cambridge, UK, 1994.
24. M. De Rijke, A note on graded modal logic, Studia Logica (to appear).
25. K. Schild, A correspondence theory for terminological logics, in: Proc. IJCAI-91, Sydney, Australia, 1991, pp. 466-471.
26. D. Toman, D. Niwiński, First-Order Queries over Temporal Databases Inexpressible in Temporal Logic, Manuscript, 1997.
27. S. Vickers, Topology Via Logic, Cambridge University Press, Cambridge, UK, 1989.