1144 search results - page 131 / 229 » Logic programming for combinatorial problems |
110
click to vote
MASCOTS
2003
15 years 3 months ago
2003
The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response t...
173
Voted
ICLP
2011
Springer
14 years 6 months ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
124
click to vote
ISSTA
2004
ACM
15 years 8 months ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
214
click to vote
TOPLAS
2008
15 years 2 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
102
click to vote
CADE
2008
Springer
16 years 2 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...