Inconsistency-Tolerant Querying of Description Logic Knowledge Bases

DOI10.1007/978-3-319-49493-7_5zbMath1358.68285OpenAlexW2589172168MaRDI QIDQ2970304

Meghyn Bienvenu, Camille Bourgaux

Publication date: 30 March 2017

Published in: Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01633000/file/BieBou-RW16.pdf

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items

Inconsistency-tolerant query answering for existential rules, Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases, Unnamed Item, Consistent query answering for primary keys in Datalog, Preference-based inconsistency-tolerant query answering under existential rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data complexity of query answering in description logics
• More complicated questions about maxima and minima, and some closures of NP
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• The DL-Lite Family and Relations
• Nondeterministic Space is Closed under Complementation
• Deduction in Concept Languages: from Subsumption to Instance Checking
• The complexity of logic-based abduction
• NP trees and Carnap's modal logic
• Answer sets for consistent query answering in inconsistent databases
• Database Theory - ICDT 2005