Abstract
The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. Considerable research has been done in solving SCSPs, but limited work has been done in building general SCSP solvers. This paper is part of a series in which incremental changes are made to a branch and bound (BnB) algorithm for solving SCSPs. We present two variants of a BnB algorithm: a backjumping algorithm and a forward checking algorithm. These algorithms are based on the maximal constraints algorithms of Freuder and Wallace [1], and we show they perform better than the BnB algorithm on some problem instances.
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
Freuder, E.C., Wallace, J.W.: Partial constraint satisfaction. AI 58, 21–70 (1992)
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint solving and optimization. Journal of the ACM 44(2), 201–236 (1997)
Delgado, A., Olarte, C., Perez, J., Ruede, C.: Implementing semiring-based constraints using Mozart. In: Van Roy, P. (ed.) MOZ 2004. LNCS, vol. 3389, pp. 224–236. Springer, Heidelberg (2005)
Georget, Y., Codognet, P.: Compiling semiring-based constraint with clp(fd,s). In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 205. Springer, Heidelberg (1998)
Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and valued CSPs: Basic properties and comparison. Constraints 4, 199–240 (1999)
Bistarelli, S., Rossi, F., Pilan, I.: Abstracting soft constraints: Some experimental results on Fuzzy CSPs. In: Proceedings of CLCSP 2003 (2003)
Bistarelli, S., Fung, S., Lee, J., Leung, H.: A local search framework for semiring-based constraint satisfaction problems. In: Proceedings of Soft 2003 (2003)
Leenen, L., Anbulagan, A., Meyer, T., Ghose, A.K.: Modeling and solving semiring constraint satisfaction problems by transformation to weighted semiring max-SAT. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 202–212. Springer, Heidelberg (2007)
Gaschnig, J.: Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In: Proceedings of CCSCSI 1978 (1978)
Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leenen, L., Ghose, A. (2008). Branch and Bound Algorithms to Solve Semiring Constraint Satisfaction Problems. In: Ho, TB., Zhou, ZH. (eds) PRICAI 2008: Trends in Artificial Intelligence. PRICAI 2008. Lecture Notes in Computer Science(), vol 5351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89197-0_96
Download citation
DOI: https://doi.org/10.1007/978-3-540-89197-0_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89196-3
Online ISBN: 978-3-540-89197-0
eBook Packages: Computer ScienceComputer Science (R0)