Ontologies and rules are usually loosely coupled in knowledge rep- resentation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non-monotonic, closed-world reasoning. One ex- ception is the tightly-coupled framework of Minimal Knowledge and Negation as Failure (MKNF), which allows statements about individuals to be jointly derived via entailment from an ontology and inferences from rules. Nonetheless, the prac- tical usefulness of MKNF has not always been clear, although recent work has formalized a general resolution- based method for querying MKNF when rules are taken to have the well-founded semantics, and the ontology is modeled by a general Oracle. That work leaves open what algorithms should be used to relate the entailments of the ontology and the inferences of rules. In this paper we pro- vide such algorithms, and describe the implementation of a query-driven system, CDF-Rules, for hybrid knowledge bases combining both (non- monotonic) rules under the well-founded semantics and a (monotonic) ontology, represented by a CDF (ALCQ) theory.
|Title of host publication||Lecture Notes in Computer Science|
|Publication status||Published - 1 Jan 2010|
|Event||Practical Aspects of Declarative Languages - |
Duration: 1 Jan 2010 → …
|Conference||Practical Aspects of Declarative Languages|
|Period||1/01/10 → …|