Branching: the Essence of Constraint Solving

Details Branching: the Essence of Constraint Solving Branching: the Essence of Constraint Solving

2001-09-24

arxiv.org/abs/cs/0109060v1

Computer Science

Programming Languages

18 pages, 2 figures, Proceedings ERCIM Workshop on Constraints (Prague, June 2001)

Scientific paper

This paper focuses on the branching process for solving any constraint satisfaction problem (CSP). A parametrised schema is proposed that (with suitable instantiations of the parameters) can solve CSP's on both finite and infinite domains. The paper presents a formal specification of the schema and a statement of a number of interesting properties that, subject to certain conditions, are satisfied by any instances of the schema. It is also shown that the operational procedures of many constraint systems including cooperative systems) satisfy these conditions. Moreover, the schema is also used to solve the same CSP in different ways by means of different instantiations of its parameters.

Affiliated with

Also associated with

No associations

Rating

Branching: the Essence of Constraint Solving does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Branching: the Essence of Constraint Solving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Branching: the Essence of Constraint Solving will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307927