A theory of diagnosis from first principles
Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
Checking Several Forms of Consistency in Nonmonotonic Knowledge-Bases
ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning
System Description: CRIL Platform for SAT
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Validation of Knowledge-Based Systems by Means of Stochastic Search
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
Validation of Knowledge-Based Systems by Means of Stochastic Search
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
How Hard is it to Revise a Belief Base?
How Hard is it to Revise a Belief Base?
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
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
How to infer from inconsistent beliefs without revising
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
| Hi-index | 0.00 |
Most approaches to inconsistency handling in stratified propositional belief bases (KB) exhibit bad worst case computational complexity results, seemingly placing large real-life applications out of reach. One natural way to overcome this drawback consists in adopting a trade-off between the solution quality and the actual computational resources that are spent. Taking Benferhat et al.'s inclusion and lexicographic orderings as a case study, a complete revision algorithm is provided in the context of a single kernel assumption. It is shown to be a good approximation in the general case. Based on powerful heuristics about local search, this technique appears efficient for very large KBs, as illustrated by our experimental results.