Sciweavers

514 search results - page 2 / 103
» Foundations of Aggregation Constraints
Sort
View

Book
357views
15 years 4 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
LICS
1994
IEEE
13 years 10 months ago
Foundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 4 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
LOPSTR
2007
Springer
14 years 3 days ago
Aggregates for CHR through Program Transformation
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...
Peter Van Weert, Jon Sneyers, Bart Demoen
COR
2008
112views more  COR 2008»
13 years 6 months ago
Bi-dynamic constraint aggregation and subproblem reduction
Dynamic constraint aggregation was recently introduced by Elhallaoui et al. [Dynamic aggregation of set partitioning constraints in column generation. Operations Research 2005; 53...
Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib...