A sequent calculus and a theorem prover for standard conditional logics (original) (raw)
Related papers
Sequent Calculi with Context Restrictions and Applications to Conditional Logic
2013
Nested sequent calculi and theorem proving for normal conditional logics
2013
Implementation of a cut-free sequent calculus for logics with adjoint modalities
University of St Andrews, …, 2009
Theorem proving for conditional logics: CondLean and GOALD U CK
Journal of Applied Non-Classical Logics, 2008
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Lecture Notes in Computer Science, 2007
Automated Reasoning, 2006
Automated Reasoning for Conditional Logics: the Theorem Prover Condlean 3.1
Proof analysis in intermediate logics
2012
Proof search in first-order linear logic and other cut-free sequent calculi
Cut-free Ordinary Sequent Calculi for Logics Having Finite-Valued Semantics
2006
NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics
Lecture Notes in Computer Science, 2014
Nested sequent calculi for normal conditional logics
Journal of Logic and Computation, 2013
Nested sequent calculi for conditional logics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012
A sequent calculus with procedure calls
ArXiv, 2012
Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics
Logica Universalis, 2007
Proofs You Can Believe In Proving Equivalences Between Prolog Semantics in Coq
2014
A Goal-Directed Calculus for Standard Conditional Logics
Proving Structural Properties of Sequent Systems in Rewriting Logic
Rewriting Logic and Its Applications, 2018
Proof Manipulations for Logic Programming Proof Systems
2001
A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
Logic Journal of IGPL, 1999
Cuts and Cut-Elimination for Complementary Classical Logic
SEQUENT SYSTEMS FOR MODAL LOGICS
Cut-free Sequent Calculi for C-systems with Generalized Finite-valued Semantics
A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene
2002
The Cut Elimination and the Nonlengthening Property for the Sequent Calculus with Equality
2017
A Formalisation of Weak Normalisation (With Respect to Permutations) of Sequent Calculus Proofs
1999
Prolog technology for default reasoning: proof theory and compilation techniques
Artificial Intelligence, 1998
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic
Studia Logica, 1998
Theoretical Computer Science, 2002
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), 2005