SODA

From constraints to finite automata to filtering algorithms

Carlsson, Mats and Beldiceanu, Nicolas (2004) From constraints to finite automata to filtering algorithms. In: Proceedings ESOP2004: Programming languages and systems, 29 March - 2 April 2004, Barcelona, Spain.

[img]
Preview
PDF
160Kb

Abstract

We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two case studies of constraints on vectors of variables. This has enabled us to derive an incremental filtering algorithm that runs in O(n) plus amortized O(1) time per propagation event for the lexicographic ordering constraint over two vectors of size n, and an O(nmd) time filtering algorithm for a chain of m-1 such constraints, where d is the cost of certain domain operations. Both algorithms maintain hyperarc consistency. Our approach can be seen as a first step towards a methodology for semi-automatic development of filtering algorithms.

Item Type:Conference or Workshop Item (Paper)
Additional Information:Lecture Notes in Computer Science; 2986 ISBN: 978-3-540-21313-0
ID Code:2728
Deposited By:INVALID USER
Deposited On:21 May 2008
Last Modified:18 Nov 2009 16:13

Repository Staff Only: item control page