Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Annals of Mathematics and Artificial Intelligence
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Clause-learning algorithms with many restarts and bounded-width resolution
Journal of Artificial Intelligence Research
Equivalence checking of circuits with parameterized specifications
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Some remarks on the incompressibility of width-parameterized SAT instances
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
For a CNF_\tau, let wb(\tau ) be the bronch-width of its underlying hypergraph. In this paper we design an algorithm for solving SAT in time n^{0(1)} 2^0 (wb(\tau )). This in particular implies a polynomial algorithm for testing satisfiability on instances with tree-width O(log n).Our algorithm is a modification of the width based automated theorem prover (WBATP) which is a popular (at least on the theoretical level) heuristic for finding resolution refutations of unsatisfiable CNFs. We show that instead of the exhaustive enumerotion of all provable clauses, one can do a better search based on the Robertson-Seymour algorithm forapproximating the bronch-width of a graph. We call the resulting procedure Bronch- Width Based Automated Theorem Prover (BWBATP). As opposed to WBATP, it always produces regular refutations. Perhaps more importantly, the running time of our algorithm is boundedin terms of a clean combinatorial charocteristic that can be efficiently approximated, and that the algorithm also produces, within the same time, a satisfying assignment if \tauhappens to be satisfiable.In the second part of the paper we investigate the behavior of BWBATP on the well-studied class of Tseitin tautologies. We argue that in this case BWBATP is better than WBATP. Namely, we show that its running time on any Tseitin tautology \tau is \left| \tau\right|^{0(1)}\cdot 2^{0(w(\tau 1 - 0)} as opposed to the obvious bound n^{0(1)} 2^0 (wb(\tau ))\left| \tau\right|^{0(1)}\cdot 2^{0(w(\tau 1 - 0)} provided by WBATP.This in particular implies that Resolution is automatizable on those Tseitin tautologies for which we know the relation w(\tau 1 - 0) \leqslant 0(\log S(\tau )). We identify one such subclass and prove partial results toward establishing this relation for larger classes of graphs.