Tractable classes of binary CSPs defined by excluded topological minors
The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A CSP instance can be presented as a labelled graph (called the microstructure) encoding both the forms of the cons...
| প্রধান লেখক: | , , , |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | Conference item |
| ভাষা: | English |
| প্রকাশিত: |
International Joint Conferences on Artificial Intelligence
2015
|