Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis

DOI10.1007/978-3-319-48758-8_5zbMath1483.68393OpenAlexW2543323014MaRDI QIDQ2835863

Marie-Laure Mugnier, Odile Papini, Karim Tabia, Salem Benferhat, Zied Bouraoui, Jean-François Baget, Swan Rocher, Madalina Croitoru

Publication date: 30 November 2016

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

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01412864/file/jelia16.pdf

Mathematics Subject Classification ID

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

Related Items (6)

Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases ⋮ Inconsistency-Tolerant Querying of Description Logic Knowledge Bases ⋮ Assertional Removed Sets Merging of DL-Lite Knowledge Bases ⋮ Query answering DL-lite knowledge bases from hidden datasets ⋮ Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis ⋮ $$\exists $$ -ASP for Computing Repairs with Existential Ontologies

Cites Work

• Towards more expressive ontology languages: the query answering problem
• On rules with existential variables: walking the decidability line
• Nonmonotonic reasoning, preferential models and cumulative logics
• Nonmonotonic inference based on expectations
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis
• Computational Complexity of Probabilistic Turing Machines
• Answer sets for consistent query answering in inconsistent databases
• Rational Closure for Defeasible Description Logics
• Linking Data to Ontologies

This page was built for publication: Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis