Reasoning under inconsistency: a forgetting-based approach
From MaRDI portal
Publication:991019
DOI10.1016/J.ARTINT.2010.04.023zbMATH Open1206.68301OpenAlexW2162280637MaRDI QIDQ991019FDOQ991019
Authors: Jérôme Lang, Pierre Marquis 
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
Recommendations
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- On inference from inconsistent premisses
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonmonotonic reasoning: From complexity to algorithms
- Minimally inconsistent LP
- Propositional distances and compact preference representation
- Title not available (Why is that?)
- \(\text{DA}^2\) merging operators
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signed systems for paraconsistent reasoning
- Inconsistency tolerance.
- Complexity Results for Nonmonotonic Logics
- On the Semantics of Arbitration
- Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
- Distance-based paraconsistent logics
- Semantic forgetting in answer set programming
- Remedying inconsistent sets of premises
- On stratified belief base compilation
- Counterfactuals
- Solving logic program conflict through strong and weak forgettings
- Recovering Consistency by Forgetting Inconsistency
- Title not available (Why is that?)
- Logics in Artificial Intelligence
Cited In (25)
- A logic-algebraic tool for reasoning with knowledge-based systems
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- Title not available (Why is that?)
- Disjunctive closures for knowledge compilation
- Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions
- Asynchronous multi-context systems
- Forgetting in multi-agent modal logics
- Variable Forgetting in Reasoning about Knowledge
- Title not available (Why is that?)
- Forgetting-Based Inconsistency Measure
- On the complexity of inconsistency measurement
- Borderline vs. unknown: comparing three-valued representations of imperfect information
- Propositional variable forgetting and marginalization: semantically, two sides of the same coin
- A syntactic operator for forgetting that satisfies strong persistence
- Solving conflicts in information merging by a flexible interpretation of atomic propositions
- From forgetting signature elements to forgetting formulas in epistemic states
- On syntactic forgetting under uniform equivalence
- On the limits of forgetting in answer set programming
- Comparing and weakening possibilistic knowledge bases
- Common equivalence and size of forgetting from Horn formulae
- Recovering Consistency by Forgetting Inconsistency
- A general framework for reasoning on inconsistency
- A dissimilarity-based framework for generating inconsistency-tolerant logics
- Measuring inconsistency through subformula forgetting
- On quantifying literals in Boolean logic and its applications to explainable AI
This page was built for publication: Reasoning under inconsistency: a forgetting-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991019)
