AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

A SAT+CAS Method for Enumerating Williamson Matrices of Even Order

Curtis Bright, Ilias Kotsireas, Vijay Ganesh

AAAI 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 16 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace CNF encoding of Williamson conditions with programmatic PSD-based clause learning (ablation)MapleSAT in SAT+CAS pipeline · Williamson enumeration n=50SAT solving time (h): 98.44 -> 0.03Improved
replace CNF encoding with programmatic encoding (ablation)MapleSAT in SAT+CAS pipeline · Williamson enumeration n=40SAT solving time (h): 3.00 -> 0.02Improved
replace CNF encoding with programmatic encoding (ablation)MapleSAT in SAT+CAS pipeline · Williamson enumeration n=52-64solvability within 100h timeout: CNF - (timeout) -> programmatic 0.08 h at n=52Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy