Inferring variable conflicts for local search

Authors:
Magnus Ågren;Pierre Flener;Justin Pearson
Affiliations:
Department of Information Technology, Uppsala University, Sweden;Department of Information Technology, Uppsala University, Sweden;Department of Information Technology, Uppsala University, Sweden
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 2
Cited 4

A constraint-based architecture for local search

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Constraint-Based Local Search

Constraint-Based Local Search

Generic Incremental Algorithms for Local Search

Constraints
Revisiting constraint-directed search

Information and Computation
Differentiable invariants

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Towards solver-independent propagators

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. These are known as conflicting variables. We propose a new definition for measuring the conflict of a variable in a model and apply it to the set variables of models expressed in existential second-order logic extended with counting (∃SOL+). Such a variable conflict can be automatically and incrementally evaluated. Furthermore, this measure is lower-bounded by an intuitive conflict measure, and upper-bounded by the penalty of the model. We also demonstrate the usefulness of the approach by replacing a built-in global constraint by an ∃SOL+ version thereof, while still obtaining competitive results.