by Miguel A. Salido, Adriana Giret, Federico Barber, Informaticos Computacion
Proc. of CP-2002 Workshop on Cooperative Solvers in Constraint Programming
http://www.dsic.upv.es/users/ia/gps/papers/papers/cp-workshop.ps
Add To MetaCart
Abstract:
Abstract. Nowadays, many researchers are working on Constraint Satisfaction Problems (CSPs). Combination of AI/OR methods is gaining a great deal of attention because many real problems can be e#ciently modelled as CSPs and they can be solved by means of combined AI/OR techniques. Many CSPs can be modelled as discrete and non-binary CSPs and, theoretically, they can be transformed into an equivalent binary one, using some of the current techniques. However, this transformation may be an inadequate or ine#cient way to manage certain types of non-binary constraints. In this paper, we present a CSP solver called DisHSA that manages discrete and non-binary CSPs by means of Operational Research techniques like linear programming in order to manage discrete CSPs with very large domains. DisHSA, is a CSP solver that carries out a cooperation by means of the integration of CSPs and linear programming techniques.
Citations
|
629
|
Foundations of Constraint Satisfaction
– Tsang
- 1993
|
|
148
|
Consistency Techniques for Numeric CSPs
– L’homme
- 1993
|
|
70
|
On the conversion between non-binary and binary constraint satisfaction problems
– Bacchus, Beek
- 1998
|
|
70
|
On the equivalence of constraint satisfaction problems
– Rossi, Petrie, et al.
- 1990
|
|
50
|
On forward checking for non-binary constraint satisfaction
– Bessière, Meseguer, et al.
- 1999
|
|
50
|
A su cient condition for backtrack-free search
– Freuder
|
|
6
|
Algorithms and Heuristics for Total and Partial Constraint Satisfaction
– Larrosa
- 1998
|
|
4
|
A non-binary constraint satisfaction solver: The One-Face Hyperpolyhedron Heuristic
– Salido, Giret, et al.
- 2001
|
|
3
|
Non-Binary Constraints
– Bessire
- 1999
|
|
3
|
Polysa: A polinomial algorithm for non-binary constraint satisfaction problems with <= and
– Salido, Barber
- 2001
|
|
3
|
Constraint satisfaction by means of dynamic polyhedra
– Salido, Giret, et al.
- 2002
|
|
1
|
Disjunction of Non-Binary and Numeric CSPs', To appear
– Salido, Barber
- 2002
|
