Reveal

Are Hitting Formulas Hard for Resolution?
Cite Project Project DOI
Circuit Minimization with QBF-Based Exact Synthesis
PDF Cite Project Project Project DOI
Co-Certificate Learning with SAT Modulo Symmetries
PDF Cite Project Project DOI
Computing twin-width with SAT and branch & bound
PDF Cite Project Project DOI
Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity
PDF Cite Project DOI
IPASIR-UP: User Propagators for CDCL
Cite Project Project DOI
Learning Small Decision Trees with Large Domain
PDF Cite Project Project DOI
On the parameterized complexity of clustering problems for incomplete data
Cite Project Project Project DOI
Proven optimally-balanced Latin rectangles with SAT
PDF Cite Project Project DOI
SAT-Based Generation of Planar Graphs
Cite Project Project DOI