Skip to main content
SpringerLink
Log in

Merge Path Improvements for Minimal Model Hyper Tableaux

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1617))

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.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Aravindan and P. Baumgartner. A Rational and Efficient Algorithm for View Deletion in Databases. In Proc. ILPS, New York, 1997. The MIT Press.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. P. Baumgartner, U. Furbach, and I. Niemelä. Hyper Tableaux. In Proc. JELIA 96, LNAI 1126. Springer, 1996.

    Google Scholar 

  4. 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

  5. F. Bry and A. Yahya. Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux. In Miglioli et al. [11], pages 143–159.

    Google Scholar 

  6. T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are π p2 -complete. Theoretical Computer Science, 114:231–245, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. D. Horton and B. Spencer. Clause trees: a tool for understanding and implementing resolution in automated reasoning. Artificial Intelligence, 92:25–89, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  8. 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.

    Google Scholar 

  9. R. Letz, K. Mayr, and C. Goller. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13, 1994.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors. Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071. Springer, 1996.

    Google Scholar 

  12. I. Niemelä. A Tableau Calculus for Minimal Model Reasoning. In Miglioli et al. [11].

    Google Scholar 

  13. I. Niemelä. Implementing circumscription using a tableau method. In Proc. ECAI, pages 80–84, Budapest, 1996. John Wiley.

    Google Scholar 

  14. N. Olivetti. A tableaux and sequent calculus for minimal entailment. Journal of Automated Reasoning, 9:99–139, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  15. T. Przymusinski. An Algorithm to Compute Circumscription. Artificial Intelligence, 38:49–73, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  16. R. Reiter. A Theory of Diagnosis from First Principles. Artificial Intelligence, 32(1):57–95, Apr. 1987.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of New Brunswick Fredericton, New Brunswick, E3B 5A3, Canada

    Peter Baumgartner, J. D. Horton & Bruce Spencer

Authors
  1. Peter Baumgartner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. D. Horton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bruce Spencer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Institute for Programming and Logics, University at Albany - SUNY, Albany, NY, 12222, USA

    Neil V. Murray

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation