论文信息 - Semantically Guided Theorem Proving for Diagnosis Applications

Semantically Guided Theorem Proving for Diagnosis Applications

In this paper we demonstrate how general purpose automated theorem proving techniques can be used to solve realistic model-based diagnosis problems. For this we modify a model generating tableau calculus such that a model of a correctly behaving device can be used to guide the search for minimal diagnoses. Our experiments show that our general approach is competitive with specialized diagnosis systems.

Peter Baumgartner | Peter Fröhlich | Ulrich Furbach | Wolfgang Nejdl

[1] Christoph Weidenbach,et al. Soft Typing for Ordered Resolution , 1997, CADE.

[2] François Bry,et al. Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux , 1996, TABLEAUX.

[3] Peter Fröhlich,et al. Minimal model semantics for diagnosis -- techniques and first benchmarks , 1996 .

[4] David A. Plaisted,et al. Semantically Guided First-Order Theorem Proving using Hyper-Linking , 1994, CADE.

[5] Peter Fröhlich,et al. A Model-based Reasoning Approach to Circumscription , 1996, ECAI.

[6] François Bry,et al. SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[7] Peter Baumgartner,et al. Hyper Tableaux , 1996, JELIA.

[8] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[9] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..