Tractable reasoning with DL-programs over Datalog-rewritable description logics

DOI10.3233/978-1-60750-606-5-35MaRDI QIDQ2999102zbMATH OpenOpenAlexFDO

Authors Stijn Heymans, Thomas Eiter, Guohui Xiao

Publication date 11 May 2011

Full work available at URL https://publik.tuwien.ac.at/files/PubDat_190852.pdf

Mathematics Subject Classification ID

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

Recommendations

• Combining answer set programming with description logics for the semantic web
• Well-founded semantics for description logic programs in the semantic web
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• Exploiting conjunctive queries in description logic programs
• Reasoning on Datalog^ ontologies with abductive logic programming

Cited in

(12)

• Exploiting conjunctive queries in description logic programs
• Enhancing context knowledge repositories with justifiable exceptions
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• Stepwise debugging of description-logic programs
• Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
• An abductive framework for Datalog\(^\pm\) ontologies
• Reasoning on Datalog^ ontologies with abductive logic programming
• Inlining external sources in answer set programs
• DaRLing: a Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries
• From description-logic programs to multi-context systems

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Tractable reasoning with DL-programs over Datalog-rewritable description logics

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