Accelerating SAT Based Planning with Incremental SAT Solving. - Stephan Gocht; Tomás Balyo (ICAPS, 2017)

SemSlice: Exploiting Relational Verification for Automatic Program Slicing. - Bernhard Beckert; Thorsten Bormer; Stephan Gocht; Mihai Herda; Daniel Lentzsch; Mattias Ulbrich (IFM, 2017)

Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. - Jan Elffers; Jesús Giráldez-Cru; Stephan Gocht; Jakob Nordström; Laurent Simon 001 (IJCAI, 2018)

In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. - Marc Vinyals; Jan Elffers; Jesús Giráldez-Cru; Stephan Gocht; Jakob Nordström (SAT, 2018)

On Division Versus Saturation in Pseudo-Boolean Solving. - Stephan Gocht; Jakob Nordström; Amir Yehudayoff (IJCAI, 2019)

Using Relational Verification for Program Slicing. - Bernhard Beckert; Thorsten Bormer; Stephan Gocht; Mihai Herda; Daniel Lentzsch; Mattias Ulbrich (SEFM, 2019)

Justifying All Differences Using Pseudo-Boolean Reasoning. - Jan Elffers; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (AAAI, 2020)

Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling. - Mate Soos; Stephan Gocht; Kuldeep S. Meel (CAV (1), 2020)

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. - Stephan Gocht; Ross McBride; Ciaran McCreesh; Jakob Nordström; Patrick Prosser; James Trimble 001 (CP, 2020)

Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions. - Stephan Gocht; Ciaran McCreesh; Jakob Nordström (IJCAI, 2020)

Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning". - Jo Devriendt; Stephan Gocht; Emir Demirovic; Jakob Nordström; Peter J. Stuckey (Zenodo, 2020)

Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning. - Jo Devriendt; Stephan Gocht; Emir Demirovic; Jakob Nordström; Peter J. Stuckey (AAAI, 2021)

Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. - Stephan Gocht; Jakob Nordström (AAAI, 2021)

Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract). - Stephan Gocht; Jakob Nordström; Ruben Martins (PxTP, 2021)

Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. - Bart Bogaerts 001; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (AAAI, 2022)

An Auditable Constraint Programming Solver. - Stephan Gocht; Ciaran McCreesh; Jakob Nordström (CP, 2022)

Certified CNF Translations for Pseudo-Boolean Solving. - Stephan Gocht; Ruben Martins; Jakob Nordström; Andy Oertel (SAT, 2022)

Certifying Correctness for Combinatorial Algorithms: by Using Pseudo-Boolean Reasoning. - Stephan Gocht (2022)

Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract). - Stephan Gocht; Ruben Martins; Jakob Nordström; Andy Oertel (IJCAI, 2023)

Certified Dominance and Symmetry Breaking for Combinatorial Optimisation. - Bart Bogaerts 001; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (J. Artif. Intell. Res., 2023)

End-to-End Verification for Subgraph Solving. - Stephan Gocht; Ciaran McCreesh; Magnus O. Myreen; Jakob Nordström; Andy Oertel; Yong Kiam Tan (AAAI, 2024)

Planning Domain Model Acquisition from State Traces without Action Parameters. - Tomás Balyo; Martin Suda 001; Lukás Chrpa; Dominik Safránek; Stephan Gocht; Filip Dvorák; Roman Barták; G. Michael Youngblood (KR, 2024)