351 search results - page 12 / 71 » Perfect Constraints Are Tractable |
ERSHOV
1999
Springer
13 years 12 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
MST
2008
13 years 7 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
JCO
2000
13 years 7 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
CP
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
AAAI
2000
13 years 9 months ago
2000
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...