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

DOI10.13328/J.CNKI.JOS.005298zbMATH Open1424.68153MaRDI QIDQ5381995FDOQ5381995

Authors: Qiang Wang, Lei Liu, Shuai Lü 

Publication date: 21 June 2019

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

zbMATH Keywords

model countingextension ruleheuristic strategymaxterm spacereduction clause

Mathematics Subject Classification ID

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

Cited In (5)

• Solving \#SAT using extension rules
• Title not available (Why is that?)
• Local search algorithm for solving \#SMT problem
• Title not available (Why is that?)
• Reconstructive algorithm based on extension rule for solving \#SAT incrementally

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)