Query-driven procedures for hybrid MKNF knowledge bases

DOI10.1145/2480759.2480768MaRDI QIDQ2946701zbMATH OpenOpenAlexDBLPWikidataFDO

Authors José Júlio Alferes, Matthias Knorr, Terrance Swift

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.3515

zbMATH Keywords

description logicshybrid knowledge basesontologiesrulestablingtractable fragmentswell-founded semantics

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Abstract: Hybrid MKNF knowledge bases are one of the most prominent tightly integrated combinations of open-world ontology languages with closed-world (non-monotonic) rule paradigms. The definition of Hybrid MKNF is parametric on the description logic (DL) underlying the ontology language, in the sense that non-monotonic rules can extend any decidable DL language. Two related semantics have been defined for Hybrid MKNF: one that is based on the Stable Model Semantics for logic programs and one on the Well-Founded Semantics (WFS). Under WFS, the definition of Hybrid MKNF relies on a bottom-up computation that has polynomial data complexity whenever the DL language is tractable. Here we define a general query-driven procedure for Hybrid MKNF that is sound with respect to the stable model-based semantics, and sound and complete with respect to its WFS variant. This procedure is able to answer a slightly restricted form of conjunctive queries, and is based on tabled rule evaluation extended with an external oracle that captures reasoning within the ontology. Such an (abstract) oracle receives as input a query along with knowledge already derived, and replies with a (possibly empty) set of atoms, defined in the rules, whose truth would suffice to prove the initial query. With appropriate assumptions on the complexity of the abstract oracle, the general procedure maintains the data complexity of the WFS for Hybrid MKNF knowledge bases. To illustrate this approach, we provide a concrete oracle for EL+, a fragment of the light-weight DL EL++. Such an oracle has practical use, as EL++ is the language underlying OWL 2 EL, which is part of the W3C recommendations for the Semantic Web, and is tractable for reasoning tasks such as subsumption. We show that query-driven Hybrid MKNF preserves polynomial data complexity when using the EL+ oracle and WFS.

Recommendations

• A goal-directed implementation of query answering for hybrid MKNF knowledge bases
• Local closed world reasoning with description logics under the well-founded semantics
• Reconciling description logics and rules
• Well-founded operators for normal hybrid MKNF knowledge bases
• Reasoning with inconsistencies in hybrid MKNF knowledge bases

Cited in

(11)

• Three-valued semantics for hybrid MKNF knowledge bases revisited
• On query procedures to build knowledge structures
• Terminating evaluation of logic programs with finite three-valued models
• Well-founded operators for normal hybrid MKNF knowledge bases
• Reasoning with vagueness in hybrid MKNF knowledge bases
• A goal-directed implementation of query answering for hybrid MKNF knowledge bases
• Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
• On combining ontologies and rules
• Local closed world reasoning with description logics under the well-founded semantics
• A semantics for probabilistic hybrid knowledge bases with function symbols
• On updates of hybrid knowledge bases composed of ontologies and rules

This page was built for publication: Query-driven procedures for hybrid MKNF knowledge bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946701)