Query and predicate emptiness in ontology-based data access

DOI10.1613/JAIR.4866MaRDI QIDQ2805284zbMATH OpenOpenAlexFDO

Authors Franz Baader, Meghyn Bienvenu, Carsten Lutz, F. Wolter

Publication date 11 May 2016

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4866

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Database theory (68P15) Logic in artificial intelligence (68T27)

Recommendations

• View-based query answering in description logics: semantics and complexity
• Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
• Query answering over description logic ontologies
• Temporalizing ontology-based data access
• Circuit complexity meets ontology-based data access

Cited in

(9)

• Query inseparability for \(\mathcal{ALC}\) ontologies
• Branching time agents logics, satisfiability problem by rules in reduced form
• A logic-based framework for characterizing nexus of similarity within knowledge bases
• Logical foundations of information disclosure in ontology-based data integration
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• Temporal multi-valued logic with lost worlds in the past
• Many-valued multi-modal logics, satisfiability problem
• Inseparability and conservative extensions of description logic ontologies: a survey
• Bounds in ontology-based data access via circuit complexity

This page was built for publication: Query and predicate emptiness in ontology-based data access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805284)