Abstract
Although several tractable classes of SAT are known, none of these turns out to be easy for optimization, probabilistic and counting versions of SAT. These problems can be solved efficiently for formulas with bounded treewidth. However, the resulting time bounds are exponential in the treewidth, which means exponential in the size of the largest clause.
In this paper we show that solution methods for formulas with treewidth two can be combined with specialized techniques for dealing with “long” clauses, thus obtaining time bounds independent of the treewidth. This leads to the definition of a new class of tractable instances for SAT and its extensions. This class is related to a particular class of reducible hypergraphs, that extends partial 2-trees and hypertrees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersen, K.A., Pretolani, D.: Easy Cases of Probabilistic Satisfiability. Annals of Mathematics and A.I. 33(1), 69–91 (2001)
Bacchus, F., Dalmao, S., Pitassi, T.: DPLL with Caching: A new algorithm for #SAT and Bayesian Inference., ECCC Report TR03-003 (2003), Available at http://eccc.uni-trier.de/eccc-local/Lists/TR-2003.html
Baioletti, M., Capotorti, A., Tulipani, S., Vantaggi, B.: Elimination of Boolean variables for Probabilistic Coherence. Soft Computing 4(2), 81–88 (2000)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1–46 (1998)
Crama, Y., Hansen, P., Jaumard, B.: The Basic Algorithm for pseudo-Boolean programming revisited. Discrete Applied Mathematics 29, 171–185 (1990)
Knuth, D.: Nested Satisfiability. Acta Informatica 28, 1–6 (1990)
Kratochvíl, J., Křivánek, M.: Satisfiability of co-nested formulas. Acta Informatica 30, 397–403 (1993)
Nilsson, N.J.: Probabilistic Logic. Artificial Intelligence 28, 71–87 (1986)
Pretolani, D.: Probability Logic and Optimization SAT: the PSAT and CPA Models. Presented at SAT 2002, Cincinnati, Ohio (May 2002), Accepted for publication in Annals of Mathematics and A.I.
Schlipf, J.S., Annexstein, F.S., Franco, J.V., Swaminathan, R.P.: On finding solutions for extended Horn formulas. Information Processing Letters 54, 133–137 (1995)
van Maaren, H.: A Short Note on Some Tractable Cases of the Satisfiability Problem. Information and Computation 158, 125–130 (2000)
Szeider, S.: On fixed-parameter tractable parametrizations of SAT. In: Proceedings of the Sixth Int. Conf. on Theory and Applications of Satisfiability Testing, S.Margherita Ligure, Italy, May 5-8, pp. 108–116 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pretolani, D. (2004). Hypergraph Reductions and Satisfiability Problems. In: Giunchiglia, E., Tacchella, A. (eds) Theory and Applications of Satisfiability Testing. SAT 2003. Lecture Notes in Computer Science, vol 2919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24605-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-24605-3_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20851-8
Online ISBN: 978-3-540-24605-3
eBook Packages: Springer Book Archive