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]). © 2012 Springer-Verlag.
Cite
CITATION STYLE
Demirović, E., & Gavranović, H. (2012). An efficient method for solving UNSAT 3-SAT and similar instances via static decomposition (Poster presentation). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7317 LNCS, pp. 489–490). https://doi.org/10.1007/978-3-642-31612-8_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
