HeerHugo
From MaRDI portal
swMATH9704MaRDI QIDQ21683FDOQ21683
Author name not available (Why is that?)
Official website: http://www.win.tue.nl/~jfg/heerhugo.html
Cited In (22)
- Title not available (Why is that?)
- Extended resolution simulates binary decision diagrams
- SatEx: A web-based framework for SAT experimentation
- Towards an efficient library for SAT: A manifesto
- Logics in Artificial Intelligence
- Equivalent literal propagation in the DLL procedure
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- The propositional formula checker HeerHugo
- The propositional formula checker HeerHugo
- Persistent and quasi-persistent lemmas in propositional model elimination
- Failed literal detection for QBF
- Verification of timed automata via satisfiability checking
- Efficient CNF simplification based on binary implication graphs
- tascpl
- SatEx
- SATO
- Leibniz
- ZRes
- A complete adaptive algorithm for propositional satisfiability
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Transforming equality logic to propositional logic
- Efficient data structures for backtrack search SAT solvers
This page was built for software: HeerHugo
