Local closed world reasoning with description logics under the well-founded semantics
DOI10.1016/J.ARTINT.2011.01.007zbMATH Open1225.68249DBLPjournals/ai/KnorrAH11OpenAlexW2116746190WikidataQ62046447 ScholiaQ62046447MaRDI QIDQ646502FDOQ646502
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
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
knowledge representationsemantic weblogic programmingnon-monotonic reasoningdescription logics and ontologies
Cites Work
- Combining answer set programming with description logics for the semantic web
- The well-founded semantics for general logic programs
- A lattice-theoretical fixpoint theorem and its applications
- The Description Logic Handbook
- Reconciling description logics and rules
- Title not available (Why is that?)
- Title not available (Why is that?)
- Description logics of minimal knowledge and negation as failure
- Combining Horn rules and description logics in CARIN
- Title not available (Why is that?)
- Abductive logic programs with penalization: semantics, complexity and implementation
- Handbook on ontologies
- Description logic rules
- What should a database know?
- Tabled evaluation with delaying for general logic programs
- Efficient inferencing for OWL EL
- Open answer set programming for the semantic web
Cited In (19)
- MWeb: a principled framework for modular web rule bases and its semantics
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- On combining ontologies and rules
- Tractable reasoning using logic programs with intensional concepts
- Forgetting in ASP: the forgotten properties
- Flexible approximators for approximating fixpoint theory
- Data repair of inconsistent nonmonotonic description logic programs
- A goal-directed implementation of query answering for hybrid MKNF knowledge bases
- On updates of hybrid knowledge bases composed of ontologies and rules
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- A fixpoint characterization of three-valued disjunctive hybrid MKNF knowledge bases
- An iterative fixpoint semantics for MKNF hybrid knowledge bases with function symbols
- Towards provenance in heterogeneous knowledge bases
- Normative systems represented as hybrid knowledge bases
- Query-driven procedures for hybrid MKNF knowledge bases
- Reconciling description logics and rules
- Reasoning with inconsistencies in hybrid MKNF knowledge bases
- Well-founded operators for normal 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)
