2001/05/14 by Sebastian Brand, Brand, Sebastian · 2 citations
Computer Science · #Advanced Database Systems and Queries #Constraint Satisfaction and Optimization #Model-Driven Software Engineering Techniques #cs.DS #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0105024
10 pages. Accepted at the 6th Annual Workshop of the ERCIM Working Group on Constraints, 2001
arxiv created 2001/05/14 · arxiv updated 2009/11/30
We describe the use of array expressions as constraints, which represents a consequent generalisation of the "element" constraint. Constraint propagation for array constraints is studied theoretically, and for a set of domain reduction rules the local consistency they enforce, arc-consistency, is proved. An efficient algorithm is described that encapsulates the rule set and so inherits the capability to enforce arc-consistency from the rules.