Please use this identifier to cite or link to this item:
|Title:||Efficient algorithms for functional constraints|
|Citation:||Zhang, Y., Yap, R.H.C., Li, C., Marisetti, S. (2008). Efficient algorithms for functional constraints. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5366 LNCS : 606-620. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-89982-2_50|
|Abstract:||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 show that variable elimination can significantly improve the efficiency of solving problems with functional constraints. © 2008 Springer Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 16, 2018
WEB OF SCIENCETM
checked on Jul 24, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.