The Unison algorithm: fast evaluation of Boolean expressions
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Reductions for non-clausal theorem proving
Theoretical Computer Science
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Solving Satisfiability Via Boltzmann Machines
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Improved SAT Algorithm in Terms of Formula Length
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Extension Rule for Non-Clausal Propositional Calculus
Fundamenta Informaticae
Approximate Inference In Default Logic And Circumscription
Fundamenta Informaticae
| Hi-index | 0.00 |