CondLean: A Theorem Prover for Conditional Logics

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/