Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Introduction to actual and potential contradictions
Handbook of defeasible reasoning and uncertainty management systems
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Nonmonotonic reasoning: from complexity to algorithms
Annals of Mathematics and Artificial Intelligence
Signed Systems for Paraconsistent Reasoning
Journal of Automated Reasoning
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Automated Reasoning with Merged Contradictory Information Whose Reliability Depends on Topics
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Artificial Intelligence - Special issue on nonmonotonic reasoning
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
A survey on knowledge compilation
AI Communications
Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
ACM Transactions on Computational Logic (TOCL)
Forgetting in Managing Rules and Ontologies
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Remedying inconsistent sets of premises
International Journal of Approximate Reasoning
Distance-based paraconsistent logics
International Journal of Approximate Reasoning
Semantic forgetting in answer set programming
Artificial Intelligence
Forgetting and conflict resolving in disjunctive logic programming
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A theory of forgetting in logic programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Forgetting actions in domain descriptions
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Inconsistency management and prioritized syntax-based entailment
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Quantifying information and contradiction in propositional logic through test actions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Reasoning under inconsistency: the forgotten connective
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Solving logic program conflict through strong and weak forgettings
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Solving logic program conflict through strong and weak forgettings
Artificial Intelligence
Solving conflicts in information merging by a flexible interpretation of atomic propositions
Artificial Intelligence
Inconsistency-Tolerance in knowledge-based systems by dissimilarities
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Knowledge-Base revision using implications as hypotheses
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
Forgetting for answer set programs revisited
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
In this paper, a fairly general framework for reasoning from inconsistent propositional bases is defined. Variable forgetting is used as a basic operation for weakening pieces of information so as to restore consistency. The key notion is that of recoveries, which are sets of variables whose forgetting enables restoring consistency. Several criteria for defining preferred recoveries are proposed, depending on whether the focus is laid on the relative relevance of the atoms or the relative entrenchment of the pieces of information (or both). Our framework encompasses several previous approaches as specific cases, including reasoning from preferred consistent subsets, and some forms of information merging. Interestingly, the gain in flexibility and generality offered by our framework does not imply a complexity shift compared to these specific cases.