Revisiting constraint-directed search

  • Authors:

  • Magnus Ågren;Pierre Flener;Justin Pearson

  • Affiliations:

  • SICS Box, 1263, SE-164 29 Kista, Sweden;Faculty of Engineering and Natural Sciences, Sabancı University, Orhanlı, Tuzla, TR-34956 İstanbul, Turkey and Department of Information Technology, Uppsala University, Box 337, SE- ...;Department of Information Technology, Uppsala University, Box 337, SE-751 05 Uppsala, Sweden

  • Venue:
  • Information and Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In constraint-based local search the solutions are described declaratively by a conjunction of (often high-level) constraints. In this article we show that this opens up new ideas for constraint-directed search. For a constraint we introduce three neighbourhoods, where the penalty for that constraint alone is decreasing, increasing, or unchanged. We give specialised algorithms for common constraints that efficiently implement these neighbourhoods. Further, we give a general algorithm that implements these neighbourhoods from specifications of constraints in monadic existential second-order logic. Finally, we show how common constraint-directed local search algorithms are often easier to express using these neighbourhoods.