In this paper we present CondLean 3.1, a theorem prover for some standard conditional logics, namely CK, CK+ID, CK+MP, CK+CS, CK+CEM, and some of their combinations. CondLean 3.1 implements some sequent calculi for these logics, called SeqS, recently introduced. CondLean 3.1 also comprises a graphical user interface written in Java.
Automated Reasoning for Conditional Logics: the Theorem Prover CondLean 3.1
POZZATO, GIAN LUCA
2007-01-01
Abstract
In this paper we present CondLean 3.1, a theorem prover for some standard conditional logics, namely CK, CK+ID, CK+MP, CK+CS, CK+CEM, and some of their combinations. CondLean 3.1 implements some sequent calculi for these logics, called SeqS, recently introduced. CondLean 3.1 also comprises a graphical user interface written in Java.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
