7092 search results - page 491 / 1419 » Parallelizing constraint programs |
152
click to vote
CSR
2009
Springer
15 years 5 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
134
click to vote
CP
2010
Springer
15 years 2 months ago
2010
Springer
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...
138
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
143
click to vote
PPDP
1999
Springer
15 years 8 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
154
click to vote
LOPSTR
1997
Springer
15 years 8 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...