Skip to main content
SpringerLink
Log in

Proof Simplification for Model Generation and Its Applications

  • Conference paper
  • First Online:
Logic for Programming and Automated Reasoning (LPAR 2000)

Part of the book series: Lecture Notes in Artificial Intelligence ((LNAI,volume 1955))

Abstract

Proof simplification eliminates unnecessary parts from a proof leaving only essential parts in a simplified proof. This paper gives a proof simplification procedure for model generation theorem proving and its applications to proof condensation, folding-up and completeness proofs for non-Horn magic sets. These indicate that proof simplification plays a useful role in theorem proving.

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. O. L. Astrachan and M. E. Stickel. Caching and Lemmaizing in Model Elimination Theorem Provers. In Kapur [10], pages 224–238. 104

    Google Scholar 

  2. P. Baumgartner, U. Furbach, and I. Niemelä. Hyper Tableaux. In J. J. Alferes, L. M. Pereira, and E. Orłowska, editors, Proc. European Workshop: Logics in Artificial Intelligence, JELIA, volume 1126 of Lecture Notes in Artificial Intelligence, pages 1–17. Springer-Verlag, 1996. 96, 102

    Google Scholar 

  3. P. Baumgartner, J. D. Horton, and B. Spencer. Merge Path Improvements for Minimal Model Hyper Tableaux. In N. V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods, number 1617 in Lecture Notes in Artificial Intelligence, pages 51–65. Springer, June 1999. 104

    Google Scholar 

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

    Google Scholar 

  5. T. Chikayama, T. Fujise, and D. Sekita. A Portable and Efficient Implementation of KL1. In Proceedings International Symposium on Programming Language Implementation and Logic Programming, number 844 in Lecture Notes in Computer Science, pages 25–39. Springer, 1994. 109

    Google Scholar 

  6. H. Ganzinger, editor. Automated Deduction-CADE-16, number 1632 in Lecture Notes in Artificial Intelligence. Springer, July 1999. 113, 113

    Google Scholar 

  7. R. Hasegawa, K. Inoue, Y. Ohta, and M. Koshimura. Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. In McCune [14], pages 176–190. 96, 97, 107

    Google Scholar 

  8. K. Inoue, M. Koshimura, and R. Hasegawa. Embedding Negation as Failure into a Model Generation Theorem Prover. In Kapur [10], pages 400–415. 96

    Google Scholar 

  9. K. Iwanuma. Lemma Matching for a PTTP-based Top-down Theorem Prover. In McCune [14], pages 146–160. 104

    Google Scholar 

  10. D. Kapur, editor. Automated Deduction-CADE-11, number 607 in Lecture Notes in Artificial Intelligence. Springer, June 1992. 112, 113

    Google Scholar 

  11. M. Koshimura and R. Hasegawa. A Proof of Completeness for Non-Horn Magic Sets and Its Application to Proof Condensation. Automated Reasoning with Analytic Tableaux and Related Methods: POSITION PAPERS, pages 101–115, June 1999. Technical Report 99-1, University at Albany. 106, 109

    Google Scholar 

  12. R. Letz, K. Mayr, and C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13:297–337, 1994. 96, 104

    Article  MATH  MathSciNet  Google Scholar 

  13. R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In E. Lusk and R. Overbeek, editors, 9th International Conference on Automated Deduction, number 310 in Lecture Notes in Computer Science, pages 415–434. Springer-Verlag, 1988. 96, 107

    Google Scholar 

  14. W. McCune, editor. Automated Deduction-CADE-14, number 1249 in Lecture Notes in Artificial Intelligence. Springer, July 1997. 113, 113

    Google Scholar 

  15. P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors. Theorem Proving with Analytic Tableaux and Related Methods, number 1071 in Lecture Notes in Artificial Intelligence. Springer, May 1996. 112, 113

    Google Scholar 

  16. I. Niemelä. A Tableau Calculus for Minimal Model Reasoning. In Miglioli et al. [15], pages 278–294. 96

    Google Scholar 

  17. F. Oppacher and E. Suen. HARP: A Tableau-Based Theorem Prover. Journal of Automated Reasoning, 4:69–100, 1988. 96, 102

    Article  MathSciNet  Google Scholar 

  18. S. Schulz. System Abstract: E 0.3. In Ganzinger [6], pages 297–301. 112

    Google Scholar 

  19. G. Sutcliffe and C. Suttner. The TPTP Problem Library-CNF Release v1.2.1. Journal of Automated Reasoning, 21(2):177–203, October 1998. 109, 109

    Article  MATH  MathSciNet  Google Scholar 

  20. A. Vellino. The Complexity of Automated Reasoning. PhD thesis, University of Toronto, 1989. 103

    Google Scholar 

  21. C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel, E. Keen, C. Theobalt, and D. Topić. System Description: SPASS Version 1.0.0. In Ganzinger [6], pages 378–382. 109

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-1 Kasuga-Kouen, 816-8580, Kasuga, Fukuoka, Japan

    Miyuki Koshimura & Ryuzo Hasegawa

Authors
  1. Miyuki Koshimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ryuzo Hasegawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS, Université de Paris 7, case 7012, 2 place Jussieu, 75251, Paris Cedex 05, France

    Michel Parigot

  2. Computer Science Department, University of Manchester, Oxford Rd, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koshimura, M., Hasegawa, R. (2000). Proof Simplification for Model Generation and Its Applications. In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44404-1_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41285-4

  • Online ISBN: 978-3-540-44404-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation