Branch and Bound Algorithms to Solve Semiring Constraint Satisfaction Problems

Authors:
Louise Leenen;Aditya Ghose
Affiliations:
Decision Systems Laboratory, SCSSE, University of Wollongong, Australia and CSIR, South Africa;Decision Systems Laboratory, SCSSE, University of Wollongong, Australia
Venue:
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Year:
2008

Citing 6
Cited 0

Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Compiling Semiring-Based Constraints with clp (FD, S)

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Modeling and solving semiring constraint satisfaction problems by transformation to weighted semiring Max-SAT

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Implementing semiring-based constraints using mozart

MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz

Quantified Score

Hi-index	0.00

Visualization

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.