A Parallel Extension Rule-Based Algorithm for #SAT Problem Using Model-Counting Tree

The #SAT problem, which is also called model counting, is one of the most important problems in artificial intelligence and is challenging to the researchers. The model counting based on extension rule (CER) algorithm is an exact algorithm for model counting. The weak point of the algorithm is the h...

Ausführliche Beschreibung