28 search results - page 1 / 6 » Proof search and Co-NP completeness for many-valued logics |
CSL
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
CSL
2007
Springer
13 years 10 months ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
LPAR
2012
Springer
12 years 3 days ago
2012
Springer
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
CADE
2006
Springer
14 years 4 months ago
2006
Springer
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
TABLEAUX
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...