15 citations · 15 across the 2 of their papers we have counts for
2 papers
cs.LO2022
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs
Stephan Gocht, Jakob Nordström
The dramatic improvements in combinatorial optimization algorithms over the last decades have had a major impact in artificial intelligence, operations research, and beyond, but th…
cs.AI2022★ 15 cited
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh +1
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle a…