351 search results - page 59 / 71 » Classical proof forestry |
DM
2008
13 years 7 months ago
2008
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
IPL
2008
13 years 7 months ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
COMPUTING
2007
13 years 7 months ago
2007
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...
JAIR
2008
13 years 7 months ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...