Reasoning under inconsistency: a forgetting-based approach
From MaRDI portal
Publication:991019
DOI10.1016/j.artint.2010.04.023zbMath1206.68301OpenAlexW2162280637MaRDI QIDQ991019
Publication date: 2 September 2010
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/4511
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (16)
Comparing and Weakening Possibilistic Knowledge Bases ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions ⋮ On the limits of forgetting in answer set programming ⋮ Solving conflicts in information merging by a flexible interpretation of atomic propositions ⋮ Disjunctive closures for knowledge compilation ⋮ Borderline vs. unknown: comparing three-valued representations of imperfect information ⋮ Measuring Inconsistency Through Subformula Forgetting ⋮ A logic-algebraic tool for reasoning with knowledge-based systems ⋮ A dissimilarity-based framework for generating inconsistency-tolerant logics ⋮ Asynchronous Multi-Context Systems ⋮ On syntactic forgetting under uniform equivalence ⋮ Forgetting in multi-agent modal logics ⋮ On the complexity of inconsistency measurement ⋮ On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On stratified belief base compilation
- \(\text{DA}^2\) merging operators
- Remedying inconsistent sets of premises
- Minimally inconsistent LP
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Nonmonotonic reasoning: From complexity to algorithms
- Signed systems for paraconsistent reasoning
- Inconsistency tolerance.
- Propositional distances and compact preference representation
- Distance-based paraconsistent logics
- Semantic forgetting in answer set programming
- Solving logic program conflict through strong and weak forgettings
- On inference from inconsistent premisses
- On the Semantics of Arbitration
- Recovering Consistency by Forgetting Inconsistency
- Complexity Results for Nonmonotonic Logics
- Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
- Logics in Artificial Intelligence
- Counterfactuals
This page was built for publication: Reasoning under inconsistency: a forgetting-based approach
