The propositional formula checker HeerHugo
From MaRDI portal
Publication:1977753
DOI10.1023/A:1006366304347zbMath0968.68148MaRDI QIDQ1977753
Joost P. Warners, Jan Friso Groote
Publication date: 1 May 2001
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Related Items (9)
Unnamed Item ⋮ Unnamed Item ⋮ How to fake an RSA signature by encoding modular root finding as a SAT problem ⋮ Equivalent literal propagation in the DLL procedure ⋮ A satisfiability procedure for quantified Boolean formulae ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ Efficient CNF Simplification Based on Binary Implication Graphs ⋮ Failed Literal Detection for QBF ⋮ Transforming equality logic to propositional logic
Uses Software
This page was built for publication: The propositional formula checker HeerHugo
