Similar Items: Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
- Extracting verified decision procedures: DPLL and Resolution
- A Flexible Proof Format for SAT Solver-Elaborator Communication
- Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
- Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
- SAT-Inspired Higher-Order Eliminations
- Revisiting SAT-based Solvers: MaxSAT Rules and Core Sequences