Boolean satisfiability in electronic design automation
Proceedings of the 37th Annual Design Automation Conference
SATIRE: a new incremental satisfiability engine
Proceedings of the 38th annual Design Automation Conference
Satisfiability models and algorithms for circuit delay computation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Verification of Timed Automata via Satisfiability Checking
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Coordination of a Parallel Proposition Solver
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
Algebraic Simplification Techniques for Propositional Satisfiability
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
HeerHugo is a propositional formula checker that determines whether a given formula is satisfiable or not. Its main ingredient is the branch/merge rule, that is inspired by an algorithm proposed by St\a{a}llmarck, which is protected by a software patent. The algorithm can be interpreted as a breadth first search algorithm. HeerHugo differs substantially from St\a{a}llmarck''s algorithm, as it operates on formulas in conjunctive normal form and it is enhanced with many logical rules including unit resolution, 2--satisfiability tests and additional systematic reasoning techniques In this paper, the main elements of the algorithm are discussed, and its remarkable effectiveness is illustrated with some examples and computational results.