Concerned with the reliability of neural networks, researchers have developed verification
techniques to prove their robustness. Most verifiers work with real-valued networks …

The SAT solver CaDiCaL provides a rich feature set with a clean library interface. It has
been adopted by many users, is well documented and easy to extend due to its effective …

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 …

We employ tools from the fields of symbolic computation and satisfiability checking—namely,
computer algebra systems and SAT solvers—to study the Williamson conjecture from …

We present a method and an associated system, called MathCheck, that embeds the
functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven …

The difficulty of factoring large integers into primes is the basis for cryptosystems such as
RSA. Due to the widespread popularity of RSA, there have been many proposed attacks on …

The Hamiltonian cycle problem (HCP) is the problem of finding a spanning cycle in a given
graph. HCP is NP-complete and has been known as an important problem due to its close …

Using techniques from the fields of symbolic computation and satisfiability checking we
verify one of the cases used in the landmark result that projective planes of order ten do not …

We present a method and an associated system, called MathCheck, that embeds the
functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven …

In this paper we present MathCheck 2, a tool which combines sophisticated search
procedures of current SAT solvers with domain specific knowledge provided by algorithms …