Stephan Gocht

24 papers A* 12A 4B 2Journal 3Unranked 2
YearRankTypeTitle / Venue / Authors
2025 A* conf
Using Planning for Automated Testing of Video Games.
IJCAI
Tomás Balyo, Roman Barták, Lukás Chrpa, Michal Cervenka, Filip Dvorák, Stephan Gocht, Lukás Lipcák, Viktor Macek, Dominik Rohácek, Josef Ryzí, Martin Suda, Dominik Safránek, Slavomír Svancár, G. Michael Youngblood
2024 A* conf
End-to-End Verification for Subgraph Solving.
AAAI
Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan
2024 A* conf
Planning Domain Model Acquisition from State Traces without Action Parameters.
KR
Tomás Balyo, Martin Suda, Lukás Chrpa, Dominik Safránek, Stephan Gocht, Filip Dvorák, Roman Barták, G. Michael Youngblood
2023 A* conf
Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract).
IJCAI
Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel
2023 J jnl
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation.
J. Artif. Intell. Res.
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2022 A conf
An Auditable Constraint Programming Solver.
CP
Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2022 A conf
Certified CNF Translations for Pseudo-Boolean Solving.
SAT
Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel
2022 A* conf
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation.
AAAI
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2022 J jnl
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation.
CoRR
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2022 — —
Certifying Correctness for Combinatorial Algorithms: by Using Pseudo-Boolean Reasoning.
Stephan Gocht
2022 J jnl
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs.
CoRR
Stephan Gocht, Jakob Nordström
2021 — conf
Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract).
PxTP
Stephan Gocht, Jakob Nordström, Ruben Martins
2021 A* conf
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs.
AAAI
Stephan Gocht, Jakob Nordström
2021 A* conf
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning.
AAAI
Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, Peter J. Stuckey
2020 A conf
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems.
CP
Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble
2020 A* conf
Justifying All Differences Using Pseudo-Boolean Reasoning.
AAAI
Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2020 A* conf
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions.
IJCAI
Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2020 — conf
Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling.
CAV (1)
Mate Soos, Stephan Gocht, Kuldeep S. Meel
2019 A* conf
On Division Versus Saturation in Pseudo-Boolean Solving.
IJCAI
Stephan Gocht, Jakob Nordström, Amir Yehudayoff
2019 B conf
Using Relational Verification for Program Slicing.
SEFM
Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, Mattias Ulbrich
2018 A conf
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving.
SAT
Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström
2018 A* conf
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks.
IJCAI
Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon
2017 A* conf
Accelerating SAT Based Planning with Incremental SAT Solving.
ICAPS
Stephan Gocht, Tomás Balyo
2017 B conf
SemSlice: Exploiting Relational Verification for Automatic Program Slicing.
IFM
Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, Mattias Ulbrich