188 search results - page 14 / 38 » Logic of Proofs for Bounded Arithmetic |
110
click to vote
SAT
2009
Springer
15 years 6 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
JSYML
2007
14 years 11 months ago
2007
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
279
click to vote
ACTA
2011
14 years 6 months ago
2011
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
128
click to vote
CADE
2012
Springer
13 years 2 months ago
2012
Springer
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
JAPLL
2010
14 years 10 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...