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...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 657; pp. 28 - 37
Main Authors: Wang, Jinyan, Yin, Minghao, Wu, Jingli
Format: Journal Article
Language:English
Published: Elsevier B.V 02.01.2017
Subjects:
Extension rule
Model counting
Propositional satisfiability
Resolution principle
Extension rule
Propositional satisfiability
Model counting
Resolution principle
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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