Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-540-89982-2_50
Title: Efficient algorithms for functional constraints
Authors: Zhang, Y.
Yap, R.H.C. 
Li, C.
Marisetti, S.
Issue Date: 2008
Source: 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)
URI: http://scholarbank.nus.edu.sg/handle/10635/41972
ISBN: 3540899812
ISSN: 03029743
DOI: 10.1007/978-3-540-89982-2_50
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

2
checked on Nov 20, 2017

Page view(s)

48
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.