Abstract
We present work that we have done so far towards devising a method for solving a specific case of SAT problems: UNSAT 3-SAT. Our goal is not to improve general SAT solving, but to focus on improving current techniques to solve 3- SAT and instances which have 2-SAT and 3-SAT structures within them. We have restricted ourselves to UNSAT instances. Even with these restrictions, these types of instances are still important, as such occur in practice (e.g. Velev’s hardware verification instances [5]).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5), 506–521 (1999)
Gil, L., Flores, P., Silveira, L.M.: PMSat: a parallel version of minisat. Journal on Satisfiability, Boolean Modeling and Computation 6, 71–98 (2008)
Moskewicz, W.M., Madigan, F.C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, DAC 2001. ACM, New York (2001)
Miroslav Velev’s SAT Benchmarks, http://www.miroslav-velev.com/sat_benchmarks.html
Kullmann, O.: Fundaments of Branching Heuristics. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. IOS Press (February 2009)
Heule, M., van Maaren, H.: Look-Ahead Based SAT Solvers. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. IOS Press (February 2009)
Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In: IJCAI 2001 Proceedings of the 17th International Joint Conference on Artificial Intelligence, vol. 1, pp. 971–978. Morgan Kaufmann Publishers Inc, San Francisco (2001) ISBN:1-55860-812-5 978-1-558-60812-2
Hyvärinen, A.E.J., Junttila, T.A., Niemelä, I.: A Distribution Method for Solving SAT in Grids. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 430–435. Springer, Heidelberg (2006)
Heule, M., Kullmann, O., Wieringa, S., Biere, A.: Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. In: 7th Intl. Haifa Verification Conference (HVC 2011), Haifa, Israel (December 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demirović, E., Gavranović, H. (2012). An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition. In: Cimatti, A., Sebastiani, R. (eds) Theory and Applications of Satisfiability Testing – SAT 2012. SAT 2012. Lecture Notes in Computer Science, vol 7317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31612-8_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-31612-8_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31611-1
Online ISBN: 978-3-642-31612-8
eBook Packages: Computer ScienceComputer Science (R0)