A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes

DOI10.1007/11916277_16zbMath1165.68506OpenAlexW2118992936MaRDI QIDQ5387895

Ulrike Sattler, Boris Motik

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11916277_16

Mathematics Subject Classification ID

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

Related Items (11)

Tractable approximate deduction for OWL ⋮ Combining answer set programming with description logics for the semantic web ⋮ Deciding expressive description logics in the framework of resolution ⋮ A resolution-based decision procedure for \({\mathcal{SHOIQ}}\). ⋮ Consequence-based and fixed-parameter tractable reasoning in description logics ⋮ Reasoning in description logics by a reduction to disjunctive datalog ⋮ Simple and Efficient Clause Subsumption with Feature Vector Indexing ⋮ Magic sets for disjunctive Datalog programs ⋮ Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web ⋮ Exploiting conjunctive queries in description logic programs ⋮ On the scalability of description logic instance retrieval

Uses Software

• VAMPIRE
• Pellet
• KAON2
• E Theorem Prover

This page was built for publication: A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes