Improved Techniques for Estimating Signal Probabilities
IEEE Transactions on Computers
IEEE Transactions on Computers
Space complexity in propositional calculus
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An exponential separation between regular and general resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution Proofs of Matching Principles
Annals of Mathematics and Artificial Intelligence
Solution of Switching Equations Based on a Tabular Algebra
IEEE Transactions on Computers
The Complexity of Resolution with Generalized Symmetry Rules
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimality of size-width tradeoffs for resolution
Computational Complexity
Homomorphisms of conjunctive normal forms
Discrete Applied Mathematics - The renesse issue on satisfiability
Mutilated chessboard problem is exponentially hard for resolution
Theoretical Computer Science
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
Annals of Mathematics and Artificial Intelligence
The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas
Annals of Mathematics and Artificial Intelligence
Complexities of homomorphism and isomorphism for definite logic programs
Journal of Computer Science and Technology
Discrete Applied Mathematics
Symmetry Breaking for Maximum Satisfiability
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
An Exponential Lower Bound for Width-Restricted Clause Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
SymChaff: a structure-aware satisfiability solver
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability II: theory
Journal of Artificial Intelligence Research
Breaking instance-independent symmetries in exact graph coloring
Journal of Artificial Intelligence Research
On the complexity of extending ground resolution with symmetry rules
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Understanding the power of clause learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Local symmetry breaking during search in CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Regular and general resolution: an improved separation
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Optimality of size-degree tradeoffs for polynomial calculus
ACM Transactions on Computational Logic (TOCL)
Symmetry-breaking answer set solving
AI Communications - Answer Set Programming
Exploiting symmetry in SMT problems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
A Near-Optimal Separation of Regular and General Resolution
SIAM Journal on Computing
Reasoning by dominance in not-equals binary constraint networks
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Pool resolution and its relation to regular resolution and DPLL with clause learning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Input distance and lower bounds for propositional resolution proof length
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Lower bounds for width-restricted clause learning on small width formulas
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Preliminary report on input cover number as a metric for propositional resolution proofs
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Lower bounds for width-restricted clause learning on formulas of small width
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
An improved separation of regular resolution from pool resolution and clause learning
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |