Merge Path Improvements for Minimal Model Hyper Tableaux

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.

[1]  Jürgen Ebert,et al.  A Generic System to Support Multi-Level Understanding of Heterogeneous Software , 1997 .

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

[3]  Georg Gottlob,et al.  Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..

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

[5]  Norbert Eisinger,et al.  A Confluent Connection Calculus , 2000, Intellectics and Computational Logic.

[6]  Manfred Kamp.  Managing a multi-file, multi-language software repository for program comprehension tools: a generic approach , 1998, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242).

[7]  Angelika Franzke.  GRAL 2.0: A Reference Manual , 1997 .

[8]  Jürgen Ebert,et al.  Program comprehension in multi-language systems , 1998, Proceedings Fifth Working Conference on Reverse Engineering (Cat. No.98TB100261).

[9]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[10]  Jürgen Ebert,et al.  Specifying Object Oriented Systems Using Gdmo, Zest and Sdl'92 Specifying Object Oriented Systems Using Gdmo, Zest and Sdl'92 Reports of the Gdmo Project Specifying Object Oriented Systems Using Gdmo, Zest and Sdl'92 , 1997 .

[11]  Jürgen Ebert,et al.  The extract-transform-rewrite cycle: a step towards metaCARE , 1998, Proceedings of the Second Euromicro Conference on Software Maintenance and Reengineering.

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

[13]  Jürgen Dix,et al.  A Framework to Incorporate Non-Monotonic Reasoning Into Constraint Logic Programming , 1998, J. Log. Program..

[14]  Peter Baumgartner,et al.  Theorem Proving with Analytic Tableaux and Related Methods , 1996, Lecture Notes in Computer Science.

[15]  Andreas Schmid,et al.  Solution for the Counting to Infinity Problem of Distance Vector Routing , 1998 .

[16]  Stephan Philippi,et al.  System modelling using Object-Oriented Pr / T-Nets , 1997 .

[17]  Peter Baumgartner,et al.  Hyper Tableaux The Next Generation , 1997 .

[18]  Teodor C. Przymusinski.  An Algorithm to Compute Circumscription , 1989, Artif. Intell..

[19]  Lutz Priese,et al.  A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets , 1998, Theor. Comput. Sci..

[20]  Peter Baumgartner,et al.  Tableaux for Diagnosis Applications , 1997, TABLEAUX.

[21]  Angelika Franzke,et al.  Recommendations for an Improvement of GDMO Final Report of the GDMO Project March 1997 , 1997 .

[22]  Peter Baumgartner,et al.  Semantically Guided Theorem Proving for Diagnosis Applications , 1997, IJCAI.

[23]  Jürgen Dix,et al.  DisLoP: A Research Project on Disjunctive Logic Programming , 1997, AI Commun..

[24]  Joseph Douglas Horton,et al.  Clause Trees: A Tool for Understanding and Implementing Resolution in Automated Reasoning , 1997, Artif. Intell..

[25]  Jürgen Dix,et al.  Transformation-based bottom-up computation of the well-founded model , 1996, Theory and Practice of Logic Programming.

[26]  Chandrabose Aravindan,et al.  A Rational and Efficient Algorithm for View Deletion in Databases , 1997, ILPS.

[27]  Marcello Balduccini,et al.  Logic Programming And Nonmonotonic Reasoning , 1997, Lecture Notes in Computer Science.

[28]  Luís Moniz Pereira,et al.  Prolegomena to Logic Programming for Non-monotonic Reasoning , 1996, NMELP.

[29]  Ulrich Furbach,et al.  Disjunctive Logic Program = Horn Program + Control Program , 1998, JELIA.

[30]  L Priese,et al.  Finite H-systems with 3 test tubes are not predictable. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[31]  Carlo Simon,et al.  The Petri Net Tools Neptun and Poseidon , 1997 .

[32]  David Sharpe.  The AllPaths automated reasoning procedure with clause trees , 1996 .

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

[34]  Ilkka Niemelä.  A Tableau Calculus for Minimal Model Reasoning , 1996, TABLEAUX.

[35]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[36]  Joseph Douglas Horton,et al.  Extending the Regular Restriction of Resolution to Non-Linear Subdeductions , 1997, AAAI/IAAI.

[37]  Katsumi Inoue,et al.  Embedding Negation as Failure into a Model Generation Theorem Prover , 1992, CADE.

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

[39]  Andreas Winter,et al.  Querying as an enabling technology in software reengineering , 1999, Proceedings of the Third European Conference on Software Maintenance and Reengineering (Cat. No. PR00090).

[40]  Jens Woch,et al.  A Component-based and Abstractivistic Agent Architecture for the Modelling of Mas in the Social Sciences , 1997 .

[41]  Ilkka Niemelä.  Implementing Circumscription Using a Tableau Method , 1996, ECAI.

[42]  Wolfgang Albrecht,et al.  Integrating Fixed Priority and Static Scheduling to Maintain External Consistency , 1997 .