6554 search results - page 382 / 1311 » Constraint Logic Programming |
171
click to vote
JLP
2000
15 years 6 months ago
2000
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
148
click to vote
DEXAW
2008
IEEE
16 years 1 months ago
2008
IEEE
Today’s high-speed network allows sophisticated applications of overlay networks. Meanwhile, usage of multicore processors has been spreading. The level of concurrency we need t...
171
click to vote
ENTCS
2006
15 years 6 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
219
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
156
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...