Reducing Redundancy in the Hypertree Decomposition Scheme

Proceedings of the International Conference on Tools with Artificial Intelligence

Volumn , Issue , 2003, Pages 474-481

  Harvey, Peter ^a   Ghose, Aditya ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

CONSTRAINT SATISFACTION PROBLEMS (CSP); HYPERGRAPHS;

COMPUTATIONAL COMPLEXITY;

EID: 0344235427     PISSN: 10636730     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Rina Dechter. Constraint Networks. In Stuart C. Shapiro, editor, Encyclopedia of Artificial Intelligence, volume 1. Addison-Wesley Publishing Company, 1992.
2. Eugene C. Freuder. A Sufficient Condition for Backtrack-free Search. JACM, 29(1):24-32, January 1982.
3. Eugene C. Freuder. A Sufficient Condition for Backtrack-bounded Search. JACM, 32(4):755-761, October 1985.
4. Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree decompositions and tractable queries. In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 21-32. ACM Press, May 31-June 2 1999.
5. Georg Gottlob, Nicola Leone, and Francesco Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124(2):243-282, December 2000.
6. Nicola Leone, Alfredo Mazzitelli, and Francesco Scarcello. Cost-Based Query Decompositions. In Proceedings of SEBD 2002, 2002.
7. Richard Wallace. Directed Arc Consistency Processing. In Manfred Meyer, editor, Constraint Processing, Selected Papers, volume 923 of Lecture Notes in Computer Science. Springer, 1995.