3552 search results - page 253 / 711 » Proof theory in the abstract |
183
click to vote
AIIA
2003
Springer
16 years 20 days ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
193
click to vote
WOLLIC
2010
Springer
16 years 14 days ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
177
click to vote
FOCS
2002
IEEE
16 years 11 days ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
211
click to vote
CSR
2010
Springer
16 years 7 days ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
216
click to vote
CONCUR
2009
Springer
16 years 1 days ago
2009
Springer
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...