Incrementally solving functional constraints

Yuanlin Zhang, Roland H.C. Yap

Research output: Contribution to conferencePaper

1 Scopus citations

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.

Original languageEnglish
Pages973-974
Number of pages2
StatePublished - 2002
Event18th National Conference on Artificial Intelligence (AAAI-02), 14th Innovative Applications of Artificial Intelligence Conference (IAAI-02) - Edmonton, Alta., Canada
Duration: Jul 28 2002Aug 1 2002

Conference

Conference18th National Conference on Artificial Intelligence (AAAI-02), 14th Innovative Applications of Artificial Intelligence Conference (IAAI-02)
CountryCanada
CityEdmonton, Alta.
Period07/28/0208/1/02

Fingerprint Dive into the research topics of 'Incrementally solving functional constraints'. Together they form a unique fingerprint.

  • Cite this

    Zhang, Y., & Yap, R. H. C. (2002). Incrementally solving functional constraints. 973-974. Paper presented at 18th National Conference on Artificial Intelligence (AAAI-02), 14th Innovative Applications of Artificial Intelligence Conference (IAAI-02), Edmonton, Alta., Canada.