64 search results - page 6 / 13 » On the Proof Complexity of Deep Inference |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
LICS
2003
IEEE
14 years 1 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
WOLLIC
2009
Springer
14 years 3 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...