Access the full text.
Sign up today, get DeepDyve free for 14 days.
Tjark Weber (2008)
SAT-based finite model generation for higher-order logic
BF Chellas (1980)
Modal Logic: An Introduction
Peter Andrews (1972)
General models and extensionalityJournal of Symbolic Logic, 37
Valerio Genovese, Laura Giordano, Valentina Gliozzi, G. Pozzato (2010)
A constructive conditional logic for access control: a preliminary report
G. Sutcliffe (2009)
The TPTP Problem Library and Associated InfrastructureJournal of Automated Reasoning, 43
G. Pozzato (2010)
Conditional and Preferential Logics: Proof Methods and Theorem Proving, 208
Lutz Schröder, D. Pattinson, D. Hausmann (2010)
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
A. Church (1940)
A formulation of the simple theory of typesJournal of Symbolic Logic, 5
Peter Andrews, Matthew Bishop, S. Issar, Dan Nesmith, F. Pfenning, H. Xi (1996)
TPS: A theorem-proving system for classical type theoryJournal of Automated Reasoning, 16
(2008)
LEO-II — A cooperative automatic theorem prover for higher-order logic
N. Olivetti, G. Pozzato, C. Schwind (2004)
A Sequent Calculus and Theorem Prover for Standard Conditional Logics
Satallax (version 1.4). A higher-order automated theorem prover based on a complete ground tableau calculus for HOL with a choice operator [4]
T. Nipkow, M. Wenzel, Lawrence Paulson (2002)
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
G. Crocco, Philippe Lamarre (1992)
On the Connection between Non-monotonic Inference Systems and Conditional Logics
IsabelleP (version 2009-2). The proof assistant Isabelle/HOL
Christoph Benzmüller, Lawrence Paulson (2010)
Multimodal and intuitionistic logics in simple type theoryLog. J. IGPL, 18
J. Blanchette, T. Nipkow (2010)
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
Craig Boutilier (1994)
Conditional Logics of Normality: A Modal ApproachArtif. Intell., 68
N. Olivetti, G. Pozzato (2008)
Theorem proving for conditional logics: CondLean and GOALDUCKJournal of Applied Non-Classical Logics, 18
R Stalnaker (1968)
Studies in Logical Theory, American Philosophical Quarterly, Monograph Series no.2
CEM ( ∀ A, B. vld ⌊ ( A ⇒ B ) ∨ ( A ⇒ ¬ B ) ⌋ ) ↔ ( ∀ A, W. ( f W A ) = ∅ ∨ ∃ V. ( f W A ) = ( λX.X = V ))
Julian Backes, C. Brown (2010)
Analytic Tableaux for Higher-Order Logic with ChoiceJournal of Automated Reasoning, 47
Thomas Raths, J. Otten (2011)
Implementing and Evaluating Theorem Provers for First-Order Modal Logics
(1968)
A theory of conditionals Rescher, editor, Studies in Logical Theory
G. Sutcliffe, Christoph Benzmüller (2010)
Automated Reasoning in Higher-Order Logic using the TPTP THF InfrastructureJ. Formaliz. Reason., 3
Christoph Benzmüller, Peter Andrews (2006)
Church’s Type TheoryStanford Encyclopedia of Philosophy
Refute and Nitpick (versions
D. Nute (1980)
Topics in Conditional Logic
Christoph Benzmüller (2010)
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and about conditional logics.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Sep 25, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.