Games for query inseparability of description logic knowledge bases
From MaRDI portal
computational complexityconjunctive querydescription logicgames on graphsknowledge basequery inseparability
Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Logic in artificial intelligence (68T27) Games involving graphs (91A43)
Recommendations
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Deciding inseparability and conservative extensions in the description logic
- Data complexity of query answering in description logics
- Model-theoretic inseparability and modularity of description logic ontologies
- Inseparability and conservative extensions of description logic ontologies: a survey
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\)
- An \(O(n^2)\) time algorithm for alternating Büchi games
- Complexities of Horn description logics
- Count and forget: uniform interpolation of \(\mathcal{SHQ}\)-ontologies
- Data exchange beyond complete data
- Deciding inseparability and conservative extensions in the description logic
- Forgetting for knowledge bases in DL-lite
- Incomplete Information in Relational Databases
- Infinite Games
- Linking Data to Ontologies
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Modular ontologies. Concepts, theories and techniques for knowledge modularization
- Modular reuse of ontologies: theory and practice
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Reachability modules for the description logic \(\mathcal{SRIQ}\)
- Reasoning over ontologies with hidden content: the import-by-query approach
- The DL-Lite Family and Relations
- The logical difference for the lightweight description logic \(\mathcal {EL}\)
- Theory of computation.
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Cited in
(6)- Query inseparability for \(\mathcal{ALC}\) ontologies
- Model comparison games for Horn description logics
- The data complexity of ontology-mediated queries with closed predicates
- Logical foundations of information disclosure in ontology-based data integration
- Knowledge base exchange: the case of OWL 2 QL
- Inseparability and conservative extensions of description logic ontologies: a survey
This page was built for publication: Games for query inseparability of description logic knowledge bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q253977)
