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

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!