Automated Reasoning for Conditional Logics: the Theorem Prover Condlean 3.1

&
In Jean-Yves Béziau & Alexandre Costa-Leite (eds.), Perspectives on Universal Logic. Milan, Italy: Polimetrica (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,665

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Theorem proving for conditional logics: CondLean and GOALD U CK.Nicola Olivetti & Gian Luca Pozzato - 2008 - Journal of Applied Non-Classical Logics 18 (4):427-473.
Reasoning about conditional probabilities in a higher-order-logic theorem prover.Osman Hasan & Sofiène Tahar - 2011 - Journal of Applied Logic 9 (1):23-40.
Effective Higher-Order Automated Theorem Proving with integrated Descente Infinie and Presburger Arithmetic LEO-III.Benzmüller Christoph & Wirth Claus-Peter - 2009
Equality and Extensionality in Higher-Order Theorem Proving.Benzmüller Christoph - 1999 - Dissertation, Naturwissenschaftlich-Technische Fakultät I, Saarland University, Saarbrücken, Germany
Automated deduction in a graphical temporal logic.L. E. Moser, P. M. Melliar-Smith, Y. S. Ramakrishna, G. Kutty & L. K. Dillon - 1996 - Journal of Applied Non-Classical Logics 6 (1):29-47.
The Higher-Order Prover LEO-II.Christoph Benzmüller, Nik Sultana, Lawrence C. Paulson & Frank Theiß - 2015 - Journal of Automated Reasoning 55 (4):389-404.
Embedding and Automating Conditional Logics in Classical Higher-Order Logic.Christoph Benzmüller, Dov Gabbay, Valerio Genovese & Daniele Rispoli - 2012 - Annals of Mathematics and Artificial Intelligence 66 (1-4):257-271.
16TaP: A Toy Tableau Theorem Prover for 16-Valued Trilattice Logics.Reinhard Muskens - 2017 - A Programming Road to Logic, Maths, Language, and Philosophy : A Tribute to Jan van Eijck on the Occasion of His Retirement.
Verifying the Modal Logic Cube is an Easy Task.Christoph Benzmüller - 2010 - In Simon Siegler & Nathan Wasser (eds.), Verification, Induction, Termination Analysis - Festschrift for Christoph Walther on the Occasion of His 60th Birthday. Springer. pp. 117-128.

Analytics

Added to PP
2014-01-30

Downloads
33 (#672,560)

6 months
2 (#1,693,267)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references