Reconciling description logics and rules

Abstract

Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual knowledge, rules are focused on nonmonotonic inference. Many applications, however, require features of both DLs and rules. Developing a formalism that integrates DLs and rules would be a natural outcome of a large body of research in knowledge representation and reasoning of the last two decades; however, achieving this goal is very challenging and the approaches proposed thus far have not fully reached it. In this paper, we present a hybrid formalism of <i>MKNF<sup>&plus;</sup></i> <i>knowledge bases</i>, which integrates DLs and rules in a coherent semantic framework. Achieving seamless integration is nontrivial, since DLs use an open-world assumption, while the rules are based on a closed-world assumption. We overcome this discrepancy by basing the semantics of our formalism on the logic of minimal knowledge and negation as failure (MKNF) by Lifschitz. We present several algorithms for reasoning with MKNF<sup>&plus;</sup> knowledge bases, each suitable to different kinds of rules, and establish tight complexity bounds.

DOI: 10.1145/1754399.1754403

Extracted Key Phrases

6 Figures and Tables

0204060200920102011201220132014201520162017
Citations per Year

266 Citations

Semantic Scholar estimates that this publication has 266 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Motik2008ReconcilingDL, title={Reconciling description logics and rules}, author={Boris Motik and Riccardo Rosati}, journal={J. ACM}, year={2008}, volume={57}, pages={30:1-30:62} }