144 search results - page 2 / 29 » On meta complexity of propositional formulas and proposition... |
115
Voted
TAMC
2010
Springer
15 years 6 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 ...
81
Voted
JSYML
2008
15 years 1 months ago
2008
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
101
click to vote
ENTCS
2006
15 years 1 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
110
click to vote
ECCC
2007
15 years 1 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
94
Voted
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...