Stephan Gocht

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 21

Top Topics

Combinatorial Optimisation

Symmetry Breaking

Top Venues

Publications

Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan
End-to-End Verification for Subgraph Solving. AAAI (2024)
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation. J. Artif. Intell. Res. 77 (2023)
Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel
Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract). IJCAI (2023)
Stephan Gocht, Jakob Nordström
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. CoRR (2022)
Stephan Gocht, Ciaran McCreesh, Jakob Nordström
An Auditable Constraint Programming Solver. CP (2022)
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. AAAI (2022)
Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel
Certified CNF Translations for Pseudo-Boolean Solving. SAT (2022)
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. CoRR (2022)
Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, Peter J. Stuckey
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning. AAAI (2021)
Stephan Gocht, Jakob Nordström
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. AAAI (2021)
Stephan Gocht, Jakob Nordström, Ruben Martins
Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract). PxTP (2021)
Stephan Gocht, Ciaran McCreesh, Jakob Nordström
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions. IJCAI (2020)
Mate Soos, Stephan Gocht, Kuldeep S. Meel
Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling. CAV (1) (2020)
Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP (2020)
Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
Justifying All Differences Using Pseudo-Boolean Reasoning. AAAI (2020)
Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, Mattias Ulbrich
Using Relational Verification for Program Slicing. SEFM (2019)
Stephan Gocht, Jakob Nordström, Amir Yehudayoff
On Division Versus Saturation in Pseudo-Boolean Solving. IJCAI (2019)
Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. IJCAI (2018)
Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. SAT (2018)
Stephan Gocht, Tomás Balyo
Accelerating SAT Based Planning with Incremental SAT Solving. ICAPS (2017)
Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, Mattias Ulbrich
SemSlice: Exploiting Relational Verification for Automatic Program Slicing. IFM (2017)