Non-binary constraints and optimal dual-graph representations

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 227-232

  Greco, Gianluigi ^a   Scarcello, Francesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BICONNECTED COMPONENTS; DECOMPOSITION METHODS; GRAPH-BASED METHODS; NON-BINARY CONSTRAINTS; STRUCTURAL METHODS; TRACTABLE CLASS; TREE DECOMPOSITION; TREE-WIDTH;

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONSTRAINT SATISFACTION PROBLEMS; OPTIMIZATION;

TREES (MATHEMATICS);

EID: 31144459618     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. F. Bacchus, X. Chen, P. van Beck, and T. Walsh. Binary vs Non-Binary Constraints. Artificial Intelligence, 140: (1-2), 1-37, 2002.
2. Ch. Chekuri and A. Rajaraman. Conjunctive Query Containment Revisited. Theoretical Computer Science, 239(2):211-229, 2000.
3. R. Dechter. Constraint Networks. In Encyclopedia of Artificial Intelligence, second edition, Wiley and Sons, pp. 276-285, 1992.
4. R. Dechter and J. Pearl. Network based heuristics for constraint satisfaction problems. Artificial Intelligence, 34(1): 1-38, 1988.
5. R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38:353-366,1989.
6. E.C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(4):755-761,1985.
7. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, 124(2): 243-282,2000. (Pubitemid 32029459)
8. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64(3): 579-627, 2002.
9. M. Gyssens, P.G. Jeavons, and D.A. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66:57-89, 1994.
10. Ph. G. Kolaitis and M. Y. Vardi. Conjunctive-Query Containment and Constraint Satisfaction. Journal of Computer and System Sciences, 61(2): 302-332,2000.
11. J. Pearson and P.G. Jeavons. A Survey of Tractable Constraint Satisfaction Problems, CSD-TR-97-15, Royal Holloway, Univ. of London, 1997.
12. N. Robertson and P.D. Seymour. Graph Minors I I . Algorithmic aspects of tree width. Journal of Algorithms, 7:309-322, 1986.
13. R. Seidel. A new method for solving constraint satisfaction problems. In Proc. of IJCAI'81, 1981.