The design of new devices and experiments has historically relied on the intuition of human
experts. Now, design inspirations from computers are increasingly augmenting the capability …

This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT),
an archetypal NP-complete problem, with the aid of machine learning (ML) techniques. Over …

We compare the impact of hardware advancement and algorithm advancement for SAT-
solving over the last two decades. In particular, we compare 20-year-old SAT-solvers on …

In this paper we go over the history of the Fuglede or Spectral Set Conjecture as it has
developed over the last 30 years or so. We do not aim to be exhaustive and we do not cover …

Abstract Logic Artificial Intelligence (AI) is a subfield of AI where variables can take two
defined arguments, True or False, and are arranged in clauses that follow the rules of formal …

Satisfiability (SAT) solvers are versatile tools that can solve a wide array of problems, and
the models and proofs of unsatisfiability emitted by SAT solvers can be checked by verified …

Since the early twentieth century, it has been understood that mathematical definitions and
proofs can be represented in formal systems with precise grammars and rules of use …

Reasoning is the ability to make inferences, and automated reasoning is concerned with the
building of computing systems that automate this process. Although the overall goal is to …

The discharging method is a powerful proof technique, especially for graph coloring
problems. Its major downside is that it often requires lengthy case analyses, which are …

In knowledge representation and reasoning, a key area in artificial intelligence research,
non-classical logics play a prominent double role: firstly, non-classical logic languages allow …