Tractable reasoning with DL-programs over Datalog-rewritable description logics
From MaRDI portal
Publication:2999102
DOI10.3233/978-1-60750-606-5-35zbMATH Open1211.68402OpenAlexW131276444MaRDI QIDQ2999102FDOQ2999102
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
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\(^\pm\) ontologies with abductive logic programming
Cited In (12)
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Enhancing context knowledge repositories with justifiable exceptions
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Stepwise debugging of description-logic programs
- Inlining external sources in answer set programs
- Reasoning on Datalog\(^\pm\) ontologies with abductive logic programming
- Exploiting conjunctive queries in description logic programs
- An abductive framework for Datalog\(^\pm\) ontologies
- DaRLing: a Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries
- From description-logic programs to multi-context systems
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
Uses Software
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)
