A theory of diagnosis from first principles
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
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Feature construction for reduction of tabular knowledge-based systems
Information Sciences—Informatics and Computer Science: An International Journal
Checking the consistency of a hybrid knowledge base system
Knowledge-Based Systems
| Hi-index | 0.00 |
In this paper, a new efficient technique is introduced to check the logical consistency of first-order function-free stratified knowledge-based decision-support systems (KBs). It is based on a progressive instantiation schema that enables us to benefit from the power of local search techniques for propositional satisfiability and search. It combines a knowledge preference pre-ordering with a concept of depth-limited reasoning. An algorithm that proves efficient very often is proposed. It delivers a good approximation of Benferhat et al.'s preferred maximal inclusion-based consistent sub-bases. The approach is extended to cover forms of non-monotonic KBs, as well.