Modern SAT solvers are frequently embedded as sub-reasoning engines into more complex
tools for addressing problems beyond the Boolean satisfiability problem. Examples include …

The problem of finding the minimum three-dimensional Kochen–Specker (KS) vector
system, an important problem in quantum foundations, has remained open for over 55 years …

We propose a novel SAT-based approach to graph generation. Our approach utilizes the
interaction between a CDCL SAT solver and a special symmetry propagator where the SAT …

A bipartite perfect quantum strategy (BPQS) allows two players who cannot communicate
with each other to always win a nonlocal game. BPQSs are rare but fundamental in light of …

Bipartite perfect quantum strategies (BPQSs) allow two players isolated from each other to
win every trial of a nonlocal game. BPQSs have crucial roles in recent developments in …

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 …

Abstract In 1972, Paul Erdős, Vance Faber, and Lászlo Lovász asked whether every linear
hypergraph with n vertices can be edge-colored with n colors, a statement that has come to …

Envy-freeness up to any good (EFX) is a key concept in Computational Social Choice for the
fair division of indivisible goods, where no agent envies another's allocation after removing …

We obtain the smallest unsatisfiable formulas in subclasses of $ k $-CNF (exactly $ k $
distinct literals per clause) with bounded variable or literal occurrences. Smaller …

We make two contributions pertaining to the study of the quantum chromatic numbers of
small graphs. Firstly, in an elegant paper, Man\v {c} inska and Roberson [\textit {Baltic …