An Interval Constraint Branching Scheme for Lattice Domains

This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction problems (CSPs) that are defined on any set of computation domains (finite or infinite) that are lattices. A formal specification of the schema and a number of interesting properties, satisfied by any instance of the schema, are presented. It is also shown that the operational procedures of many constraint systems (including cooperative systems) are instances of this branching schema.

• Type: Journal
• Year: 2006
• Where: JUCS
• Authors: Antonio J. Fernández, Patricia M. Hill
• Keywords: Interval Constraint, Interval Constraint Satisfaction, JUCS 2006, Parameterized Schema