Cited in
(23)- Verification of timed automata via satisfiability checking
- scientific article; zbMATH DE number 1979551 (Why is no real title available?)
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- Persistent and quasi-persistent lemmas in propositional model elimination
- Efficient CNF simplification based on binary implication graphs
- Efficient data structures for backtrack search SAT solvers
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Logics in Artificial Intelligence
- Extended resolution simulates binary decision diagrams
- Transforming equality logic to propositional logic
- tascpl
- SatEx
- LPTP
- SATO
- Leibniz
- ZRes
- The propositional formula checker HeerHugo
- The propositional formula checker HeerHugo
- A complete adaptive algorithm for propositional satisfiability
- Failed literal detection for QBF
- SatEx: A web-based framework for SAT experimentation
- Towards an efficient library for SAT: A manifesto
- Equivalent literal propagation in the DLL procedure
This page was built for software: HeerHugo
