207 search results - page 19 / 42 » Proof Systems and Transformation Games |
158
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
136
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...
167
click to vote
CA
1998
IEEE
15 years 10 months ago
1998
IEEE
A vision based technique for nonrigid control is presented that can be used for animation and video game applications. The user grasps a soft, squishable object in front of a came...
146
click to vote
ENTCS
2007
15 years 6 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
191
click to vote
FORMATS
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...