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 language | English |
|---|---|
| Pages | 973-974 |
| Number of pages | 2 |
| State | Published - 2002 |
| Event | 18th National Conference on Artificial Intelligence (AAAI-02), 14th Innovative Applications of Artificial Intelligence Conference (IAAI-02) - Edmonton, Alta., Canada Duration: Jul 28 2002 → Aug 1 2002 |
Conference
| Conference | 18th National Conference on Artificial Intelligence (AAAI-02), 14th Innovative Applications of Artificial Intelligence Conference (IAAI-02) |
|---|---|
| Country/Territory | Canada |
| City | Edmonton, Alta. |
| Period | 07/28/02 → 08/1/02 |