6978 search results - page 138 / 1396 » On Proofs in System P |
141
click to vote
LICS
2007
IEEE
16 years 22 days ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
139
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
146
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
188
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
161
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...