4850 search results - page 185 / 970 » Proof and Computation in Geometry |
178
click to vote
ICALP
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
157
click to vote
IMAGING
2004
15 years 8 months ago
2004
A display tool has been developed to perform simulation and three-dimensional rendering of prints in the quest towards achieving improved soft proofing capabilities. It was desire...
180
click to vote
ASM
2010
ASM
16 years 3 months ago
2010
ASM
The activities of formal modelling and reasoning are closely related. But while the rigour of building formal models brings significant benefits, formal reasoning remains a major...
189
click to vote
LICS
2008
IEEE
16 years 27 days ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
144
click to vote
LICS
2007
IEEE
16 years 24 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...