Abstract
In this paper we present an implementation (markSAT) for computing #2SAT via graph transformations. For that, we transform the input formula into a graph and test whether it is which we call a cactus graph. If it is not the case, the formula is decomposed until cactus sub-formulas are obtained. We compare the efficiency of markSAT against sharpSAT which is the leading sequential algorithm in the literature for computing #SAT obtaining better results with our proposal.
Cite
CITATION STYLE
López, M. A., Marcial-Romero, J. R., De Ita, G., & Valdovinos, R. M. (2018). A fast and efficient method for #2SAT via graph transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10632 LNAI, pp. 95–106). Springer Verlag. https://doi.org/10.1007/978-3-030-02837-4_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
