Skip to main content

Improvements to the Tableau Prover PITP

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2007)

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

  • 386 Accesses

Abstract

In this paper we discuss the new version of PITP, a procedure to decide propositional intuitionistic logic, which turns out at the moment to be the best propositional prover on ILTP. The changes in the strategy and implementation make the new version of PITP faster and capable of deciding more formulas than the previous one. We give a short account both of the old optimizations and the changes in the strategy with respect to the previous version. We use ILTP library and random generated formulas to compare the implementation described in this paper to the other provers (including our old version of PITP).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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.

Similar content being viewed by others

References

  1. Avellone, A., Ferrari, M., Fiorentini, C., Fiorino, G., Moscato, U.: Esbc: an application for computing stabilization bounds. ENTCS 153(1), 23–33 (2006)

    Google Scholar 

  2. Avellone, A., Fiorino, G., Moscato, U.: A parallel implementation of a decision procedure for propositional intuitionistic logic. In: Mayer, M.C., Pirri, F. (eds.) TABLEAUX, POSITION PAPERS AND TUTORIALS (2003)

    Google Scholar 

  3. Avellone, A., Fiorino, G., Moscato, U.: A new O(n lg n)-space decision procedure for propositional intuitionistic logic. In: Baaz, A. V. M., Makowsky, J. (eds.), volume VIII of Kurt Gödel Society, Collegium Logicum, pp. 17–33 (2004)

    Google Scholar 

  4. Avellone, A., Fiorino, G., Moscato, U.: A Tableau Decision Procedure for Propositional Intuitionistic Logic. In Proceedings of the 6th International Workshop on the Implementation of Logic, of CEUR Workshop Proceedings, vol. 212, pp. 64–79 (2006)

    Google Scholar 

  5. Avellone, A., Fiorentini, C., Fiorino, G., Moscato, U.: A space efficient implementation of a tableau calculus for a logic with a constructive negation. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 488–502. Springer, Heidelberg (2004)

    Google Scholar 

  6. Avellone, A., Fiorino, G., Moscato, U.: Optimization techniques for propositional intuitionistic logic and their implementation. submitted to JAL (2007), http://www.dimequant.unimib.it/PITP/index.html

  7. Constable, R. (ed.): Implementing Mathematics with the Nuprl Proof Development System. Prentice–Hall, Englewood Cliffs, New Jersey (1986)

    Google Scholar 

  8. Egly, U., Schmitt, S.: On intuitionistic proof transformations, their complexity, and application to constructive program synthesis. Fundam. Inform. 39(1-2), 59–83 (1999)

    MATH  MathSciNet  Google Scholar 

  9. Fiorino, G.: Decision procedures for propositional intermediate logics. PhD thesis, Dipartimento di Scienze dell’Informazione, Universita’ degli Studi di Milano, Italy (2001)

    Google Scholar 

  10. Hähnle, R.: Tableaux and related methods. Handbook of Automated Reasoning, pp. 100–178. Elsevier and MIT Press (2001)

    Google Scholar 

  11. Horrocks, I.: Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester (1997)

    Google Scholar 

  12. Larchey-Wendling, D., Méry, D., Galmiche, D.: Strip: Structural sharing for efficient proof-search. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 696–700. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Massacci, F.: Simplification: A general constraint propagation technique for propositional and modal tableaux. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 217–232. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Mendler, M.: Timing analysis of combinational circuits in intuitionistic propositional logic. Formal Methods in System Design 17(1), 5–37 (2000)

    Article  Google Scholar 

  15. Raths, T., Otten, J., Kreitz, C.: The ILTP problem library for intuitionistic logic. release v1.1. To appear in JAR (2006)

    Google Scholar 

  16. Sahlin, D., Franzén, T., Haridi, S.: An intuitionistic predicate logic theorem prover. J. Log. Comput. 2(5), 619–656 (1992)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Nicola Olivetti

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avellone, A., Fiorino, G., Moscato, U. (2007). Improvements to the Tableau Prover PITP. In: Olivetti, N. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2007. Lecture Notes in Computer Science(), vol 4548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73099-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73099-6_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73098-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics