Luigi Palopoli
580 California St., Suite 400
San Francisco, CA, 94104
Datalog and description logics: Expressive power
1998
https://doi.org/10.1007/3-540-64823-2_16
Sign up for access to the world's latest research
Abstract
This paper investigates the possibility of exploiting formal analysis tools developed in the database field for the purpose of studying the expressive power of description logics augmented with rule-based query languages. We report a preliminary analysis on the expressive power of such hybrid languages. Two specific languages coupling a terminological component with Horn rules are considered. It is shown that: (1) the former language defines all database collections expressed by skolemized universally quantified second order formulae where quantified predicates are monadic, and (2) the latter language defines all database collections expressed by skolemized universally quantified second order formulae where quantified predicates are dyadic or monadic.
References (11)
- Abiteboul and Vianu, 1992] S. Abiteboul and V. Vianu. Expressive power of query languages. In J. D. Ullman, editor, Theoretical Studies in Computer Science. Academic Press, 1992.
- Baader, 1996] Franz Baader. A formal definition for the expressive power of terminological knowldege rep- resentation languages, aT. of Logic and Computation, 6:33-54, 1996.
- Borgida, 1996] Alexander Borgida. On the relative ex- pressiveness of description logics and predicate logics. AIJ, 82:353-367, 1996.
- Buchheit et at., 1993] Martin Buchheit, Francesco M. Donini, and Andrea Schaerf. Decidable reasoning in terminological knowledge representation systems, aT. of Artificial Intelligence Research, 1:109-138, 1993. [Cosmadakis, 1993] S. S. Cosmadakis. Logical reducibil- ity and monadic NP. In Proc. of FOCS-93. 1993. [Donini et al., 1991] Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Andrea Schaerf. A hybrid system integrating datalog and concept lan- guages. In Proc. of AI*IA-91, number 549 in LNAI. Springer-Verlag, 1991. An extended version appeared also in the Working Notes of the AAAI Fall Sympo- sium "Principles of Hybrid Reasoning".
- Eiter et al., 1994] T. Eiter, G. Gottlob, and H. Man- nila. Adding Disjunction to Datalog. In Proc. of PODS-9J, pages 267-278, 1994.
- Fagin, 1974] R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In R. M.
- Karp, editor, Complexity of Computation, pages 43- 74. AMS, 1974.
- Fagin, 1975] Ronald Fagin. Monadic generalized spec- tra. Zeitschr. f. mathem. Logik und Grundlagen d. Math., 21:89-96, 1975.
- Fagin, 1990] R. Fagin. Finite-model theory-a personal perspective. In Proc. of ICDT-90, volume 470 of LNCS, pages 3-23. Springer-Verlag, 1990. [Kanellakis, 1990] P. Kanellakis. Elements of relational database theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chap- ter 17. Elsevier, 1990. [Levy and Rousset, 1996a] Alon Y. Levy and Marie- Christine Rousset. CARIN: A representation language combining Horn rules and description logics. In Proc. of ECAI-96, pages 323-327, 1996. [Levy and Rousset, 1996b] Alon Y. Levy and Marie- Christine Rousset. The limits on combining recursive Horn rules with description logics. In Proc. of AAAI- 96, pages 577-584, 1996.
- Reiter, 1984] Raymond Reiter. Towards a logical re- construction of relational database theory. In M. L. Brodie, J. Mylopoulos, and J. W. Schmidt, editors, On Conceptual Modelling. Springer-Verlag, 1984. [Schlipf, 1990] J. S. Sehlipf. The expressive powers of the logic programming sematics. In Proc. of PODS- 90, pages 196-204, 1990. Expanded version available as University of Cincinnati Computer Science Depart- ment Tech. Rep. CIS-TR-90-3.
- Stewart, 1991] I. Stewart. Comparing the Expressibil- ity of Languages Formed Using NP-Complete Opera- tors. J. of Logic and Computation, 1(3):305-330, 1991.