default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephan Gocht
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström
, Andy Oertel, Yong Kiam Tan:
End-to-End Verification for Subgraph Solving. AAAI 2024: 8038-8047- [c18]Tomás Balyo, Martin Suda, Lukás Chrpa, Dominik Safránek, Stephan Gocht, Filip Dvorák, Roman Barták, G. Michael Youngblood:
Planning Domain Model Acquisition from State Traces without Action Parameters. KR 2024 - 2023
- [j1]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation. J. Artif. Intell. Res. 77: 1539-1589 (2023) - [c17]Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel:
Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract). IJCAI 2023: 6436-6441 - 2022
- [b1]Stephan Gocht:
Certifying Correctness for Combinatorial Algorithms: by Using Pseudo-Boolean Reasoning. Lund University, Sweden, 2022 - [c16]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. AAAI 2022: 3698-3707 - [c15]Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
An Auditable Constraint Programming Solver. CP 2022: 25:1-25:18 - [c14]Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel:
Certified CNF Translations for Pseudo-Boolean Solving. SAT 2022: 16:1-16:25 - [i2]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. CoRR abs/2203.12275 (2022) - [i1]Stephan Gocht, Jakob Nordström:
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. CoRR abs/2209.12185 (2022) - 2021
- [c13]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: 3750-3758 - [c12]Stephan Gocht, Jakob Nordström:
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. AAAI 2021: 3768-3777 - [c11]Stephan Gocht, Jakob Nordström, Ruben Martins:
Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract). PxTP 2021: 48 - 2020
- [c10]Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Justifying All Differences Using Pseudo-Boolean Reasoning. AAAI 2020: 1486-1494 - [c9]Mate Soos, Stephan Gocht, Kuldeep S. Meel:
Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling. CAV (1) 2020: 463-484 - [c8]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: 338-357 - [c7]Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions. IJCAI 2020: 1134-1140 - [d1]Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, Peter J. Stuckey:
Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning". Zenodo, 2020
2010 – 2019
- 2019
- [c6]Stephan Gocht, Jakob Nordström, Amir Yehudayoff:
On Division Versus Saturation in Pseudo-Boolean Solving. IJCAI 2019: 1711-1718 - [c5]Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, Mattias Ulbrich:
Using Relational Verification for Program Slicing. SEFM 2019: 353-372 - 2018
- [c4]Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon:
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. IJCAI 2018: 1300-1308 - [c3]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: 292-310 - 2017
- [c2]Stephan Gocht, Tomás Balyo:
Accelerating SAT Based Planning with Incremental SAT Solving. ICAPS 2017: 135-139 - [c1]Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, Mattias Ulbrich:
SemSlice: Exploiting Relational Verification for Automatic Program Slicing. IFM 2017: 312-319
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-18 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
