Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems

We survey the parameterized complexity of problems that arise in artificial intelligence, database theory and automated reasoning. In particular, we consider various parameterizations of the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries and the propositional satisfiability problem. Furthermore, we survey parameterized algorithms for problems arising in the context of the stable model semantics of logic programs, for a number of other problems of non-monotonic reasoning, and for the computation of cores in data exchange.

[1]  Georg Gottlob,et al.  Fixed-parameter complexity in AI and nonmonotonic reasoning , 1999, Artif. Intell..

[2]  Ge Xia,et al.  Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.

[3]  Alfred V. Aho,et al.  The theory of joins in relational data bases , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[5]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[6]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[7]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[8]  Nathan Linial,et al.  Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas , 1986, J. Comb. Theory, Ser. A.

[9]  Lawrence J. Henschen,et al.  Deduction in non-Horn databases , 1985, Journal of Automated Reasoning.

[10]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[11]  Udi Rotics,et al.  Clique-width minimization is NP-hard , 2006, STOC '06.

[12]  Marko Samer,et al.  Backdoor Sets of Quantified Boolean Formulas , 2008, Journal of Automated Reasoning.

[13]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.

[14]  Ronald Fagin,et al.  Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[15]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[16]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[17]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[18]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I , 2005, ACiD.

[19]  Georg Gottlob,et al.  Hypertree Decompositions: A Survey , 2001, MFCS.

[20]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[21]  Toniann Pitassi,et al.  Algorithms and complexity results for #SAT and Bayesian inference , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[22]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[23]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[24]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[25]  Stefan Szeider,et al.  The Linear Arrangement Problem Parameterized Above Guaranteed Value , 2006, CIAC.

[26]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[27]  Peter Jeavons,et al.  The Complexity of Constraint Languages , 2006, Handbook of Constraint Programming.

[28]  Bruno Courcelle,et al.  On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..

[29]  Stefan Szeider,et al.  Fixed-Parameter Complexity of Minimum Profile Problems , 2007, Algorithmica.

[30]  Georg Gottlob,et al.  The complexity of logic-based abduction , 1993, JACM.

[31]  Jörg Flum,et al.  Model-checking problems as a basis for parameterized intractability , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[32]  Marko Samer,et al.  Algorithms for propositional model counting , 2007, J. Discrete Algorithms.

[33]  H. Simonis,et al.  Sudoku as a Constraint Problem , 2005 .

[34]  Georg Gottlob,et al.  Removing Redundancy from a Clause , 1993, Artif. Intell..

[35]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[36]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[37]  Georg Gottlob,et al.  Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..

[38]  Dániel Marx,et al.  Constraint solving via fractional edge covers , 2006, SODA '06.

[39]  Thomas Schwentick,et al.  Generalized hypertree decompositions: np-hardness and tractable variants , 2007, PODS '07.

[40]  Georg Gottlob,et al.  Bounded treewidth as a key to tractability of knowledge representation and reasoning , 2006, Artif. Intell..

[41]  Hans K. Buning,et al.  Propositional Logic: Deduction and Algorithms , 1999 .

[42]  Teodor C. Przymusinski.  Stable semantics for disjunctive programs , 1991, New Generation Computing.

[43]  David Maier,et al.  Testing implications of data dependencies , 1979, SIGMOD '79.

[44]  Stefan Szeider,et al.  On Fixed-Parameter Tractable Parameterizations of SAT , 2003, SAT.

[45]  Georg Gottlob,et al.  Data exchange: computing cores in polynomial time , 2006, PODS '06.

[46]  Kazuo Iwama,et al.  CNF Satisfiability Test by Counting and Polynomial Average Time , 1989, SIAM J. Comput..

[47]  Bart Selman,et al.  On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search , 2003 .

[48]  Georg Gottlob,et al.  Hypertree Decompositions: Structure, Algorithms, and Applications , 2005, WG.

[49]  Miroslaw Truszczynski.  Computing large and small stable models , 2002, Theory Pract. Log. Program..

[50]  Marko Samer,et al.  Constraint satisfaction with bounded treewidth revisited , 2006, J. Comput. Syst. Sci..

[51]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory, Ser. B.

[52]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[53]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[54]  Thomas Schwentick,et al.  When is the evaluation of conjunctive queries tractable? , 2001, STOC '01.

[55]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[56]  Michael R. Fellows,et al.  Descriptive Complexity and the W Hierarchy , 2022 .

[57]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[58]  Stefan Szeider,et al.  Citation for Published Item: Use Policy Minimal Unsatisfiable Formulas with Bounded Clause-variable Difference Are Fixed-parameter Tractable , 2022 .

[59]  Johann A. Makowsky,et al.  Counting truth assignments of formulas of bounded tree-width or clique-width , 2008, Discret. Appl. Math..

[60]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[61]  Naomi Nishimura,et al.  Detecting Backdoor Sets with Respect to Horn and Binary Clauses , 2004, SAT.

[62]  Rolf Niedermeier,et al.  Improved Fixed-Parameter Algorithms for Two Feedback Set Problems , 2005, WADS.

[63]  Pietro Torasso,et al.  On the Relationship between Abduction and Deduction , 1991, J. Log. Comput..

[64]  Hubie Chen,et al.  Beyond Hypertree Width: Decomposition Methods Without Decompositions , 2005, CP.

[65]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[66]  Georg Gottlob,et al.  Computing cores for data exchange: new algorithms and practical solutions , 2005, PODS '05.

[67]  Naomi Nishimura,et al.  Solving #SAT using vertex covers , 2006, Acta Informatica.

[68]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.

[69]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[70]  Randal E. Bryant,et al.  Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors , 2003, J. Symb. Comput..

[71]  Allen Van Gelder,et al.  A perspective on certain polynomial-time solvable classes of satisfiability , 2003, Discret. Appl. Math..

[72]  Teodor C. Przymusinski,et al.  The extended closed world assumption and its relationship to parallel circumscription , 1985, PODS '86.

[73]  Henning Fernau,et al.  2 Contents , 1996 .

[74]  Hans L. Bodlaender,et al.  Discovering Treewidth , 2005, SOFSEM.

[75]  Miroslaw Truszczynski,et al.  Fixed-parameter complexity of semantics for logic programs , 2001, TOCL.

[76]  Mihalis Yannakakis,et al.  On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..

[77]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[78]  Georg Gottlob,et al.  Hypertree width and related hypergraph invariants , 2007, Eur. J. Comb..

[79]  J. McCarthy.  CIRCUMSCRIPTION — A FORM OF NONMONOTONIC REASONING , 2007 .

[80]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[81]  Stefan Szeider,et al.  Backdoor Sets for DLL Subsolvers , 2005, Journal of Automated Reasoning.

[82]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[83]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[84]  Graham Wrightson,et al.  Automation of Reasoning , 1983 .

[85]  Stefan Szeider,et al.  Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference , 2002, Theor. Comput. Sci..

[86]  Meena Mahajan,et al.  Parameterizing MAX SNP Problems Above Guaranteed Values , 2006, IWPEC.

[87]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[88]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[89]  Hans L. Bodlaender,et al.  On Linear Time Minor Tests with Depth-First Search , 1993, J. Algorithms.

[90]  Hans Kleine Büning,et al.  Satisfiable Formulas Closed Under Replacement , 2001, Electron. Notes Discret. Math..

[91]  Alin Deutsch,et al.  Reformulation of XML Queries and Constraints , 2003, ICDT.

[92]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[93]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[94]  Rodney G. Downey,et al.  Parameterized complexity for the skeptic , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[95]  Per Bjesse,et al.  Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers , 2001, CAV.

[96]  Ewald Speckenmeyer,et al.  An Algorithm for the Class of Pure Implicational Formulas , 1999, Discret. Appl. Math..

[97]  Stefan Szeider.  Matched Formulas and Backdoor Sets , 2007, SAT.

[98]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[99]  Armin Biere,et al.  A survey of recent advances in SAT-based formal verification , 2005, International Journal on Software Tools for Technology Transfer.

[100]  Stefan Porschen,et al.  Improving a fixed parameter tractability time bound for the shadow problem , 2003, J. Comput. Syst. Sci..

[101]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[102]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[103]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[104]  Jaroslav Nesetril,et al.  The core of a graph , 1992, Discret. Math..

[105]  Michael Gelfond,et al.  Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..

[106]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[107]  Christophe Lecoutre.  Constraint Networks , 1992 .

[108]  TruszczyńskiMirosław.  Computing large and small stable models , 2002 .

[109]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.