Inclusion-exclusion for k-CNF formulas
Information Processing Letters
Counting for Satisfiability by Inverting Resolution
Artificial Intelligence Review
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
Approximate resolution of hard numbering problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Model counting using the inclusion-exclusion principle
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Computing #2SAT and #2UNSAT by binary patterns
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
Hi-index | 0.89 |