199 search results - page 12 / 40 » Denotations for Classical Proofs - Preliminary Results |
DALT
2008
Springer
13 years 9 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
JMIV
2008
13 years 7 months ago
2008
We present new sampling theorems for surfaces and higher dimensional manifolds. The core of the proofs resides in triangulation results for manifolds with boundary, not necessarily...
AIPS
2007
13 years 10 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
IFM
2007
Springer
14 years 1 months ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...