Please use this identifier to cite or link to this item:
|Title:||Incrementally solving functional constraints||Authors:||Zhang, Y.
|Issue Date:||2002||Citation:||Zhang, Y.,Yap, R.H.C. (2002). Incrementally solving functional constraints. Proceedings of the National Conference on Artificial Intelligence : 973-974. ScholarBank@NUS Repository.||Abstract:||Binary functional constraints, which represent an important constraint class in constraint satisfaction problems (CSP), were analyzed. Two algorithms were proposed to solve functional constraints in an incremental system. However, the choice of the two algorithms in a CP system depends on the tradeoff between efficiency and pruning ability.||Source Title:||Proceedings of the National Conference on Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/39976|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.