Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleSolving functional constraints by variable substitution
dc.contributor.authorZhang, Y.
dc.contributor.authorYap, R.H.C.
dc.identifier.citationZhang, Y., Yap, R.H.C. (2011). Solving functional constraints by variable substitution. Theory and Practice of Logic Programming 11 (2-3) : 297-322. ScholarBank@NUS Repository.
dc.description.abstractFunctional 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 Constraint Satisfaction Problem(s)-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 nonfunctional 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. © 2011 Cambridge University Press.
dc.subjectArc consistency
dc.subjectConstraint logic programming
dc.subjectConstraint satisfaction problem
dc.subjectFunctional constraints
dc.subjectVariable substitution
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleTheory and Practice of Logic Programming
Appears in Collections:Staff Publications

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

Google ScholarTM



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