Revisiting the Lexicographic Ordering Constraint
Number of Authors: 2
2002 (English)Report (Refereed)
We present a global consistency algorithm for the lexicographic ordering constraint on two vectors of $n$ variables. The algorithm maintains arc-consistency, runs in $O(n)$ time on posting plus amortized $O(1)$ time per propagation event, and detects entailment or rewrites itself to a simpler constraint whenever possible. The algorithm was derived from a finite automaton operating on a string which captures the relationship between each variable pair of the two vectors.
Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2002, 1. , 13 p.
SICS Technical Report, ISSN 1100-3154 ; 2002:17
Constraint Programming, Global Constraints, Lexicographic Ordering, Symmetry
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21991OAI: oai:DiVA.org:ri-21991DiVA: diva2:1041533