Stephan Gocht

Orcid: 0000-0002-5459-3134

According to our database1, Stephan Gocht authored at least 22 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Planning Domain Model Acquisition from State Traces without Action Parameters.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

End-to-End Verification for Subgraph Solving.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation.
J. Artif. Intell. Res., 2023

Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Certifying Correctness for Combinatorial Algorithms: by Using Pseudo-Boolean Reasoning.
PhD thesis, 2022

Certified CNF Translations for Pseudo-Boolean Solving.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

An Auditable Constraint Programming Solver.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

Certified Symmetry and Dominance Breaking for Combinatorial Optimisation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract).
Proceedings of the Proceedings Seventh Workshop on Proof eXchange for Theorem Proving, 2021

Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning".
Dataset, September, 2020

Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Justifying All Differences Using Pseudo-Boolean Reasoning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Using Relational Verification for Program Slicing.
Proceedings of the Software Engineering and Formal Methods - 17th International Conference, 2019

On Division Versus Saturation in Pseudo-Boolean Solving.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Seeking Practical CDCL Insights from Theoretical SAT Benchmarks.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
SemSlice: Exploiting Relational Verification for Automatic Program Slicing.
Proceedings of the Integrated Formal Methods - 13th International Conference, 2017

Accelerating SAT Based Planning with Incremental SAT Solving.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017


  Loading...