The following pages link to HeerHugo (Q21683):
Displaying 17 items.
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Equivalent literal propagation in the DLL procedure (Q1408382) (← links)
- Persistent and quasi-persistent lemmas in propositional model elimination (Q1430298) (← links)
- Efficient data structures for backtrack search SAT solvers (Q1777399) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- The propositional formula checker HeerHugo (Q1977753) (← links)
- Extended resolution simulates binary decision diagrams (Q2478427) (← links)
- (Q2741519) (← links)
- (Q2741533) (← links)
- (Q2749861) (← links)
- Efficient CNF Simplification Based on Binary Implication Graphs (Q3007684) (← links)
- Failed Literal Detection for QBF (Q3007688) (← links)
- (Q4427904) (← links)
- Transforming equality logic to propositional logic (Q4916229) (← links)
- Verification of Timed Automata via Satisfiability Checking (Q5392293) (← links)
- Logics in Artificial Intelligence (Q5394165) (← links)
