1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/39976
DC FieldValue
dc.titleIncrementally solving functional constraints
dc.contributor.authorZhang, Y.
dc.contributor.authorYap, R.H.C.
dc.date.accessioned2013-07-04T07:53:52Z
dc.date.available2013-07-04T07:53:52Z
dc.date.issued2002
dc.identifier.citationZhang, Y.,Yap, R.H.C. (2002). Incrementally solving functional constraints. Proceedings of the National Conference on Artificial Intelligence : 973-974. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39976
dc.description.abstractBinary 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.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings of the National Conference on Artificial Intelligence
dc.description.page973-974
dc.description.codenPNAIE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check


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