Two approximate algorithms for model counting

Model counting is the problem of computing the number of models or satisfying assignments for a given propositional formula, and is #P-complete. Owing to its inherent complexity, approximate model counting is an alternative in practice. Model counting using the extension rule is an exact method, and...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 657; s. 28 - 37
Hlavní autori: Wang, Jinyan, Yin, Minghao, Wu, Jingli
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 02.01.2017
Predmet:
Extension rule
Model counting
Propositional satisfiability
Resolution principle
Extension rule
Propositional satisfiability
Model counting
Resolution principle
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Model counting is the problem of computing the number of models or satisfying assignments for a given propositional formula, and is #P-complete. Owing to its inherent complexity, approximate model counting is an alternative in practice. Model counting using the extension rule is an exact method, and is considered as an alternative to resolution-based methods for model counting. Based on the exact method, we propose two approximate model counting algorithms, and prove the time complexity of the algorithms. Experimental results show that they have good performance in the accuracy and efficiency.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2016.04.047