Well-founded semantics for description logic programs in the semantic web

DOI10.1145/1877714.1877717MaRDI QIDQ2946628zbMATH OpenOpenAlexWikidataFDO

Authors Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer

Publication date 17 September 2015

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

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.2537

zbMATH Keywords

answer set semanticsdescription logic programsdescription logicsnormal logic programssemantic webwell-founded semantics

Mathematics Subject Classification ID

Internet topics (68M11) Logic programming (68N17) Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Combining answer set programming with description logics for the semantic web
• A logical semantics for description logic programs
• Reconciling well-founded semantics of DL-programs and aggregate programs
• The loop formula based semantics of description logic programs
• Logic Programming

Cited in

(23)

• Exploiting conjunctive queries in description logic programs
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
• On the Turing completeness of the semantic web
• Combining answer set programming with description logics for the semantic web
• Flexible approximators for approximating fixpoint theory
• MWeb: a principled framework for modular web rule bases and its semantics
• Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
• Tractable reasoning with DL-programs over Datalog-rewritable description logics
• Data repair of inconsistent nonmonotonic description logic programs
• Reconciling OWL and non-monotonic rules for the semantic web
• Answer Set Programming: A Primer
• A logical semantics for description logic programs
• Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
• An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
• From description-logic programs to multi-context systems
• Reconciling well-founded semantics of DL-programs and aggregate programs
• Logic Programming
• On combining ontologies and rules
• Local closed world reasoning with description logics under the well-founded semantics
• Defeasible RDFS via rational closure
• Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
• The loop formula based semantics of description logic programs
• Open answer set programming for the semantic web

This page was built for publication: Well-founded semantics for description logic programs in the semantic web

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