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.
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
Cha, B., Iwama, K.: Performance test of local search algorithms using new types of random CNF formulas. In: Proceedings of IJCAI 1995, pp. 304–310 (1995)
Davenport, A., Tsang, E., Wang, C., Zhu, K.: GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. In: Proceedings of AAAI 1994, pp. 325–330 (1994)
Frank, J.: Weighting for Godot: Learning heuristics for GSAT. In: Proceedings of AAAI 1996, pp. 338–343 (1996)
Frank, J.: Learning short-term weights for GSAT. In: Proceedings of IJCAI 1997, pp. 384–389 (1997)
Gent, I., Walsh, T.: Towards an Understanding of Hill-climbing Procedures for SAT. In: Proceedings of AAAI 1993, pp. 28–33 (1993)
Kumar, V.: Algorithms for constraint satisfaction problems: a survey. AI Magazine, 32–43 (Spring 1992)
Mackworth, A.: Consistency in networks of relations. Artificial Intelligence 8(1), 99–118 (1977)
McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of AAAI 1997, pp. 321–326 (1997)
Morris, P.: The Breakout method for escaping from local minima. In: Proceedings of AAAI 1993, pp. 40–45 (1993)
Prosser, P.: An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence 81(1-2), 81–111 (1996)
Selman, B., Levesque, H., McAllester, D.: A new method for solving hard satisfiability problems. In: Proceedings of AAAI 1992, pp. 440–446 (1992)
Selman, B., Kautz, H.: Domain-independent extensions to GSAT: solving large structured satisfiability problems. In: Proceedings of IJCAI 1993, pp. 290–295 (1993)
Selman, B., Kautz, H., McAllester, D.: Ten challenges in propositional reasoning and search. In: Proceedings of IJCAI 1997, pp. 50–54 (1997)
Thornton, J., Sattar, A.: Dynamic Constraint Weighting for Over-Constrained Problems. In: Proceedings of PRICAI 1998, pp. 377–388 (1998)
Voudouris, C., Tsang, E.: Partial Constraint Satisfaction Problems and Guided Local Search. In: Proceedings of Practical Application of Constraint Technology (PACT 1996), pp. 337–356 (1996)
Walser, J., Iyer, R., Venkatasubramanyan, N.: An integer local search method with application to capacitated production planning. In: Proceedings of AAAI 1998, pp. 373–379 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thornton, J., Sattar, A. (1999). On the Behavior and Application of Constraint Weighting. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive