research
∙
03/12/2023
General Boolean Formula Minimization with QBF Solvers
The minimization of propositional formulae is a classical problem in log...
share
research
∙
04/04/2022
Reducing SAT to Max2XOR
Representing some problems with XOR clauses (parity constraints) can all...
research
∙
02/16/2021
Nominal Unification and Matching of Higher Order Expressions with Recursive Let
A sound and complete algorithm for nominal unification of higher-order e...
research
∙
04/15/2020
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
Satisfiability is considered the canonical NP-complete problem and is us...
research
∙
07/12/2017
Percolation and Phase Transition in SAT
Erdös and Rényi proved in 1960 that a drastic change occurs in a large r...
research
∙
06/10/2016
