Rewriting Conjunctive Queries over Description Logic Knowledge Bases

DOI10.1007/978-3-540-88594-8_11zbMath1165.68516OpenAlexW1607312090MaRDI QIDQ5504588

Ian Horrocks, Boris Motik, Héctor Pérez-Urbina

Publication date: 22 January 2009

Published in: Semantics in Data and Knowledge Bases (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88594-8_11

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (1)

Tractable query answering and rewriting under description logic constraints

Cites Work

• Data complexity of query answering in description logics
• Capturing complexity classes by fragments of second-order logic
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Resolution Strategies as Decision Procedures
• Resolution-based methods for modal logics
• Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
• Answering queries using views: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rewriting Conjunctive Queries over Description Logic Knowledge Bases