Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Aravindan and P. Baumgartner. A Rational and Efficient Algorithm for View Deletion in Databases. In Proc. ILPS, New York, 1997. The MIT Press.
P. Baumgartner, P. Fröhlich, U. Furbach, and W. Nejdl. Semantically Guided Theorem Proving for Diagnosis Applications. In Proc. IJCAI 97, pages 460–465, Nagoya, 1997.
P. Baumgartner, U. Furbach, and I. Niemelä. Hyper Tableaux. In Proc. JELIA 96, LNAI 1126. Springer, 1996.
P. Baumgartner, J.D. Horton, and B. Spencer. Merge Path Improvements for Minimal Model Hyper Tableaux. Fachberichte Informatik 1–99, Universität Koblenz-Landau, 1999. URL: http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/RR-1-99.ps.gz
F. Bry and A. Yahya. Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux. In Miglioli et al. [11], pages 143–159.
T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are π p2 -complete. Theoretical Computer Science, 114:231–245, 1993.
J. D. Horton and B. Spencer. Clause trees: a tool for understanding and implementing resolution in automated reasoning. Artificial Intelligence, 92:25–89, 1997.
K. Inoue, M. Koshimura, and R. Hasegawa. Embedding Negation as Failure into a Model Generation Theorem Prover. In D. Kapur, editor, In Proc. CADE 11, LNAI 607, pp. 400–415. Springer, 1992.
R. Letz, K. Mayr, and C. Goller. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13, 1994.
R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In E. Lusk and R. Overbeek, editors, Proc. CADE 9, LNCS 310, pp. 415–434. Springer, 1988.
P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors. Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071. Springer, 1996.
I. Niemelä. A Tableau Calculus for Minimal Model Reasoning. In Miglioli et al. [11].
I. Niemelä. Implementing circumscription using a tableau method. In Proc. ECAI, pages 80–84, Budapest, 1996. John Wiley.
N. Olivetti. A tableaux and sequent calculus for minimal entailment. Journal of Automated Reasoning, 9:99–139, 1992.
T. Przymusinski. An Algorithm to Compute Circumscription. Artificial Intelligence, 38:49–73, 1989.
R. Reiter. A Theory of Diagnosis from First Principles. Artificial Intelligence, 32(1):57–95, Apr. 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baumgartner, P., Horton, J.D., Spencer, B. (1999). Merge Path Improvements for Minimal Model Hyper Tableaux. In: Murray, N.V. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1999. Lecture Notes in Computer Science(), vol 1617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48754-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-48754-9_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66086-6
Online ISBN: 978-3-540-48754-8
eBook Packages: Springer Book Archive