Solving Functional Constraints by Variable Substitution

Details Solving Functional Constraints by Variable Substitution Solving Functional Constraints by Variable Substitution

2010-06-16

arxiv.org/abs/1006.3215v1

Computer Science

Artificial Intelligence

Scientific paper

Functional constraints and bi-functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other non-functional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments on random problems show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.

Affiliated with

Also associated with

No associations

Rating

Solving Functional Constraints by Variable Substitution 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 Solving Functional Constraints by Variable Substitution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Functional Constraints by Variable Substitution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100617