Games for query inseparability of description logic knowledge bases

DOI10.1016/j.artint.2016.01.010zbMath1351.68263OpenAlexW2278564037WikidataQ62048604 ScholiaQ62048604MaRDI QIDQ253977

Vladislav Ryzhikov, Roman Kontchakov, Elena Botoeva, Frank Wolter, Michael Zakharyashchev

Publication date: 8 March 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://eprints.bbk.ac.uk/id/eprint/14142/1/aij-final.pdf

zbMATH Keywords

computational complexitygames on graphsdescription logicknowledge baseconjunctive queryquery inseparability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Applications of game theory (91A80) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Knowledge base exchange: the case of OWL 2 QL, Unnamed Item, Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey, Logical foundations of information disclosure in ontology-based data integration, Query inseparability for \(\mathcal{ALC}\) ontologies

Uses Software

• ContentCVS
• Ontop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forgetting for knowledge bases in DL-lite
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Modular ontologies. Concepts, theories and techniques for knowledge modularization
• Deciding inseparability and conservative extensions in the description logic
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Theory of computation.
• (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\)
• Reachability Modules for the Description Logic $\mathcal{SRIQ}$
• The Logical Difference for the Lightweight Description Logic EL
• Complexities of Horn Description Logics
• Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach
• Count and Forget: Uniform Interpolation of  $\mathcal{SHQ}$ -Ontologies
• Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
• The DL-Lite Family and Relations
• Incomplete Information in Relational Databases
• Infinite Games
• Linking Data to Ontologies