Abstract
We present an abstract generalization of arc consistency which subsumes the definition of arc consistency in classical CSPs. Our generalization is based on the view of local consistency as technique for approximation of marginal solutions. These approximations are intended for use as heuristics during search. We show that this generalization leads to useful application in classical CSPs as well as non-classical CSPs such as MaxCSP, and instances of the Semi-ring CSP formalism developed by Bistarelli et al. [2]. We demonstrate the application ofthe theory by developing a novel algorithm for use in solving MaxCSP.
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
Preview
Unable to display preview. Download preview PDF.
References
S. Bistarelli, R. Gennari, and F. Rossi. Constraint propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, 2000.
S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaille, and H. Fargier. Semiring-Based CSPs and Valued CSPs: Frameworks, Properties and Comparison. Constraints, 4(3):199–240, 1999.
Rina Dechter and Judea Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence Journal, 34:1–34, 1988.
Ian Gent, Ewan MacIntyre, Patrick Prosser, Barbara Smith, and Toby Walsh. Random constraint satisfaction: Flaws and structure. Technical Report 98.23, University of Leeds, School of Computer Studies, 1998.
Michael C. Horsch and William S. Havens. An empirical evaluation of Probabilistic Arc Consistency as an variable ordering heuristic. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, pages 525–530, 2000.
Michael C. Horsch and William S. Havens. Probabilistic Arc Consistency: A connection between constraint reasoning and probabilistic reasoning. In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, pages 282–290, 2000.
Jin H. Kim and Judea Pearl. A computational model for causal and diagnostic reasoning in inference systems. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, pages 190–193, 1983.
Vipin Kumar. Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13(1):32–44, 1992.
Javier Larrossa, Pedro Meseguer, Thomas Schiex, and Gerard Verfaille. Reversible DAC and Other Improvements for Solving Max-CSP. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 1998.
Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence Journal, 8(1):99–118, 1977.
Kevin P. Murphy, Yair Weiss, and Michael I. Jordan. Loopy belief propagation for approximate inference: An empirical study. In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, pages 467–475, 1999.
B. Nadel. Tree search and arc consistency in constraint satisfaction problems. In L. Kanal and V. Kumar, editors, Search in Artificial Intelligence, pages 287–342. 1988.
Thomas Schiex. Arc consistency for soft constraints. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, pages 411–424, 2000.
Richard J. Wallace. Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction. In ECAI-94 Workshop on Constraint Processing, pages 69–77, 1994.
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
Horsch, M.C., Havens, W.S., Ghose, A.K. (2002). Generalized Arc Consistency with Application to MaxCSP. In: Cohen, R., Spencer, B. (eds) Advances in Artificial Intelligence. Canadian AI 2002. Lecture Notes in Computer Science(), vol 2338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47922-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-47922-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43724-6
Online ISBN: 978-3-540-47922-2
eBook Packages: Springer Book Archive