Solving \#SAT using extension rules

DOI10.3724/SP.J.1001.2009.03320MaRDI QIDQ3054232zbMATH OpenFDO

Authors Minghao Yin, Hai Lin, Jigui Sun

Publication date 5 November 2010

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1001.2009.03320

zbMATH Keywords

knowledge compilationextension ruleweighted model counting

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• \#SAT solving algorithms based on extension rule using heuristic strategies
• Reconstructive algorithm based on extension rule for solving \#SAT incrementally
• Two approximate algorithms for model counting
• Approximate model counting via extension rule
• Algorithms for Propositional Model Counting

Cited in

(7)

• Inferring Congruence Equations Using SAT
• SAT problems with chains of dependent variables
• Local search algorithm for solving \#SMT problem
• Reconstructive algorithm based on extension rule for solving \#SAT incrementally
• Approximate model counting via extension rule
• \#SAT solving algorithms based on extension rule using heuristic strategies
• Two approximate algorithms for model counting

This page was built for publication: Solving \#SAT using extension rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3054232)