Name
Abstract | ||
|---|---|---|
Resolution principle is an important rule of inference in theorem proving. Model counting using extension rule is considered as a counterpart to resolution-based methods for model counting. Based on the exact method, this paper proposes two approximate model counting algorithms, and proves the time complexity of the algorithms. Experimental results show that they have good performance in the accuracy and efficiency. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-19647-3_22 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
Propositional satisfiability,Model counting,Resolution principle,Extension rule | Conference | 9130 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinyan Wang | 1 | 1 | 0.69 |
| Minghao Yin | 2 | 31 | 25.97 |
| Jingli Wu | 3 | 3 | 3.15 |