A bottom-up algorithm for solving ♯2SAT

DOI10.1093/JIGPAL/JZAA009zbMath1497.68357OpenAlexW3022611987MaRDI QIDQ3386918

J. A. Hernández-Servín, Guillermo de Ita, J. Raymundo Marcial-Romero

Publication date: 8 January 2021

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzaa009

zbMATH Keywords

graph decompositioncounting modelsenumerative algorithm\#2SAT

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computational aspects of satisfiability (68R07)

This page was built for publication: A bottom-up algorithm for solving ♯2SAT