Satisfiability modulo user propagators

K Fazekas, A Niemetz, M Preiner, M Kirchweger… - Journal of Artificial …, 2024 - jair.org
Modern SAT solvers are often integrated as sub-reasoning engines into more complex tools
to address problems beyond the Boolean satisfiability problem. Consider, for example …

SAT solvers and computer algebra systems: A powerful combination for mathematics

C Bright, I Kotsireas, V Ganesh - arxiv preprint arxiv:1907.04408, 2019 - arxiv.org
Over the last few decades, many distinct lines of research aimed at automating mathematics
have been developed, including computer algebra systems (CASs) for mathematical …

Finding Antimagic Labelings of Trees by Evolutionary Search

L Branson, AM Sutton, X Yan - Proceedings of the 17th ACM/SIGEVO …, 2023 - dl.acm.org
Randomized search heuristics can sometimes be effective verifiers for combinatorial
conjectures. In this paper, we demonstrate how a simple evolutionary algorithm can be used …

[PDF][PDF] Two classes of Hadamard matrices of Goethals-Seidel type

DŽ Đoković - arxiv preprint arxiv:2404.14375, 2024 - arxiv.org
arxiv:2404.14375v1 [math.CO] 22 Apr 2024 Page 1 arxiv:2404.14375v1 [math.CO] 22 Apr
2024 TWO CLASSES OF HADAMARD MATRICES OF GOETHALS-SEIDEL TYPE DRAGOMIR …

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 …

and Vijay Ganesh¹ 1 Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada cbright@ uwaterloo. ca

C Bright, KKH Cheung, B Stevens… - … IWOCA 2020, Bordeaux …, 2020 - books.google.com
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 …