An automaton Constraint for Local Search

Authors:
Jun He;Pierre Flener;Justin Pearson
Affiliations:
(Correspd.) Department of Information Technology, Uppsala University, Box 337, SE-751 05 Uppsala, Sweden. {Jun.He/ Pierre.Flener/ Justin.Pearson}@it.uu.se;Department of Information Technology, Uppsala University, Box 337, SE-751 05 Uppsala, Sweden. {Jun.He/ Pierre.Flener/ Justin.Pearson}@it.uu.se;Department of Information Technology, Uppsala University, Box 337, SE-751 05 Uppsala, Sweden. {Jun.He/ Pierre.Flener/ Justin.Pearson}@it.uu.se
Venue:
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Year:
2011

Citing 11
Cited 2

Design, Implementation, and Evaluation of the Constraint Language cc(FD)

Design, Implementation, and Evaluation of the Constraint Language cc(FD)
Localizer: A Modeling Language for Local Search

Localizer: A Modeling Language for Local Search
Constraint-Based Local Search

Constraint-Based Local Search
On global warming: Flow-based soft global constraints

Journal of Heuristics
Global Constraint Catalogue: Past, Present and Future

Constraints
Generic Incremental Algorithms for Local Search

Constraints
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Introduction to Automata Theory, Languages, and Computation

Introduction to Automata Theory, Languages, and Computation
Solution counting algorithms for constraint-centered search heuristics

Constraints
Differentiable invariants

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Revisiting the sequence constraint

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

Solution neighbourhoods for constraint-directed local search

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore the idea of using automata to implement new constraints for local search. This is already a successful approach in constraint-based global search. We show how to maintain the violations of a constraint and its variables via a deterministic finite automaton that describes a ground checker for that constraint. We extend the approach to counter automata, which are often much more convenient than finite automata, if not more independent of the constraint instance. We establish the practicality of our approach on several real-life combinatorial problems.