A Hybrid Schema for Systematic Local Search

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).

• Type: Conference
• Year: 2004
• Where: AI
• Authors: William S. Havens, Bistra N. Dilkina
• Keywords: AI 2004, Artificial Intelligence, Constraint Solving Schema, Heuristic Guidance, Local Search