Skip to main content
SpringerLink
Log in

CondLean: A Theorem Prover for Conditional Logics

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

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

Abstract

In this paper we present CondLean, a theorem prover for propositional conditional logics CK, CK+ID, CK+MP and CK+MP+ID. The theorem prover implements some recently introduced sequent calculi for these logics. CondLean is developed following the methodology of leanTAP and it is implemented in SICStus Prolog. It also comprises a graphical user interface implemented in JAVA. CondLean can be downloaded at the site www.di.unito.it/ olivetti/CONDLEAN/

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. 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, p. 384. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Beckert, B., Goré, R.: Free Variable Tableaux for Propositional Modal Logics. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol. 1227. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Nute, D.: Topics in conditional logic. Reidel, Dordrecht (1980)

    MATH  Google Scholar 

  4. Pozzato, G.L.: Deduzione automatica per logiche condizionali: analisi e sviluppo di un theorem prover. Tesi di laurea, Informatica, Universit‘a di Torino (2003)

    Google Scholar 

  5. Beckert, B., Posegga, J.: leanTAP: Lean tableau-based deduction. Journal of Logic Programming 28 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, Italy

    Nicola Olivetti & Gian Luca Pozzato

Authors
  1. Nicola Olivetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gian Luca Pozzato
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università di Roma Tre, via Vasca Navale 79, 00146, Roma, Italia

    Marta Cialdea Mayer

  2. Dipartimento di Informatica e Sistemistica (DIS), Sapienza, University of Rome “Sapienza”, via Ariosto 25, 00185, Roma

    Fiora Pirri

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Olivetti, N., Pozzato, G.L. (2003). CondLean: A Theorem Prover for Conditional Logics. In: Cialdea Mayer, M., Pirri, F. (eds) Automated Reasoning with Analytic Tableaux and Related Methods . TABLEAUX 2003. Lecture Notes in Computer Science(), vol 2796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45206-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45206-5_23

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45206-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation