3552 search results - page 203 / 711 » Proof theory in the abstract |
182
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdime...
164
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
148
click to vote
CORR
2011
Springer
15 years 27 days ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
148
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
181
click to vote
ISOLA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory...