CondLean 3.0: Improving CondLean for stronger conditional logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3702 LNAI, Issue , 2005, Pages 328-332

  Olivetti, Nicola ^a   Pozzato, Gian Luca ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHICAL USER INTERFACES; JAVA PROGRAMMING LANGUAGE;

CONDLEAN 3.0 THEOREM PROVER; PREPOSITIONAL CONDITIONAL LOGICS; SICSTUS PROLOG;

FORMAL LOGIC;

EID: 33646197717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554554_27     Document Type: Conference Paper

References (7)

1. N. Olivetti and C. B. Schwind. A calculus and complexity bound for minimal conditional logic. Proc. ICTCS01, vol LNCS 2202, pages 384-404, 2001.
2. N. Olivetti, G. L. Pozzato, and C. B. Schwind. A sequent calculus and a theorem prover for standard conditional logics: Extended version. Technical Report 87/05, Dip. di Information, Università degli Studi di Torino, available at www.di.unito.it/~pozzato/condlean3, 2005.
3. N. Olivetti and G. L. Pozzato. Condlean: A theorem prover for conditional logics. In Proc. of TABLEAUX 2003 (Automated Reasoning with Analytic Tableaux and Related Methods), volume 2796 of LNAI, Springer, pages 264-270, 2003.
4. B. Beckert and R. Gorè. Free variable tableaux for propositional modal logics. Tableaux-97, LNCS 1227, Springer, pages 91-106, 1997.
5. D. Nute. Topics in conditional logic. Reidel, 1980.
6. B. Beckert and J. Posegga. leantap: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3), pages 339-358, 1995.
7. M. Fitting, leantap revisited. J. of Logic and Computation, 8(1), pages 33-47, 1998.