When satisfiability solving meets symbolic computation
When satisfiability solving meets symbolic computation Page 1 64 COMMUNICATIONS OF
THE ACM | JULY 2022 | VOL. 65 | NO. 7 review articles MATHEMATICIANS HAVE LONG …
THE ACM | JULY 2022 | VOL. 65 | NO. 7 review articles MATHEMATICIANS HAVE LONG …
A SAT solver and computer algebra attack on the minimum kochen-specker problem
One of the foundational results in quantum mechanics is the Kochen-Specker (KS) theorem,
which states that any theory whose predictions agree with quantum mechanics must be …
which states that any theory whose predictions agree with quantum mechanics must be …
A SAT-based Resolution of Lam's Problem
C Bright, KKH Cheung, B Stevens, I Kotsireas… - Proceedings of the …, 2021 - ojs.aaai.org
In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's
problem from projective geometry—the long-standing problem of determining if a projective …
problem from projective geometry—the long-standing problem of determining if a projective …
Unsatisfiability proofs for weight 16 codewords in Lam's problem
C Bright, KKH Cheung, B Stevens, I Kotsireas… - arxiv preprint arxiv …, 2020 - arxiv.org
In the 1970s and 1980s, searches performed by L. Carter, C. Lam, L. Thiel, and S. Swiercz
showed that projective planes of order ten with weight 16 codewords do not exist. These …
showed that projective planes of order ten with weight 16 codewords do not exist. These …
Nonexistence certificates for ovals in a projective plane of order ten
C Bright, KKH Cheung, B Stevens, I Kotsireas… - … Workshop, IWOCA 2020 …, 2020 - Springer
In 1983, a computer search was performed for ovals in a projective plane of order ten. The
search was exhaustive and negative, implying that such ovals do not exist. However, no …
search was exhaustive and negative, implying that such ovals do not exist. However, no …
Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)
This report documents the program and the outcomes of Dagstuhl Seminar 23161" Pushing
the Limits of Computational Combinatorial Constructions". In this Dagstuhl Seminar, we …
the Limits of Computational Combinatorial Constructions". In this Dagstuhl Seminar, we …
[HTML][HTML] When Satisfiability Solving Meets Symbolic Computation The science of less-than-brute force.
Mathematicians have long been fascinated by objects that exhibit exceptionally nice
combinatorial properties. However, it is often difficult to determine whether objects satisfying …
combinatorial properties. However, it is often difficult to determine whether objects satisfying …
[PDF][PDF] Lam's problem benchmarks for the SAT competition 2020
Lam’s problem benchmarks for the SAT competition 2020 Page 92 Lam’s Problem Benchmarks
for the SAT Competition 2020 Curtis Bright Carleton University & University of Waterloo Ottawa …
for the SAT Competition 2020 Curtis Bright Carleton University & University of Waterloo Ottawa …
[PDF][PDF] Integer and Constraint Programming
ND Rubin - 2022 - cs.curtisbright.com
In this project we use the mathematical programming paradigms of integer and constraint
programming to solve the Mutually Orthogonal Latin Squares problems for sets of two and …
programming to solve the Mutually Orthogonal Latin Squares problems for sets of two and …
[PDF][PDF] Solving Lam's Problem via SAT and Isomorph-Free Exhaustive Generation
C Bright, KKH Cheung, B Stevens, I Kotsireas… - 2022 - cs.curtisbright.com
Lam's problem is to prove the nonexistence of a type of geometric structure that has
intrigued mathematicians for centuries. In this work we reduce Lam's problem to a Boolean …
intrigued mathematicians for centuries. In this work we reduce Lam's problem to a Boolean …