On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Testing Satisfiability Formulas
Artificial Intelligence Review
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Counting Satisfying Assignments in 2-SAT and 3-SAT
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Determining the Number of Solutions to Binary CSP Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
Counting for Satisfiability by Inverting Resolution
Artificial Intelligence Review
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
New upper bound for the #3-SAT problem
Information Processing Letters
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
A tighter bound for counting max-weight solutions to 2SAT instances
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Approximate resolution of hard numbering problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Probabilistic databases with MarkoViews
Proceedings of the VLDB Endowment
Computing #2SAT and #2UNSAT by binary patterns
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Information Processing Letters
| Hi-index | 5.23 |