1144 search results - page 108 / 229 » Logic programming for combinatorial problems |
100
Voted
CPAIOR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and s...
118
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
140
Voted
FAC
2010
14 years 12 months ago
2010
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
126
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
134
click to vote
VSTTE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The Verifying Compiler checks the correctness of the program it compiles. The workhorse of such a tool is the reasoning engine, which decides validity of formulae in a su...