Loading...
Please wait, while we are loading the content...
Similar Documents
Solving Functional Constraints by Variable Substitution and Constraint Elimination
| Content Provider | Semantic Scholar |
|---|---|
| Author | Zhang, Yuanlin Yap, Roland H. C. |
| Abstract | 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, e.g., 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://redwood.cs.ttu.edu/~yuazhang/publications/fun-tplp10.pdf |
| Alternate Webpage(s) | http://redwood.cs.ttu.edu/~yzhang/publications/fun-tplp10.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
