Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tractability in such problems, such as the property of being tree-structured. In this paper we introduce the broken-triangle p...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
IOS Press
2008
|