Local closed world reasoning with description logics under the well-founded semantics

DOI10.1016/J.ARTINT.2011.01.007MaRDI QIDQ646502zbMATHOpenAlexDBLPWikidataFDO

Authors Matthias Knorr, José Júlio Alferes, Pascal Hitzler

Publication date 17 November 2011

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://corescholar.libraries.wright.edu/cgi/viewcontent.cgi?article=1116&context=cse

zbMATH Keywords

knowledge representationsemantic weblogic programmingnon-monotonic reasoningdescription logics and ontologies

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• Reconciling description logics and rules
• Well-founded semantics for description logic programs in the semantic web
• A goal-directed implementation of query answering for hybrid MKNF knowledge bases
• Query-driven procedures for hybrid MKNF knowledge bases
• Combining answer set programming with description logics for the semantic web

Cites work

• scientific article; zbMATH DE number 67490 (Why is no real title available?)
• scientific article; zbMATH DE number 1059246 (Why is no real title available?)
• scientific article; zbMATH DE number 837700 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• Abductive logic programs with penalization: semantics, complexity and implementation
• Combining Horn rules and description logics in CARIN
• Combining answer set programming with description logics for the semantic web
• Description logic rules
• Description logics of minimal knowledge and negation as failure
• Efficient inferencing for OWL EL
• Handbook on ontologies
• Open answer set programming for the semantic web
• Reconciling description logics and rules
• Tabled evaluation with delaying for general logic programs
• The Description Logic Handbook
• The well-founded semantics for general logic programs
• What should a database know?

Cited in

(19)

• On combining ontologies and rules
• Flexible approximators for approximating fixpoint theory
• Towards provenance in heterogeneous knowledge bases
• Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
• Reconciling description logics and rules
• MWeb: a principled framework for modular web rule bases and its semantics
• On updates of hybrid knowledge bases composed of ontologies and rules
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
• Query-driven procedures for hybrid MKNF knowledge bases
• A fixpoint characterization of three-valued disjunctive hybrid MKNF knowledge bases
• An iterative fixpoint semantics for MKNF hybrid knowledge bases with function symbols
• Forgetting in ASP: the forgotten properties
• Reasoning with inconsistencies in hybrid MKNF knowledge bases
• Three-valued semantics for hybrid MKNF knowledge bases revisited
• Data repair of inconsistent nonmonotonic description logic programs
• Tractable reasoning using logic programs with intensional concepts
• Normative systems represented as hybrid knowledge bases
• Well-founded operators for normal hybrid MKNF knowledge bases
• A goal-directed implementation of query answering for hybrid MKNF knowledge bases

This page was built for publication: Local closed world reasoning with description logics under the well-founded semantics

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