An enumerative algorithm for \#2SAT

DOI10.1016/j.endm.2014.08.012zbMath1337.68196OpenAlexW2094368491MaRDI QIDQ283678

Yolanda Moyao, Guillermo de Ita Luna, J. Raymundo Marcial-Romero

Publication date: 13 May 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.08.012

zbMATH Keywords

\#SAT problemcounting modelsefficient countingenumerative algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Counting models for 2SAT and 3SAT formulae
• On the hardness of approximate reasoning
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: An enumerative algorithm for \#2SAT