Abstract
In this work, we extend the class of Horn constraints to include disjunctions with an arbitrary number of linear inequalities, linear disequations and non-linear disequations. We propose a preprocess step in which two algorithms are carried out. The first algorithm called Constraint Selection Algorithm (CSA) translates the disjunctive non-binary CSP into a non-disjunctive one. This algorithm selects the more appropriate set of atomic constraints that is more likely to be consistent. The second algorithm called Constraint Ordering Algorithm (COA) classifies the resultant constraints from the most restricted to the least restricted one. Then, a CSP solver carries out the search through the non-disjunctive and ordered problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Koubarakis, M.: Tractable Disjunction of Linear Constraints. In Proceedings of Principles and Practice of Constraint Programming, CP-96, (1999) 297–307
Salido, M. A., Giret, A., Barber, F.: Constraint Satisfaction by means of Dynamic Polyhedra. In Operational Research Proceedings. Springer-Verlag, (2002) 405–412
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). Disjunctive and Continuous Constraint Satisfaction Problems. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_66
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive