Tractable optimization problems through hypergraph-based structural restrictions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5556 LNCS, Issue PART 2, 2009, Pages 16-30

  Gottlob, Georg ^a   Greco, Gianluigi ^b   Scarcello, Francesco ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC GRAPHS; ACYCLICITY; CONSTRAINT SATISFACTION PROBLEMS; HYPERGRAPH; NP-HARD PROBLEM; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; SOLUTION APPROACH; STRUCTURAL DECOMPOSITION; STRUCTURAL RESTRICTIONS; TREE DECOMPOSITION;

COMPUTATIONAL COMPLEXITY; DECOMPOSITION; LINGUISTICS; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 70449109815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02930-1_2     Document Type: Conference Paper

References (36)

1. Adler, I., Gottlob, G., Grohe, M.: Hypertree-Width and Related Hypergraph Invariants. European Journal of Combinatorics 28, 2167-2181 (2007)
2. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM 30(3), 479-513 (1983)
3. Bernstein, P.A., Goodman, N.: The power of natural semijoins. SIAM Journal on Computing 10(4), 751-771 (1981)
4. Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., Fargier, H.: Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison. Constraints 4(3), 199-240 (1999)
5. Bodlaender, H.L., Fomin, F.V.: A Linear-Time Algorithm for Finding Tree Decompositions of Small Treewidth. SIAM Journal on Computing 25(6), 1305-1317 (1996)
6. Chekuri, C., Rajaraman, A.: Conjunctive Query Containment Revisited. MFPS 1985 239(2), 211-229 (2000);
7. Preliminary version in: Schwentick, T., Suciu, D. (eds.): ICDT 2007. LNCS, vol. 4353, pp. 211-229. Springer, Heidelberg (2007);
8. Afrati, F.N., Kolaitis, P.G. (eds.): ICDT 1997. LNCS, vol. 1186, pp. 56-70. Springer, Heidelberg (1996) (Full version)
9. Cohen, D.A., Jeavons, P.G., Gyssens, M.: A unified theory of structural tractability for constraint satisfaction problems. Journal of Computer and System Sciences 74(5), 721-743 (2008)
10. Daskalakis, C., Papadimitriou, C.H.: Computing pure nash equilibria in graphical games via markov random fields. In: Proc. of ACM EC 2006, pp. 91-99 (2006)
11. Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30(3), 514-550 (1983)
12. de Givry, S., Schiex, T., Verfaillie, G.: Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP. In: Proc. of AAAI 2006 (2006)
13. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
14. Freuder, E.C., Wallace, R.J.: Partial Constraint Satisfaction. Artificial Intelligence 58(1-3), 21-70 (1992)
15. Gottlob, G., Greco, G.: On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition. In: Proc. EC 2007, pp. 152-161 (2007) (full version currently available as Technical Report, University of Calabria)
16. Gottlob, G., Greco, G., Scarcello, F.: Pure Nash Equilibria: Hard and Easy Games. Journal of Artificial Intelligence Research 24, 357-406 (2005)
17. Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural CSP decomposition methods. Artificial Intelligence 124(2), 243-282 (2000)
18. Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. Journal of the ACM 48(3), 431-498 (2001)
19. Gottlob, G., Leone, N., Scarcello, F.: Advanced parallel algorithms for processing acyclic conjunctive queries, rules, and constraints. In: Proc. of SEKE 2000, pp. 167-176 (2000)
20. Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. J. of Computer and System Sciences 64(3), 579-627 (2002)
21. Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. of Computer and System Sciences 66(4), 775-808 (2003)
22. Gottlob, G., Miklós, Z., Schwentick, T.: Generalized hypertree decompositions: NP-hardness and tractable variants. In: Proc. of PODS 2007, pp. 13-22 (2007)
23. Gottlob, G., Pichler, R., Wei, F.: Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. In: Proc. of AAAI 2006 (2006)
24. Greco, G., Scarcello, F.: Non-Binary Constraints and Optimal Dual-Graph Representations. In: Proc. of IJCAI 2003, pp. 227-232 (2003)
25. Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proc. of SODA 2006, Miami, Florida, USA, pp. 289-298 (2006)
26. Kask, K., Dechter, R., Larrosa, J., Dechter, A.: Unifying tree decompositions for reasoning in graphical models. Artificial Intelligence 166(1-2), 165-193 (2005)
27. Meseguer, P., Rossi, F., Schiex, T.: Soft Constraints. In: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
28. Ndiaye, S., Jégou, P., Terrioux, C.: Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems. In: Proc. of ICTAI 2008, pp. 299-306 (2008)
29. Reingold, O.: Undirected ST-connectivity in log-space. Journal of the ACM 55(4) (2008)
30. Robertson, N., Seymour, P.D.: Graph minors III: Planar tree-width. Journal of Combinatorial Theory, Series B 36, 49-64 (1984)
31. Scarcello, F., Gottlob, G., Greco, G.: Uniform Constraint Satisfaction Problems and Database Theory. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 156-195. Springer, Heidelberg (2008)
32. Schiex, T., Fargier, H., Verfaillie, G.: Valued Constraint Satisfaction Problems: Hard and Easy Problems. In: Proc. of IJCAI 1995, pp. 631-639 (1995)
33. Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing 13(3), 566-579 (1984)
34. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
35. Terrioux, C., J'egou, P.: Bounded Backtracking for the Valued Constraint Satisfaction Problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 709-723. Springer, Heidelberg (2003)
36. Yannakakis, M.: Algorithms for acyclic database schemes. In: Proc. of VLDB 1981, pp. 82-94 (1981)