Counting truth assignments of formulas of bounded tree-width or clique-width

Discrete Applied Mathematics

Volumn 156, Issue 4, 2008, Pages 511-529

  Fischer, E ^a   Makowsky, J A ^a   Ravve, E V ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Tower Semiconductors Ltd ^*  (Israel)

Author keywords

Clique width; Counting problems; Fixed parameter tractable (FPT); Satisfiability (SAT); Tree width

Indexed keywords

ALGORITHMS; NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING;

CLIQUE-WIDTH; COUNTING PROBLEMS; FIXED PARAMETER TRACTABLE (FPT); TREE-WIDTH;

TREES (MATHEMATICS);

EID: 38349043759     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.06.020     Document Type: Article

References (60)

1. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley, Reading, MA
2. Alekhnovich M., and Razborov A. Satisfiability, branch-width and Tseitin tautologies. Proceedings of the 43rd Annual Symposium on the Foundations of Computer Science (FOCS 2002), Vancouver, British Columbia, Canada (2002), IEEE Computer Society Press, Silver Spring, MD 593-603
3. Amir E. (de)Composition of situation calculus theories. Proceedings of the National Conference on Artificial Intelligence (AAAI'00) (2000), AAAI Press, MIT Press, Cambridge, MA 456-463
4. E. Amir, Dividing and conquering logic, Ph.D. Thesis, Department of Computer Science, Stanford University, 2001.
5. E. Amir, Efficient approximation for triangulation of minimum treewidth, in: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, Morgan Kaufmann Publishers Inc., 2001, pp. 7-15.
6. Amir E., and McIlraith S. Theorem proving with structured theories. Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI'01) (2001) 624-631
7. Amir E., and McIlraith S. Partition-based logical reasoning for first-order and propositional theories. Artificial Intelligence 162 1-2 (2005) 49-88
8. Andrzejak A. Splitting formulas for Tutte polynomials. J. Combin. Theory Ser. B 70 2 (1997) 346-366
9. Arnborg S., Corneil D.G., and Proskurowski A. Complexity of finding embedding in a k-tree. SIAM. J. Algebraic Discrete Methods 8 (1987) 277-284
10. Atserias A., and Dalmau V. A combinatorial characterization of resolution width. Proceedings of the 18th IEEE Conference on Computational Complexity (CCC 2003), Aarhus, Denmark (2003) 239-247
11. P. Bjesse, J. Kukula, R. Damiano, T. Stanion, Y. Zhu, Guiding SAT diagnosis with tree decompositions, in: E. Giunchiglia, A. Tacchella (Eds.), Theory and Applications of Satisfiability Testing: Sixth International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers, Lecture Notes in Computer Science, vol. 2919, Springer, Berlin, 2004, pp. 315-329.
12. Blumensath A., and Courcelle B. Recognizability, hypergraph operations, and logical types. Inform. and Comput. 204 6 (2006) 853-919
13. Bodlaender H. Treewidth: algorithmic techniques and results. In: Privara I., and Ruzicka P. (Eds). Proceedings of the 22nd International Symposium on the Mathematical Foundation of Computer Science, MFCS'97, Lecture Notes in Computer Science vol. 1295 (1997), Springer, Berlin 29-36
14. Bollobás B. Modern Graph Theory (1999), Springer, Berlin
15. Chvátal V., and Szemerédi E. Many hard examples for resolution. J. ACM 35 4 (1988) 759-768
16. Cohen P., Schrag P., JOnes R., Pease E., Lin A., Starr A., Gunning B., and Burke M. The DARPA high-performance knowledge base project. AI Magazine 19 4 (1998) 25-49
17. Corneil D.G., Habib M., Lanlignel J.-M., Reed B., and Rotics U. Polynomial time recognition of clique-width ≤ 3 graphs. Proceedings of LATIN'2000, Lecture Notes in Computer Science vol. 1776 (2000), Springer, Berlin 126-134
18. Courcelle B. Monadic second-order logic of graphs VII: graphs as relational structures. Theoret. Comput. Sci. 101 (1992) 3-33
19. Courcelle B. The monadic second order logic of graphs, XIV: uniformly sparse graphs and edge set quantification. Theoret. Comput. Sci. 299 1 (2003) 1-36
20. Courcelle B., and Engelfriet J. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Math. Systems Theory 28 (1995) 515-552
21. Courcelle B., Engelfriet J., and Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46 (1993) 218-270
22. Courcelle B., and Makowsky J.A. Fusion on relational structures and the verification of monadic second order properties. Math. Structures Comput. Sci. 12 2 (2002) 203-235
23. Courcelle B., Makowsky J.A., and Rotics U. On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. Discrete Appl. Math. 108 1-2 (2001) 23-52
24. Courcelle B., and Mosbah M. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109 (1993) 49-82
25. Courcelle B., and Olariu S. Upper bounds to the clique-width of graphs. Discrete Appl. Math. 101 (2000) 77-114
26. Creignou N., and Hermann M. Complexity of generalized satisfiability counting problems. Inform. and Comput. 125 (1996) 1-12
27. Creignou N., Khanna S., and Sudhan M. Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monographs on Discrete Mathematics and Applications (2001), SIAM, Philadelphia, PA
28. Dechter R., and Pearl J. The clustering for constraint networks. Artificial Intelligence 38 (1999) 353-366
29. Diestel R. Graph Theory, Graduate Texts in Mathematics (1996), Springer, Berlin
30. Downey R.G., and Fellows M.F. Parametrized Complexity (1999), Springer, Berlin
31. Engelfriet J., and van Oostrom V. Logical description of context-free graph-languages. J. Comput. System Sci. 55 (1997) 489-503
32. Feder T., and Vardi M. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput. 28 (1999) 57-104
33. Frick M., and Grohe M. The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130 1 (2004) 3-31
34. Galil Z. On the complexity of regular resolution and the Davis-Putnam procedure. Theoret. Comput. Sci. 4 (1977) 23-46
35. Garey M.G., and Johnson D.S. Computers and Intractability, Mathematical Series (1979), W.H. Freeman and Company, New York
36. Glikson A., and Makowsky J.A. NCE graph grammars and clique-width. In: Bodlaender H.L. (Ed). Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), Elspeet, The Netherlands, Lecture Notes in Computer Science vol. 2880 (2003), Springer, Berlin 237-248
37. Golumbic M.C., and Rotics U. On the clique-width of some perfect graph classes. Internat. J. Foundations Comput. Sci. 11 (2000) 423-443
38. Gottlob G., and Pichler R. Hypergraphs in model checking: acyclicity and hypertree-width versus clique-width. 28th International Colloquium on Automata, Languages and Programming, ICALP'01, Lecture Notes in Computer Science vol. 2077 (2001), Springer, Berlin 708-719
39. Haken A. The intractability of resolution. Theoret. Comput. Sci. 39 (1985) 297-308
40. Itai A., and Makowsky J.A. Unification as a complexity measure for logic programming. J. Logic Programming 4 2 (1987) 105-117
41. Johnson D.S., Yannakakis M., and Papadimitriou C.H. On generating all maximal independent sets. Inform. Process. Lett. 27 3 (1988) 119-123
42. Lenat D.B. Cyc: a large-scale investment in knowledge infrastructure. Comm. ACM 38 11 (1995) 33-38
43. Makowsky J.A. Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width. Proceedings of the 12th Symposium on Discrete Algorithms (2001), SIAM, Philadelphia, PA 487-495
44. Makowsky J.A. Algorithmic uses of the Feferman-Vaught theorem. Ann. Pure Appl. Logic 126 (2004) 1-3
45. Makowsky J.A. Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width. Discrete Appl. Math. 145 2 (2005) 276-290
46. Makowsky J.A., and Mariño J.P. Farrell polynomials on graphs of bounded treewidth. Adv. in Appl. Math. 30 (2003) 160-176
47. Makowsky J.A., and Mariño J.P. Tree-width and the monadic quantifier hierarchy. Theoret. Comput. Sci. 303 (2003) 157-170
48. 4's. Internat. J. Foundations Comput. Sci. 10 (1999) 329-348
49. Negami S. Polynomial invariants of graphs. Trans. Amer. Math. Soc. 299 (1987) 601-622
50. Noble S.D. Evaluating the Tutte polynomial for graphs of bounded tree-width. Combin. Probab. Comput. 7 (1998) 307-321
51. Oum S., and Seymour P. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96 4 (2006) 514-528
52. Oxley J.G., and Welsh D.J.A. Tutte polynomials computable in polynomial time. Discrete Math. 109 (1992) 185-192
53. Papadimitriou C. Computational Complexity (1994), Addison-Wesley, Reading, MA
54. Schaefer T.J. The complexity of satisfiability problems. Proceedings 10th Symposium on Theory of Computing (STOC'78), San Diego, California, USA (1978) 216-226
55. Szeider S. On fixed-parameter tractable parameterizations of SAT. Sixth International Conference on Theory and Applications of Satisfiability Testing, (SAT'03) S. Margherita Ligure, Italy, Lecture Notes in Computer Science (2003), Springer, Berlin 188-202
56. Thorup M. Structured programs have small tree-width and good register allocation. Inform. and Comput. 142 (1998) 159-181
57. Traldi L. On the colored Tutte polynomial of a graph of bounded treewidth. Discrete Appl. Math. 154 6 (2006) 1032-1036
58. G.S. Tseitin, On the complexity of derivation in propositional calculus, in: A.O. Slisenko (Ed.), Structures in Constructive Mathematics and Mathematical Logic, Part II, 1968, pp. 115-125 (Translation from Russian).
59. Valiant L.G. The complexity of enumeration and reliability problems. SIAM J. Comput. 8 3 (1979) 410-421
60. Zhu Y., Wang D., Clarke E., and Kukula J. Using cutwidth to improve symbolic simulation and boolean satisfiability. Proceedings of the Sixth IEEE International High-Level Design Validation and Test Workshop (HLDVT'01) (2001), IEEE Computer Society, Silver Spring, MD 165-170