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

DOI10.13328/J.CNKI.JOS.005298MaRDI QIDQ5381995zbMATH OpenFDO

Authors Qiang Wang, Lei Liu, Shuai Lü

Publication date 21 June 2019

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

zbMATH Keywords

extension ruleheuristic strategymaxterm spacemodel countingreduction clause

Mathematics Subject Classification ID

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

Recommendations

• Solving \#SAT using extension rules
• Reconstructive algorithm based on extension rule for solving \#SAT incrementally
• Principles and Practice of Constraint Programming – CP 2004
• Solving #SAT and MAXSAT by Dynamic Programming
• Algorithms for Propositional Model Counting

Cited in

(5)

• Local search algorithm for solving \#SMT problem
• Reconstructive algorithm based on extension rule for solving \#SAT incrementally
• Solving \#SAT using extension rules
• scientific article; zbMATH DE number 6519724 (Why is no real title available?)
• scientific article; zbMATH DE number 6874827 (Why is no real title available?)

This page was built for publication: \#SAT solving algorithms based on extension rule using heuristic strategies

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