Inconsistency-tolerant query answering: rationality properties and computational complexity analysis

DOI10.1007/978-3-319-48758-8_5MaRDI QIDQ2835863zbMATH OpenOpenAlexFDO

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

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) Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• Inconsistency-tolerant instance checking in tractable description logics
• Computing and explaining query answers over inconsistent DL-Lite knowledge bases
• Complexity Results for Probabilistic Datalog
• How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)?

Cites work

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

Cited in

(14)

• Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
• Assertional removed sets merging of DL-Lite knowledge bases
• Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
• Computing and explaining query answers over inconsistent DL-Lite knowledge bases
• A formalism unifying defeasible logics and repair semantics for existential rules
• Investigating the mapping between default logic and inconsistency-tolerant semantics
• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• \(\exists \)-ASP for computing repairs with existential ontologies
• On quasi-inconsistency and its complexity
• Query answering DL-lite knowledge bases from hidden datasets
• Inconsistency-tolerant instance checking in tractable description logics
• Preference-based inconsistency-tolerant query answering under existential rules
• Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies
• Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases

This page was built for publication: Inconsistency-tolerant query answering: rationality properties and computational complexity analysis

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