Width-Based Algorithms for SAT and CIRCUIT-SAT
We investigate theoretical and practical aspects of algorithms for CIRCUIT-SAT and SAT based on combinatorial parameters. Two such algorithms are given in  and  based on branch-width of a hypergraph and cut-width of a graph respectively. We give theoretical generalizations and improvements to the cut-width-based algorithm in  in terms of many other well-known width-like parameters. In particular, we have polynomial-time backtrack search algorithms for logarithmic cut-width and path-width, nO(logn)-time backtrack search algorithms for logarithmic tree-width and branch-width, and a polynomial-time regular resolution refutation for logarithmic tree-width. We investigate the effectiveness of the algorithm in  on practical instances of CIRCUIT-SAT arising in the context of Automatic Test Pattern Generation (ATPG).
Unable to display preview. Download preview PDF.
- 1.Alekhnovich, M., Razborov, A.: Satisfiability, Branch-width, and Tseitin Tautologies. In: 43rd Symp. Foundations of Computer Science (FOCS), pp. 593–603 (2002)Google Scholar
- 3.Cook, W., Seymour, P.: Tour Merging via Branch-Decompistion (December 18, 2002) (manuscript)Google Scholar
- 5.Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2000)Google Scholar