Similar Items: Formalization of Abstract State Transition Systems for SAT
- Abstract Completion, Formalized
- URSA: A System for Uniform Reduction to SAT
- Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions
- SAT-Inspired Higher-Order Eliminations
- Local Redundancy in SAT: Generalizations of Blocked Clauses
- Formal Languages, Formally and Coinductively