Abstract
Hybrid knowledge representations that combine description logics with logic programs are considered. Previous works combine description logics with Horn logic programs. In this paper, the expressive power of such hybrid systems is extended by allowing the combination of function-free, non-recursive stratified logic programs with description logics. Two model-theoretic definitions for the semantics of the hybrid knowledge representation are presented. It is shown that the inference problem based on the second semantics is decidable. When the logic program is Horn, the two semantics defined in this paper coincide with the semantics in [4] with regard to the inference problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, H. Blair, A. Walker, Towards a Theory of Declarative Knowledge, In: Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 1988, pp. 89–148.
A. Borgida, On the Relative Expressiveness of Description Logics and Predicate Logics, Artificial Intelligence, 82(1996), pp. 353–367.
M. Buchheit, F.M. Donini, A. Schaerf, Decidable Reasoning in Terminological Knowledge Representation Systems, Journal of Artificial Intelligence Research, 1 (1993), pp. 109–138.
A. Y. Levy, M.-C. Rousset, Combining Horn Rules and Description Logics in CARIN, Artificial Intelligence, 104(1998), pp. 165–209.
A. Y. Levy, M.-C. Rousset, CARIN: A Representation Language Integrating Rules and Description Logics, Proc. of European Conf. on Artificial Intelligence, Budapest, Hungary, 1996.
J. Lu, A. Nerode, V.S. Subramanian, Hybrid Knowledge Bases, IEEE Transactions on Knowledge and Data Engineering, 85, 1996, pp. 773–785.
T. Przymusinski, On the Declarative Semantics of Deductive Databases and Logic Programs, In: Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 1988, pp. 193–216.
A. Van Gelder, Negation as Failure Using Tight Derivations for General Logic Programs, In: Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann Publishers, Los Altos, CA, 1988, pp. 149–176.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J. (2000). Combining Description Logics with Stratified Logic Programs in Knowledge Representation. In: RaÅ›, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)