The minimization of propositional formulae is a classical problem in log...
Representing some problems with XOR clauses (parity constraints) can all...
A sound and complete algorithm for nominal unification of higher-order
e...
Satisfiability is considered the canonical NP-complete problem and is us...
Erdös and Rényi proved in 1960 that a drastic change occurs in a large
r...
Modern SAT solvers have experienced a remarkable progress on solving
ind...