Query and predicate emptiness in ontology-based data access

DOI10.1613/JAIR.4866zbMATH Open1357.68226OpenAlexW2347154127MaRDI QIDQ2805284FDOQ2805284

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

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

Mathematics Subject Classification ID

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

Cited In (9)

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

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)