Abstract
We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitment to variable assignment of local search. Our method backtracks through a space of complete but possibly inconsistent solutions while supporting the freedom to move arbitrarily under heuristic guidance. The version of the schema described here combines minconflicts local search with conflict-directed backjumping. It is parametrized by a variable ordering relation which controls the order in which the search space is explored. Preliminary experimental results are given comparing two instances of the schema to forward checking with conflict-directed backjumping [17] (FC-CBJ).
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
Bayardo, R., Miranker, D.: A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem. In: Proc. AAAI 1996, pp. 298–304 (1996)
Bistarelli, S., Montanari, U., Rossi, F.: Constraint Solving over Semirings. In: Proc. IJCAI 1995, Morgan Kaufmann, San Francisco (1995)
Clark, D.A., Frank, J., Gent, I.P., MacIntyre, E., Tomov, N., Walsh, T.: Local Search and the Number of Solutions. In: Proc. Principles and Practice of Constraint Programming, pp. 119–133 (1996)
Freuder, E.C., Wallace, R.J.: Partial Constraint Satisfaction. Artificial Intelligence 58, 21–70 (1992)
Gaschnig, J.: Performance measurement and analysis of certain search algorithms. Tech. report CMU-CS-79-124, Carnegie-Mellon University (1979)
Ginsberg, M.L.: Dynamic backtracking. Journal of Aritificial Intelligence Research 1, 25–46 (1993)
Ginsberg, M.L., McAllester, D.A.: GSAT and dynamic backtracking. In: Proc. 4th Int. Conf. on Principles of Knowledge Representation and Reasoning (1994)
Glover, F.: Tabu search: a tutorial. Interfaces 20(74-94) (1990)
Gomes, C., Selman, B., Kautz, H.: Boosting Combinatorial Search through Randomization. In: Proc. Fifteenth National Conference on Artificial Intelligence, Madison, WI, pp. 431–437. AAAI Press, Menlo Park (1998)
Havens, W.S.: NoGood Caching for MultiAgent Backtrack Search. In: Proc. AAAI 1997 Constraints and Agents Workshop (1997)
Jussein, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139, 21–45 (2002)
Kumar, V.: Algorithms for constraint satisfaction problems - a survey. AI Magazine 13(32-44) (1992)
Lynce, I., Baptista, L., Marques-Silva, J.P.: Stochastic Systematic Search Algorithms for Satisfiability. In: LICS Workshop on Theory and Applications of Satisfiability Testing (LICS-SAT) (June 2001)
Minton, S., Johnston, M., Phillips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58, 161–205 (1990)
Morris, P.: The breakout method for escaping from local minima. In: Proc. AAAI 1993, pp. 40–45 (1993)
Prestwich, S.: Local Search and Backtracking vs Non-Systematic Backtracking. In: Proc. AAAI 2001 Fall Symposium on Using Uncertainty within Computation. (2001)
Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence 9(3), 269–xxx (199x)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proc. 10th National Conf. on Artificial Intelligence, pp. 440–446 (1992)
Stallman, R.M., Sussman, G.J.: Forward reasoning and dependencydirected backtracking in a system for computer-aided circuit analysis. Artificial Intelligence 9, 135–196 (1977)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1994)
Yokoo, M.: Weak commitment search for solving constraint satisfaction problems. In: Proc. AAAI 1994, pp. 313–318 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Havens, W.S., Dilkina, B.N. (2004). A Hybrid Schema for Systematic Local Search. In: Tawfik, A.Y., Goodwin, S.D. (eds) Advances in Artificial Intelligence. Canadian AI 2004. Lecture Notes in Computer Science(), vol 3060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24840-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-24840-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22004-6
Online ISBN: 978-3-540-24840-8
eBook Packages: Springer Book Archive