40 search results - page 4 / 8 » Compressing Propositional Refutations |
141
Voted
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
129
Voted
CIE
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
130
Voted
TAMC
2010
Springer
15 years 8 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
138
Voted
BVAI
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...
130
Voted
CSL
2007
Springer
15 years 9 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...