Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Polynomially solvable satisfiability problems
Information Processing Letters
Compact normal forms in propositional logic and integer programming formulations
Computers and Operations Research
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Data Structures and Algorithms
Data Structures and Algorithms
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Stålmarck's Algorithm as a HOL Derived Rule
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Proceedings of the 38th annual Design Automation Conference
SAT and ATPG: algorithms for Boolean decision problems
Logic Synthesis and Verification
Theorem Proving for Verification
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
CL '00 Proceedings of the First International Conference on Computational Logic
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Theorem proving for verification
Modeling and verification of parallel processes
Journal of Symbolic Computation
How to fake an RSA signature by encoding modular root finding as a SAT problem
Discrete Applied Mathematics - The renesse issue on satisfiability
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics - The renesse issue on satisfiability
A satisfiability procedure for quantified boolean formulae
Discrete Applied Mathematics - The renesse issue on satisfiability
Annals of Mathematics and Artificial Intelligence
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
Annals of Mathematics and Artificial Intelligence
Efficient CNF simplification based on binary implication graphs
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Failed literal detection for QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Extended failed-literal preprocessing for quantified boolean formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
HeerHugo is a propositional formula checker that determines whether a given formula is satisfiable or not. The underlying algorithm is based on a specific breadth-first search procedure, with several enhancements including unit resolution and 2-satisfiability tests. Its main ingredient is the branch/merge rule inspired by an algorithm proposed by Stållmarck, which is protected by a software patent. In this paper, the main elements of the algorithm are discussed, and its remarkable effectiveness is illustrated with some examples and computational results.