Search Results for author:
Found 6 papers, 2 papers with code
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
We perform an extensive comparison of AlphaMapleSAT against the March CnC solver on challenging combinatorial problems such as the minimum Kochen-Specker and Ramsey problems.
Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares
Both programming paradigms have previously successfully been used to search for MOLS, but solvers for IP and CP solvers have significantly improved in recent years and data on how modern IP and CP solvers perform on the MOLS problem is lacking.
A SAT-based Resolution of Lam's Problem
In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry$\unicode{x2014}$the long-standing problem of determining if a projective plane of order ten exists.
SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics
By combining the search power of SAT with the deep mathematical knowledge in CASs we can solve many problems in mathematics that no other known methods seem capable of solving.
Effective problem solving using SAT solvers
In this article we demonstrate how to solve a variety of problems and puzzles using the built-in SAT solver of the computer algebra system Maple.
A New Form of Williamson's Product Theorem
A form of Williamson's product theorem which applies to Williamson matrices of even order is presented.
Combinatorics
