Abstract
Nogood stores are frequently used to avoid revisiting states that were previously discovered to be inconsistent. In this paper we consider the usefulness of learned nogoods as a heuristic to guide search. In particular, we look at learning nogoods probabilistically and examine heuristic utility of such nogoods. We define how probabilistic nogoods can be derived from real nogoods and then introduce an approximate implementation. This implementation is used to compare behavior of heuristics using classic nogoods and then probabilistic nogoods on random binary CSPs and QWH problems. Empirical results show improvement in both problem domains over original heuristics.
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
Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, pp. 146–150 (2004)
Cambazard, H., Jussien, N.: Identifying and exploiting problem structures using explanation-based constraint programming. Constraints 11(4), 295–313 (2006)
Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: Flaws and structure (1998)
Gomes, C.P., Shmoys, D.: Completing quasigroups or latin squares: A structured graph coloring problem. In: Proc. Computational Symposium on Graph Coloring and Generalizations (2002)
Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14(3), 263–313 (1980)
Horsch, M.C., Havens, W.S.: Probabilistic arc consistency: A connection between constraint reasoning and probabilistic reasoning. In: UAI 2000: Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, pp. 282–290. Morgan Kaufmann Publishers Inc., San Francisco (2000)
Katsirelos, G., Bacchus, F.: Unrestricted nogood recording in csp search (2003)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference, DAC 2001 (2001)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
Prosser, P.: MAC-CBJ: maintaining arc consistency with conflict-directed backjumping. Technical Report Research Report/95/177, Dept. of Computer Science, University of Strathclyde (1995)
Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9(3), 268–299 (1993)
Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004)
Sussman, G.J., Stallman, R.M.: Forward reasoning and dependency directed backtracking in a system for computer aided circuit analysis. Artificial Intelligence 9, 135–196 (1977)
Vernooy, M., Havens, W.S.: An examination of probabilistic value-ordering heuristics. In: Australian Joint Conference on Artificial Intelligence, pp. 340–352 (1999)
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
Missine, A., Havens, W.S. (2008). Probabilistic Nogood Store as a Heuristic. 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_71
Download citation
DOI: https://doi.org/10.1007/978-3-540-89197-0_71
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)