1228 search results - page 11 / 246 » Continuations, proofs and tests |
ENTCS
2007
13 years 7 months ago
2007
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
ASE
2006
13 years 8 months ago
2006
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
COCO
2003
Springer
14 years 1 months ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
VC
2008
13 years 7 months ago
2008
We present an efficient approach to reduce the number of elementary tests for continuous collision detection between rigid and deformable models. Our algorithm exploits the connect...