On the Behavior and Application of Constraint Weighting

Abstract

In this paper we compare the performance of three constraint weighting schemes with one of the latest and fastest WSAT heuristics: rnovelty. We extend previous results from satisfiability testing by looking at the broader domain of constraint satisfaction and test for differences in performance using randomly generated problems and problems based on realistic situations and assumptions. We find constraint weighting produces fairly consistent behaviour within problem domains, and is more influenced by the number and interconnectedness of constraints than the realism or randomness of a problem. We conclude that constraint weighting is better suited to smaller structured problems, where it is can clearly distinguish between different constraint groups.

DOI: 10.1007/978-3-540-48085-3_32

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Thornton1999OnTB, title={On the Behavior and Application of Constraint Weighting}, author={John Thornton and Abdul Sattar}, booktitle={CP}, year={1999} }