A theory of diagnosis from first principles
Artificial Intelligence
An algorithm to compute circumscription
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Clause trees: a tool for understanding and implementing resolution in automated reasoning
Artificial Intelligence
A rational and efficient algorithm for view deletion in databases
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Tableau Calculus for Minimal Model Reasoning
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
Embedding Negation as Failure into a Model Generation Theorem Prover
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
| Hi-index | 0.00 |
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed within the hyper tableau framework. This combination generalizes well-known tableaux techniques like complement splitting and folding-up/down. We argue that this combination allows for efficiency improvements over previous, related methods. It is motivated by application to diagnosis tasks; in particular the problem of avoiding redundancies in the diagnoses of electrical circuits with reconvergent fanouts is addressed by the new technique. In the paper we develop as our main contribution in a more general way a sound and complete calculus for propositional circumscriptive reasoning in the presence of minimized and varying predicates.