Sciweavers

942 search results - page 4 / 189
» Cooperating Constraint Solvers
Sort
View
SLP
1993
117views more  SLP 1993»
13 years 8 months ago
Boolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
Philippe Codognet, Daniel Diaz
SAC
2002
ACM
13 years 6 months ago
Soft constraint propagation and solving in CHRs
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
CI
2004
85views more  CI 2004»
13 years 6 months ago
Soft Constraint Propagation and Solving in Constraint Handling Rules
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
CONSTRAINTS
2002
143views more  CONSTRAINTS 2002»
13 years 6 months ago
A Constraint-Based Robotic Soccer Team
It is a challenging task for a team of multiple fast-moving robots to cooperate with each other and to compete with another team in a dynamic, real-time environment. For a robot te...
Yu Zhang, Alan K. Mackworth
PLILP
1994
Springer
13 years 10 months ago
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation meth...
Philippe Codognet, Daniel Diaz