Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/39265
DC FieldValue
dc.titleFunctional elimination and 0/1/All constraints
dc.contributor.authorZhang, Yuanlin
dc.contributor.authorYap, Roland H.C.
dc.contributor.authorJaffar, Joxan
dc.date.accessioned2013-07-04T07:37:43Z
dc.date.available2013-07-04T07:37:43Z
dc.date.issued1999
dc.identifier.citationZhang, Yuanlin,Yap, Roland H.C.,Jaffar, Joxan (1999). Functional elimination and 0/1/All constraints. Proceedings of the National Conference on Artificial Intelligence : 175-180. ScholarBank@NUS Repository.
dc.identifier.isbn0262511061
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39265
dc.description.abstractWe present new complexity results on the class of 0/1/All constraints. The central idea involves functional elimination, a general method of elimination whose focus is on the subclass of functional constraints. One result is that for the subclass of 'All' constraints, strong n-consistency and minimality is achievable in O(en) time, where e, n are the number of constraints and variables. The main result is that we can solve 0/1/All constraints in O(e(d + n)) time, where d is the domain size. This is an improvement over known results, which are O(ed(d + n)). Furthermore, our algorithm also achieves strong n-consistency and minimality.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings of the National Conference on Artificial Intelligence
dc.description.page175-180
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.

Page view(s)

61
checked on Oct 28, 2019

Google ScholarTM

Check

Altmetric


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