Abstract
Nowadays, many researchers are working on Constraint Satisfaction Problems (CSPs). Many CSPs can be modelled as non-binary CSPs and, theoretically, they can be transformed into an equivalent binary CSP, using some of the current techniques. However, this transformation may be an inadequate or inefficient way to manage certain types of non-binary constraints. In this paper, we propose an algorithm called DHSA that solves numeric non-binary CSPs with disjunctions in a natural way, as non-binary disjunctive CSP solver. This proposal extends the class of Horn constraint, originally studied by Koubarakis, since DHSA manages disjunctions of linear inequalities and disequations with any number of inequalities per disjunction. This proposal works on a polyhedron whose vertices are also polyhedra that represent the non-disjunctive problems. This non-binary disjunctive CSP solver translates, in a preprocess step, the disjunctive problem into a non-disjunctive one by means of a statistical preprocess step. Furthermore, a Constraint Ordering Algorithm (COA) classifies the resultant constraints from the most restricted to the least restricted one. This preprocess step can be applied to other disjunctive CSP solvers in order to find a solution earlier.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Bacchus and P. vanBeek, ‘On the conversion between non-binary and binary constraint satisfaction problems’, In proceeding of AAAI-98, 311–318, (1998).
R. Barták, ‘Constraint programming: In pursuit of the holy grail’, in Proceedings of WDS99 (invited lecture), Prague, June, (1999).
C. Bessiére, ‘Non-binary constraints’, In Proc. Principles and Practice of Constraint Programming (CP-99), 24–27, (1999).
C. Bessiére, P. Meseguer, E.C. Freuder, and J. Larrosa, ‘On forward checking for non-binary constraint satisfaction’, In Proc. Principles and Practice of Constraint Programming (CP-99), 88–102, (1999).
M. Koubarakis, ‘Tractable disjunction of linear constraints’, In Proc. 2nd International Conference on Principles and Practice of Constraint Programming (CP-96), 297–307, (1999).
J. Larrosa, Algorithms and Heuristics for total and partial Constraint Satisfaction, Phd Dissertation, UPC, Barcelona, 1998.
J.L. Lassez and K. McAloon, ‘A canonical form for generalizad linear constraints’, In Advanced Seminar on Foundations of Innovative Software Development, 19–27, (1989).
O. Lhomme, ‘Consistency techniques for numeric CSPs’, In International Joint Conference on Artificial Intelligence (IJCAI-93), 232–238, (1993).
F. Rossi, C. Petrie, and V. Dhar, ‘On the equivalence of constraint satisfaction problems’, In proceeding of European Conference of Artificial Intelligence, 550–556, (1990).
D. Sabin and E.C. Freuder, ‘Understanding and improving the MAC algorithm’, In proceeding of Principles and Practice of Constraint Programming, 167–181, (1997).
M.A. Salido and F. Barber, ‘An incremental and non-binary CSP solver: The Hyperpolyhedron Search Algorithm’, In Proc. of 7th International Conference on Principles and Practice of Constraint Programming (CP-01), LNCS 2239, 799–780, (2001).
M.A. Salido and F. Barber, ‘POLYSA: A polinomial algorithm for non-binary constraint satisfaction problems with ≦ and <>’, In Proceeding of EPIA-2001 Worshop on Constraint Satisfaction and Operation Research (CSOR01), 99–113, (2001).
M.A. Salido, A. Giret, and F. Barber, ‘Constraint satisfaction by means of dynamic polyhedra’, In Operational Research Proceedings 2001, Springer Verlag, 1, 405–412, (2001).
M.A. Salido, A. Giret, and F. Barber, ‘A non-binary constraint satisfaction solver: The One-Face Hyperpolyhedron Heuristic’, Research and Development in Intelligent Systems XVIII, Springer Verlag, 1, 313–324, (2001).
M.A. Salido, A. Giret, and F. Barber, ‘Integration of Discrete and Non-binary CSPs with Linear Programming Techniques’, To appear in Proc. of CP-2002 Workshop on Cooperative Solvers in Constraint Programming, (2002).
E. Sontag, ‘Real addition and the polynomial time hierarchy’, Information Processing Letter, 20, 115–120, (1985).
E. Tsang, Foundation of Constraint Satisfaction, Academic Press, London and San Diego, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salido, M.A., Barber, F. (2002). Disjunction of Non-binary and Numeric Constraint Satisfaction Problems. In: Escrig, M.T., Toledo, F., Golobardes, E. (eds) Topics in Artificial Intelligence. CCIA 2002. Lecture Notes in Computer Science(), vol 2504. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36079-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-36079-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00011-2
Online ISBN: 978-3-540-36079-7
eBook Packages: Springer Book Archive