Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems

Computer Journal

Volumn 51, Issue 3, 2008, Pages 303-325

  Gottlob, Georg ^a   Szeider, Stefan ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Artificial intelligence; Constraint satisfaction; Parameterized algorithms

Indexed keywords

BOOLEAN FUNCTIONS; CONSTRAINT THEORY; DATABASE SYSTEMS; LOGIC PROGRAMMING; PARAMETERIZATION; SEMANTICS;

CONSTRAINT SATISFACTION; FIXED-PARAMETER ALGORITHMS; NON-MONOTONIC REASONING; PARAMETERIZED ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 43249130171     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm056     Document Type: Article

References (108)

1. Garey, M.R. and Johnson, D.R. (1979) Computers and Intractability. W. H. Freeman and Company, New York.
2. Chen, J., Kanj, I.A. and Jia, W. (2001) Vertex cover: Further observations and further improvements. J. Algorithms, 41, 280-301.
3. Chen, J., Kanj, I.A. and Xia, G. (2006) Improved Parameterized Upper Bounds for Vertex Cover. Proc. Int. Symp. Mathematical Foundations of Computer Science (MFCS 2006), Stará Lesná. Slovakia, August 28-September 1, pp. 238-249.
4. Downey, R.G. (2003) Parameterized Complexity for the Skeptic. Proc. 18th IEEE Conf. on Computational Complexity, Aarhus, Denmark, July 7-10, pp. 147-168. Invited paper.
5. Downey, R.G. and Fellows, M.R. (1999) Parameterized Complexity. Monographs in Computer Science. Springer-Verlag.
6. Estivill-Castro, V., Fellows, M.R., Langston, M.A. and Rosamond, F.A. (2005) FPT is P-Time Extremal Structure I. In Broersma, H., Johnson, M. and Szeider, S. (eds), Algorithms and Complexity in Durham 2005, Proceedings of the first ACiD Workshop, Texts in Algorithmics, Vol. 4, 1-41. King's College Publications.
7. Fernau, H. (2005) Parameterized algorithmics: A graph-theoretic approach. Technical report, Universtät Tübingen. Habilitation thesis.
8. Flum, J. and Grohe, M. (2006) Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag.
9. Niedermeier, R. (2006) Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press.
10. Kolaitis, P.G. and Vardi, M.Y. (2000) Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci., 61, 302-332. Special issue on the Seventeenth ACM SIGACT- SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, WA, 1998.
11. Downey, R.G., Fellows, M.R. and Regan, K.W. (1998) Descriptive Complexity and the W Hierarchy. Proof Complexity and Feasible Arithmetics, (1996), Rutgers, NJ, DIMACS Series Discrete Mathematical Theoretical Computer Science, Vol. 39, 119-134. Amer. Math. Soc., Providence, RI.
12. Flum, J. and Grohe, M. (2005) Model-checking problems as a basis for parameterized intractability. Log. Methods Comput. Sci., 1 1-36.
13. Simonis, H. (2005) Sudoku as a constraint problem. In Hnich, B., Prosser, P. and Smith, B. (eds), Proc. Modelling and Reformulating Constraint Satisfaction Problems, Fourth International Workshop, Sitges, Barcelona, Spain, 1 October pp. 13-27.
14. Papadimitriou, C.H. and Yannakakis, M. (1999) On the complexity of database queries. J. Comput. Syst. Sci., 58, 407-427.
15. Samer, M. and Szeider, S. (2006) Constraint satisfaction with bounded treewidth revisited. Proc. CP 2006, Twelfth Int. Conf. Principles and Practice of Constraint Programming, Nantes, France, September 24-29, Lecture Notes in Computer Science, Vol. 4204, 499-513. Springer-Verlag.
16. Schaefer, T.J. (1978) The Complexity of Satisfiability Problems. Conf. Record of the Tenth Annual ACM Symposium on Theory of Computing San Diego. CA. 216-226. ACM.
17. Cohen, D. and Jeavons, P. (2006) The complexity of constraint languages. In Rossi, F., van Beek, P. and Walsh, T. (eds), Handbook of Constraint Programming, Vol. I, Chapter 8. Elsevier.
18. Feder, T. and Vardi, M.Y. (1999) The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Comput., 28, 57-104.
19. Bodlaender, H. (1993) A tourist guide through treewidth. Acta Cybern 11, 1-22.
20. Gottlob, G., Pichler, R. and Wei, F. (2006) Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. Twenty-First National Conf. Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conf., Boston, MA, July 16-20. pp. 250-256. AAAI Press.
21. Arnborg, S., Corneil, D.G. and Proskurowski, A. (1987) Complexity of finding embedding in a κ-tree. SIAM J. Algebraic Discrete Methods 8, 277-284 1987.
22. Bodlaender, H.L. (1996) A linear-time algorithm for finding tree-decompositions ot small treewidth. SIAM J. Comput., 25, 1305-1317.
23. Bodlaender, H.L. (1993) A tourist guide through treewidth. Acta Cybern., 11, 1-21.
24. Bodlaender, H.L. (2005) Discovering Treewidth. Proc. 31st Conf. Current Trends in Theory and Practice of Computer Science (SOFSEM'05), Lecture Notes in Computer Science, Vol. 3381 pp. 1-16. Springer-Verlag.
25. Bodlaender, H.L. (1998) Dynamic programming on graphs with bounded treewidth. Automata, languages and programming (Tampere, 1988), Lecture Notes in Computer Science, vol. 317 105-118. Springer-Verlag.
26. Courcelle, B. (1987) Recognizability and second-order definability for sets of finite graphs. Technical Report I-8634, Université de Bordeaux.
27. Freuder, E.C. (1985) A sufficient condition for backtrack-bounded search. J. ACM, 32, 755-761.
28. Gottlob, G., Scarcello, F. and Sideri, M. (2002) Fixed-parameter complexity in AI and nonmonotonic reasoning. Artif. Intell., 138, 55-86.
29. Yannakakis, M. (1981) Algorithms for Acyclic Database Schemes. In Zaniolo, C. and Delobel, C. (eds), Proc. Very Large Data Bases, 7th Int. Conf. September 9-11, pp. 81-94. IEEE Computer Society.
30. Dechter, R. (1992) Constraint Networks. Encyclopedia of Artificial Intelligence, Vol. 1, pp. 276-285 (2nd edn). John Wiley & Sons.
31. Bodlaender, H.L. (1993) On linear time minor tests with depth-first search. J. Algorithms, 14, 1-23.
32. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R. and Wernicke, S. (2005) Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. In Dehne, F.K.H.A., López-Ortiz, A. and Sack, J.-R. (eds), Algorithms and Data Structures, Proc. 9th Int. Workshop, WADS 2005 August 15-17, Waterloo, Canada, Lecture Notes in Computer Science Vol. 3608, 158-168. Springer-Verlag.
33. Williams, R., Gomes, C. and Selman, B. (2003) Backdoors to typical case complexity. in Gottlob, G. and Walsh, T. (eds), Proc. Eighteenth Int. Joint Conf. Artificial Intelligence (IJCAI 2003), pp. 1173-1178. Morgan Kaufmann.
34. Grohe, M. (2007) The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM, 54, 1-24.
35. Grohe, M., Schwentick, T. and Segoufin, L. (2001) When is the evaluation of conjunctive queries tractable? Proc. Thirty-Third Annual ACM Symp. Theory of Computing, New York, pp. 657-666. ACM.
36. Robertson, N. and Seymour, P.D. (1986) Graph minors. V. Excluding a planar graph. J. Comb. Theory Ser. B, 41, 92-114.
37. Fagin, R. (1983) Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM, 30, 514-550.
38. Beeri, C., Fagin, R., Maier, D. and Yannakakis, M. (1983) On the desirability of acyclic database schemes. J. ACM, 30, 479-513.
39. Gottlob, G., Leone, N. and Scarcello, F. (2001) Hypertree Decompositions: A Survey. Mathematical Foundations of Computer Science, 2001 (Mariánské Lázně), Lecture Notes in Computer Science, Vol. 2136, pp. 37-57. Springer-Verlag.
40. Adler, I., Gottlob, G. and Grohe, M. (2005) Hypertree-width and related hypergraph invariants. Proc. 3rd European Conf. Combinatorics, Graph Theory and Applications (European Journal of Combinatorics'05), DMTCS Proceedings Series, vol. AE, pp. 5-10. Full version to appear in European J. Combinatorics.
41. Gottlob, G., Miklos, Z. and Schwentick, T. (2007) Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants. Proc. ACM Symp Theory of Database Systems (PODS 2007), Beijing, China, pp. 13-22, ACM.
42. Gottlob, G., Leone, N. and Scarcello, F. (2000) A comparison of structural CSP decomposition methods. Arti. Intell., 124, 243-282.
43. Gottlob, G., Grohe, M., Musliu, N., Samer, M. and Scarcello, F. (2005) Hypertree decompositions: Structure, algorithms, and applications. In Kratsch,D. (ed), Proc. 31st Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Lecture Notes in Computer Science, Vol. 3787, 1-15. Springer-Verlag.
44. Chen, H. and Dalmau, V. (2005) Beyond Hypertree Width: Decomposition Methods Without Decompositions. In Beek, P. (ed), Proc. 11th Int. Conf. Principles and Practice of Constraint Programming (CP 2005), Sitges, Spain, October 1-5, Lecture Notes in Computer Science, Vol. 3709, pp. 167-181. Springer Verlag.
45. Grohe, M. and Marx, D. (2006) Constraint Solving via fractional edge covers. Proc. 17th Annual ACM-SIAM Symp. Discrete Algorithms (SODA 2006), Miami, FL, January 22-26, pp. 289-298. ACM Press.
46. Chung, F.R.K. Graham, R.L., Frankl, P. and Shearer, J.B. (1986) Some intersection theorems for ordered sets and graphs. J. Combin. Theory Ser. A, 43, 23-37.
47. Bjesse, P., Leonard, T. and Mokkedem, A. (2001) Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers. In Berry, G., Comon, H. and Finkel, A. (eds), Proc. Computer Aided Verification: 13th International Conference (CAV 2001), Paris, France, July 18-22, pp. 454-464.
48. Prasad, A.G.M. and Biere, A. (2005)) A survey of recent advances in sat-based formal verification. Softw. Tools Technol. Trans. 7 156-173.
49. Velev, M.N. and Bryant, R.E. (2003) Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. J. Symb. Comput., 35, 73-106.
50. Kautz, H.A. and Selman, B. (1992) Planning as satisfiability. Proc. ECAI 1992, Vienna, Austria, August 3-7, pp. 359-363.
51. Tzeitin, G.S. (1968) Complexity of a derivation in the propositional calculus. Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR 8. 23-41, English translation reprinted in Siekman, J. and Wrightson, G. (eds) (1983) Automation of Reasoning. Classical Papers on Computer Science 1967-1970, Volume 2. Springer-Verlag.
52. Impagliazzo, R., Paturi, R. and Zane, F. (2001) Which problems have strongly exponential complexity. J. Comput. Syst. Sci., 63, 512-530.
53. Alekhnovich, M. and Razborov, A.A. (2002) Satisfiability, branch-width and Tseitin tautologies. Proc. 43rd Annual IEEE Symp. Foundations of Computer Science (FOCS'02), Vancouver, BC, Canada, November 16-19, pp. 593-603.
54. Robertson, N. and Seymour, P.D. (1995) Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B, 63, 65-110
55. Bacchus, F., Dalmao, S. and Pitassi, T. (2003) Algorithms and complexity results for #SAT and Bayesian inference. Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), Cambridge, MA, October 11-14, pp. 340-351.
56. Robertson, N. and Seymour, P.D. (1991) Graph minors X. Obstructions to tree-decomposition. J. Comb. Theory Ser. B, 52, 153-190.
57. Szeider, S. (2004) On fixed-parameter Tractable Parameterizations of SAT. In Giunchiglia, E. and Tacchella, A. (eds), Theory and Applications of Satisfiability, 6th Int. Conf., (SAT 2003), Selected and Revised Papers, Lecture Notes in Computer Science, Vol. 2919, 188-202. Springer-Verlag.
58. Fischer, E., Makowsky, J.A. and Ravve. E.R. Counting truth assignments of formulas of bounded tree- width or clique-width. Discr. Appl. Math In press.
59. Samer, M. and Szeider, S. (2007) Algorithms for propositional model counting. In Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Yerevan, Armenia, October 15-19, 2007. Lecture Notes in Computer Science, Springer-Verlag. To appear.
60. Courcelle, B., Makowsky, J.A. and Rotics, U. (2001) On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math., 108, 23-52.
61. Fellows, M.R., Rosamond, F.A., Rotics, U. mand Szeider, S. (2006) Clique-width Minimization is NP-hard. Proc. STOC 2006; the 38th ACM Symp. Theory of Computing, Seattle, WA, pp. 354-362. ACM.
62. Oum, S. and Seymour, P. (2006) Approximating clique-width and branch-width. J. Comb. Theory Ser. B, 96, 514-528.
63. Courcelle, B. and Olariu, S. (2000) Upper bounds to the clique-width of graphs. Discrete Appl. Math., 101 77-114.
64. Franco, J. and Van Gelder, A. (2003) A perspective on certain polynomial time solvable classes of satisfiability. Discrete Appl. Math., 125 177-214.
65. Aharoni, R. and Linial, N. (1986) Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Comb. Theory Ser. A, 43 196-204.
66. Fleischner, H., Kullmann, O. and Szeider. S. (2002) Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoret. Comput. Sci., 289, 503-516.
67. Szeider, S. (2004) Minimal unsatisfiable formulas with boundend clause-variable difference are fixed-parameter tractable. J. Comput Syst. Sci., 69, 656-674.
68. Papadimitriou, C. H. and Wolfe, D. (1988) The complexity of facets resolved. J. Comput. Syst. Sci., 37, 2-13.
69. Papadimitriou, C.H. (1994) Computational Complexity. Addison-Wesley.
70. Szeider, S. (2007) Matched Formulas and Backdoor sets. In Marques-Silva, J. and Sakallah, K.A. (eds), Proc. SAT 2007, Tenth Int. Conf. Theory and Applications of Satisfiability Testing, Lisbon, Portugal, May 28-31, Lecture Notes in Computer Science, Vol. 4501, 94-99. Springer-Verlag.
71. Franco, J., Goldsmith, J., Schlipf, J., Speckenmeyer, E. and Swaminathan, R.P. (1999) An algorithm for the class of pure implicational formulas. Discrete Appl. Math., 96-97, 89-106.
72. Heusch, P., Porschen, S. and Speckenmeyer, E. (2003) Improving a fixed parameter tractability time bound for the shadow problem. J. Comput. Syst. Sci., 67, 772-788.
73. Williams, R., Gomes, C. and Selman, B. (2003) On the Connections Between Backdoors, Restarts, and Heavy-Tailedness in Combinatorial Search. Sixth Int. Conf. Theory and Applications of Satisfiability Testing, (SAT 2003), Margherita Ligure, S., Portofino, Italy, May 5-8, Informal Proc. pp. 222-230.
74. Nishimura, N., Ragde, P. and Szeider, S. (2004) Detecting Backdoor Sets with Respect to Horn and Binary Clauses. Informal, Proc. Seventh Int. Conf. on Theory and Applications of Satisfiability Testing, (SAT 2004 May 10-13, 96-103.
75. Samer, M. and Szeider, S. (2007) Backdoor Sets of Quantified Boolean Formulas. In Marques-Silva, J. and Sakallah, K.A. (eds), Proc. SAT 2007, Tenth Int. Conf. Theory and Applications of Satisfiability Testing Lisbon, Portugal, May 28-31, Lecture Notes in Computer Science Vol. 4501 pp. 230-243. Springer-Verlag.
76. Kleine Büning, H. and Lettman. T. (1999) Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge.
77. Szeider, S. (2005) Backdoor sets for DLL subsolvers. J. Autom. Reasoning, 35, 73-88. Reprinted as: In Giunchiglia, E. and Walsh, T. (eds.), Chapter 4 of the book SAT 2005 - Satisfiability Research in the Year 2005. Springer-Verlag. 2006.
78. Mahajan, M., Raman, V. and Sikdar, S. (2006) Parameterizing MAXSNP Problems Above Guaranteed Values. Proc. 2nd Int. Workshop on Parameterized and Exact Computation IWPEC 2006, Lecture Notes in Computer Science, Vol. 4169, pp. 38-49. Springer-Verlag.
79. Gutin, G., Yeo, A. and Szeider, N. (2006) Fixed-Parameter Complexity of Minimum Profile Problems. Proc. IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science, Vol. 4169, pp. 60-71. Springer-Verlag.
80. Gutin, G., Rafiey, A., Szeider, S. and Yeo, A. The linear arrangement problem parameterized above guaranteed value. Theory Comput. Syst. In press.
81. Kleine Büning, H. and Zhao, X. (2001) Satisfiable formulas Closd under Replacement. In Kautz, H. and Selman, B. (eds), Proc. Workshop on Theory and Applications of Satisfiability, Electronic Notes in Discrete Mathematics. Vol. 9, Elsevier Science Publishers, North-Holland.
82. Iwama, K. (1989) CNF-satisfiability test by counting and polynomial average time. SIAM J. Comput., 18, 385-391.
83. Nishimura, N., Ragde, P. and Szeider, S. (2006) Solving #SAT Using Vertex Covers. Proceedings of SAT 2006, Ninth International Conference on Theory and Applications of Satisfiability Testing, Seattle, WA. Lecture Notes in Computer Science, August 12-15, Vol. 4121, pp. 396-409. Springer-Verlag. Full version to appear in Acta Informatica.
84. Przymusinski, T.C. (1991) Stable semantics for disjunctive programs. New Gener. Compute., 9, 401-424.
85. Truszczyński, M. (2002) Computing large and small stable models. Theory Pract. Log. Program., 2, 1-23.
86. Lonc, Z. and Truszczyński, M. (2003) Fixed-parameter complexity of semantics for logic programs. ACM Trans. Comput. Log., 4, 91-119.
87. Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. (2001) Complexity and expressive power of logic programming. ACM Comput. Surv., 33, 374-425.
88. Eiter, T. and Gottlob, G. (1995) On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. Artif. Intell., 15, 289-323.
89. Reiter, R. (1978) On Closed World Data Bases. In Gallaire, H. and Minker, J. (eds), Logic and Data Bases, pp. 55-76, Plenum Press, New York.
90. [i#P-complete. Theoret. Comput. Sci., 114, 231-245.
91. Minker, T. (1982) On indefinite databases and the closed world assumption. Proc. Sixth Conf. Automated Deduction, New York, USA, June 7-9, pp. 292-308.
92. Yahya, A.H. and Henschen, L.J. (1985) Deduction in non-Horn databases. J. Autom. Reasoning, 1, 141-160.
93. Gelfond, M. and Przymusinska, H. (1986) Negation as failure: Careful closure procedure. Artif. Intell., 30, 273-287.
94. Gelfond, M., Przymusinska, H. and Przymusinski, T.C. (1986) The Extended Closed World Assumpution and its Relationship to Parallel Circumscription. Proc. Fifth ACM SIGACT-SIGMOD Symp. Principles of Database Systems, (PODS'86), Cambridge, MA, March 24-26, pp. 133-139.
95. McCarthy, J.L. (1980) Circumscription - a form of non-monotonic reasoning. Artif. Intell., 13, 27-39.
96. Eiter, T. and Gottlob, G. (1995) The complexity of logic-based abduction. J. ACM, 42, 3-42.
97. Console, L., Dupré, D.T. and Torasso, P. (1991) On the relationship between abduction and deduction. J. Log. Comput., 1, 661-690.
98. Arnborg, S., Lagergren, J. and Seese, D. (1991) Easy problems for tree-decomposable graphs. J. Algorithms, 12, 308-340.
99. Hell, P. and Nešetřil, J. (1992) The core of a graph. Discrete Math., 109, 117-126.
100. Fagin, R., Kolaitis, P.G., Miller, R.J. and Popa, L. (2003). Data Exchange: Semantics and Query Answering. Proc. 9th Int. Conf. Database Theory (ICDT 2003), Siena, Italy, January 8-10, Lecture Notes in Computer Science, vol. 2572, pp. 207-224. Springer-Verlag. Full version in: Theor. Comput. Sci. 100 89-124 (2005).
101. Fagin, R., Kolaitis, P.G. and Popa, L. (2003) Data Exchange: Getting to the Core. Proc. of the Twenty-Second ACM SIGACT-SIGMOND-SIGART Symp. on Principles of Database Systems (PODS 2003), San Diego, CA, USA, June 9-12, pp. 90-101. Full version in ACM TODS, 30, 147-210 (2005).
102. Gottlob, G. (2005) Computing cores for data exchange: New algoritms and practical solutions. Proc. Twenty-Fourth ACM SIGACT- SIGMOD-SIGART Symp. Principles of Database Systems (PODS 2005), Baltimore, MD, June 13-15, 148-159.
103. Gottlob, G. and Nash, A. (2006) Data Exchange: Computing Cores in Polynomial Time. Proc. Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS 2006), Chicago, IL, MD, June 26-28, pp. 40-49.
104. Gottlob, G. and Fermüller, C.G. (1993) Removing redundancy from a clause. Artif. Intell., 61, 263-289.
105. Beeri, C. and Vardi, M. (1984) A proof procedure for data dependencies. J. ACM, 31, 718-741.
106. Aho, A., Beeri, C. and Ullman, J. (1979) The theory of joins in relational databases. ACM Trans. Database Syst., 4, 297-314.
107. Maier, D., Mendelzon, A. and Sagiv, J. (1979) Testing implication of data dependencies. ACM Trans. Database Syst., 4, 455-469.
108. Deutsch, A. and Tannen, V. (2003) Reformulation of XML Queries and Constraints. Proc. 9th Int. Conf. Database Theory (ICDT 2003), Siena, Italy, January 8-10, Lecture Notes in Computer Science, vol. 2572, pp. 225-241. Springer-Verlag.