Enumeration of Complex Golay Pairs via Programmatic SAT
The 43rd International Symposium on Symbolic and Algebraic Computation (ISSAC 2018)
Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture
Preprint, submitted to the SC2 Journal of Symbolic Computation special issue
A SAT+CAS Method for Enumerating Williamson Matrices of Even Order
Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018)
A SAT+CAS Method for Enumerating Williamson Matrices of Even Order
Preprint, presented at the 2nd International Workshop on Satisfiability Checking and Symbolic Computation (SC2 2017)
[pdf]
Computational Methods for Combinatorial and Number Theoretic Problems
PhD Thesis, University of Waterloo, 2017.
Ed Zulkoski, Curtis Bright, Albert Heinle, Ilias Kotsireas, Krzysztof Czarnecki, Vijay Ganesh
Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures
Journal of Automated Reasoning, 2017 (JAR 2017)
Curtis Bright, Vijay Ganesh, Albert Heinle, Ilias Kotsireas, Saeed Nejati, Krzysztof Czarnecki
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
The 18th International Workshop on Computer Algebra in Scientific Computing (CASC 2016)
Symbolic Computation + Satisfiability Checking (SC^2) Track Invited Paper
MathCheck: A Math Assistant based on a Combination of Computer Algebra Systems and SAT Solvers
25th International Joint Conference on Artificial Intelligence (IJCAI 2016)
IJCAI 'Sister Conference Best Paper Track' Invited Paper
MathCheck: A Math Assistant based on a Combination of Computer Algebra Systems and SAT Solvers
The 25th International Conference on Automated Deduction (CADE 2015)
MathCheck selected for JAR Special Issue on Best Papers at CADE 2015
A SAT+CAS Method for Enumerating Williamson Matrices of Even Order - Curtis Bright
Second International Workshop on Satisfiability Checking and Symbolic Computation (SC2 2017)
Technische Universität Kaiserslautern in Kaiserslautern, Germany - July 29, 2017
MathCheck2: Combining Learning-based Search (SAT) with Symbolic Computation (CAS) - Vijay Ganesh and Curtis Bright
First International Workshop on Satisfiability Checking and Symbolic Computation (SC2 2016)
Universitatea de Vest Timisoara in Timișoara, Romania - September 24, 2016
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures - Curtis Bright
18th International Workshop on Computer Algebra in Scientific Computing (CASC 2016)
Universitatea din București in Bucharest, Romania - September 20, 2016
MathCheck2: Combining CAS and SAT - Albert Heinle
22nd Conference on Applications of Computer Algebra (ACA 2016)
Universität Kassel in Kassel, Germany - August 2, 2016
MathCheck: A Math Assistant Combining SAT with Computer Algebra Systems - Curtis Bright
25th International Joint Conference on Artificial Intelligence (IJCAI-16)
New York Hilton Midtown in New York, USA - July 12, 2016
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures - Curtis Bright
14th International Workshop on Satisfiability Modulo Theories (SMT 2016)
Universidade de Coimbra in Coimbra, Portugal - July 2, 2016
MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures - Curtis Bright
Computationally Assisted Mathematical Discovery and Experimental Mathematics (ACMES2)
Western University in London, Canada - May 13, 2016
PhD Research Proposal: A SAT+CAS system for checking math conjectures - Curtis Bright
University of Waterloo in Waterloo, Canada - March 14, 2016
Computational Approaches to Open Problems in Combinatorics - Ilias Kotsireas
International Symposium on Artificial Intelligence and Mathematics (ISAIM 2016)
Embassy Suites Fort Lauderdale in Fort Lauderdale, USA - January 5, 2016
MathCheck: A Math Assistant Combining SAT with Computer Algebra Systems - Ed Zulkoski
The 25th jubilee edition of the International Conference on Automated Deduction (CADE-25)
Freie Universität Berlin in Berlin, Germany - August 7, 2015