Using Z3/Python to solve a chess puzzle: place all pieces on a 6x5 board with no attacks.
Exploring the use of SMT solvers and the SMT-LIB language as an intermediate representation (IR) for compiler design and optimization.
Explores combining SMT solvers CVC5 and Z3 using the Nelson-Oppen method, focusing on theory combination and purification.
Introducing a Lean-like syntax parser for the Knuckledragger theorem prover to improve formula readability over verbose Python/Z3Py syntax.
