Skip to main content

CondLean 3.0: Improving CondLean for Stronger Conditional Logics

  • Conference paper

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

Abstract

In this paper we present CondLean 3.0, a theorem prover for propositional conditional logics CK, CK+ID, CK+MP, CK+CS, CK+CEM and some of their combinations. CondLean 3.0 implements sequent calculi for these logics. CondLean 3.0 improves CondLean and is developed following the methodology of leanTAP. It is implemented in SICStus Prolog and also comprises a graphical user interface implemented in JAVA. CondLean 3.0 can be downloaded at www.di.unito.it/~pozzato/condlean3/

Keywords

  • Selection Function
  • Theorem Prover
  • Sequent Calculus
  • Transition Formula
  • Proof Tree

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11554554_27
  • Chapter length: 5 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   84.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-31822-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Olivetti, N., Schwind, C.B.: A calculus and complexity bound for minimal conditional logic. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 384–404. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  2. Olivetti, N., Pozzato, G.L., Schwind, C.B.: A sequent calculus and a theorem prover for standard conditional logics: Extended version. Technical Report 87/05, Dip. di Informatica, Università degli Studi di Torino (2005), available at http://www.di.unito.it/~pozzato/condlean3

  3. Olivetti, N., Pozzato, G.L.: Condlean: A theorem prover for conditional logics. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS (LNAI), vol. 2796, pp. 264–270. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  4. Beckert, B., Gorè, R.: Free variable tableaux for propositional modal logics. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol. 1227, pp. 91–106. Springer, Heidelberg (1997)

    CrossRef  Google Scholar 

  5. Nute, D.: Topics in conditional logic. Reidel, Dordrechtz (1980)

    MATH  Google Scholar 

  6. Beckert, B., Posegga, J.: leantap: Lean tableau-based deduction. Journal of Automated Reasoning 15(3), 339–358 (1995)

    MATH  CrossRef  MathSciNet  Google Scholar 

  7. Fitting, M.: leantap revisited. J. of Logic and Computation 8(1), 33–47 (1998)

    MATH  CrossRef  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Olivetti, N., Pozzato, G.L. (2005). CondLean 3.0: Improving CondLean for Stronger Conditional Logics. In: Beckert, B. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2005. Lecture Notes in Computer Science(), vol 3702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554554_27

Download citation

  • DOI: https://doi.org/10.1007/11554554_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31822-4

  • eBook Packages: Computer ScienceComputer Science (R0)