Abstract
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constraints. Hard constraints must hold while soft constraints may be violated but as many as possible should be satisfied. Although the problem constraints can be divided into two groups, the order in which these constraints are studied can improve efficiency, particulary in problems with non-binary constraints. In this paper, we carry out a classification of hard and soft constraints in order to study the tightest hard constraints first and to obtain ever better solutions. In this way, inconsistencies can be found earlier and the number of constraint checks can be significantly reduced.
This work has been supported by the grant DPI2001-2094-C03-03 from the Spanish Government.
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
Barták, R.: Constraint programming: In pursuit of the holy grail. In: Proceedings of WDS 1999 (invited lecture), Prague (June 1999)
Bessière, C., Meseguer, P., Freuder, E.C., Larrosa, J.: On forward checking for non-binary constraint satisfaction. Artifical Intelligence, 205–224 (2002)
Bitner, J.R., Reingold, E.M.: Backtracking programming techniques. Communications of the ACM 18, 651–655 (1975)
Gent, I.P., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of arc consistency. Principles and Practice of Constraint Programming, 327–340 (1997)
Haralick, R.M., Elliot, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Kumar, V.: Depth first search. In Encyclopedia of Artificial Intelligence 2, 1004–1005 (1987)
Kumar, V.: Algorithms for constraint satisfaction problems: a survey. Artificial Intelligence Magazine 1, 32–44 (1992)
Salido, M.A., Barber, F.: A polynomial algorithm for continuous non-binary disjunctive CSPs: extended DLRs. Knowledge-Based Systems 16 (2003) (in press)
Tsang, E.: Foundation of Constraint Satisfaction. Academic Press, London (1993)
Wallace, R., Freuder, E.: Ordering heuristics for arc consistency algorithms. In: Proc. of Ninth Canad. Conf. on A.I., pp. 163–169 (1992)
Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The distributed constraint satisfaction problem: Formalization and algorithms. Knowledge and Data Engineering, 673–685 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salido, M.A., Barber, F. (2004). Distributed Non-binary Constraints. In: Conejo, R., Urretavizcaya, M., Pérez-de-la-Cruz, JL. (eds) Current Topics in Artificial Intelligence. TTIA 2003. Lecture Notes in Computer Science(), vol 3040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25945-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-25945-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22218-7
Online ISBN: 978-3-540-25945-9
eBook Packages: Springer Book Archive