226 search results - page 9 / 46 » GAC on Conjunctions of Constraints |
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
TCS
1998
13 years 7 months ago
1998
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expres...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
CP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...