4513 search results - page 289 / 903 » Logic programming with satisfiability |
142
click to vote
JLP
2000
15 years 4 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...
115
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A coded modulation system is considered in which nonbinary coded symbols are mapped directly to nonbinary modulation signals. It is proved that if the modulator-channel combination...
116
click to vote
DEXAW
2008
IEEE
15 years 10 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...
134
click to vote
ENTCS
2006
15 years 4 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 ...
183
click to vote
PLDI
2011
ACM
14 years 7 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...