Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles
We benchmark traditional SAT Solvers and modern SMT Solvers against each other with 25x25 Sudoku, deriving insights on the evolution of satisfiability.
Jan 15, 2025
RBlocks: Block Programming IDE for R
RBlocks is a block-based R IDE designed to be an introductory programming interface for Statistics students.
Jan 2, 2025
Online Learning for Neural Network Verification
This ongoing research explores the application of online learning techniques to improve neural network verification efficiency. By developing reinforcement learning methods that adapt branching strategies during verification, we aim to significantly reduce computational costs while maintaining formal guarantees. Our work extends the Marabou verification framework with learned decision heuristics that show promise for overcoming scalability challenges in neural network safety verification.
Dec 1, 2024
Optimizations on the Stalmarck Procedure
We make optimizations in the form of clause learning and directional heuristics on the Stålmarck procedure for boolean satisfiability. This research explores how modern SAT solving techniques can enhance the classical Stålmarck algorithm, making it more practical for industry applications.
Mar 1, 2024