Reconstructive algorithm based on extension rule for solving \#SAT incrementally

DOI10.13328/J.CNKI.JOS.004827MaRDI QIDQ2993243zbMATH OpenFDO

Authors Fengyu Jia, Dantong Ouyang, Siguang Liu, Liming Zhang

Publication date 10 August 2016

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.004827

zbMATH Keywords

complementary tableextension ruleincremental methodmaximum term intersectionmodel counting

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• \#SAT solving algorithms based on extension rule using heuristic strategies
• Solving \#SAT using extension rules
• A bottom-up algorithm for solving \#2SAT
• An enumerative algorithm for \#2SAT
• Algorithms for Propositional Model Counting

Cited in

(2)

• Solving \#SAT using extension rules
• \#SAT solving algorithms based on extension rule using heuristic strategies

This page was built for publication: Reconstructive algorithm based on extension rule for solving \#SAT incrementally

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