12774 search results - page 68 / 2555 » A Framework for Proof Systems |
INFORMATICALT
2010
13 years 7 months ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veriļ...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
BIRTHDAY
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
CC
2008
Springer
13 years 9 months ago
2008
Springer
We introduce an algebraic proof system that manipulates multilinear arithmetic formulas. We show that this proof system is fairly strong, even when restricted to multilinear arith...
CORR
2011
Springer
13 years 20 days ago
2011
Springer
We deļ¬ne a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...