3 papers
cs.LO2026
Towards a Certifying Grounder
Daimy Van Caudenberg, Alexander Ek, Carlos Cantero +1
Grounding, the translation of high-level theories into equivalent quantifier-free formulas, is a crucial step in declarative solving, yet it has so far escaped the proof-logging re…
cs.LO2025
Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables
Markus Anders, Bart Bogaerts, Benjamin Bogø +8
Symmetry breaking is a crucial technique in modern combinatorial solving, but it is difficult to be sure it is implemented correctly. The most successful approach to deal with bugs…
cs.LO2025
Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
Daimy Van Caudenberg, Bart Bogaerts, Leandro Vendramin
We tackle the problem of enumerating set-theoretic solutions to the Yang-Baxter equation. This equation originates from statistical and quantum mechanics, but also has applications…