Tractable query answering and rewriting under description logic constraints
From MaRDI portal
Publication:975872
DOI10.1016/j.jal.2009.09.004zbMath1192.68218WikidataQ56988673 ScholiaQ56988673MaRDI QIDQ975872
Ian Horrocks, Boris Motik, Héctor Pérez-Urbina
Publication date: 11 June 2010
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2009.09.004
Related Items
Reasoning and Query Answering in Description Logics, First-Order Resolution Methods for Modal Logics, Towards more expressive ontology languages: the query answering problem, Top-\(k\) retrieval for ontology mediated access to relational databases
Cites Work
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- First-order query rewriting for inconsistent databases
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- Resolution Strategies as Decision Procedures
- Logical foundations of object-oriented and frame-based languages
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
- Rewriting Conjunctive Queries over Description Logic Knowledge Bases
- Answering queries using views: A survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
