| Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling M Soos, S Gocht, KS Meel International Conference on Computer Aided Verification, 463-484, 2020 | 74 | 2020 |
| Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. J Elffers, J Giráldez-Cru, S Gocht, J Nordström, L Simon IJCAI, 1300-1308, 2018 | 36 | 2018 |
| Justifying all differences using pseudo-boolean reasoning J Elffers, S Gocht, C McCreesh Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1486-1494, 2020 | 29 | 2020 |
| Subgraph isomorphism meets cutting planes: Solving with certified solutions S Gocht, C McCreesh, J Nordström Proceedings of the Twenty-Ninth International Conference on International …, 2021 | 28 | 2021 |
| Certifying solvers for clique and maximum common (connected) subgraph problems S Gocht, R McBride, C McCreesh, J Nordström, P Prosser, J Trimble International Conference on Principles and Practice of Constraint …, 2020 | 28 | 2020 |
| In between resolution and cutting planes: A study of proof systems for pseudo-Boolean SAT solving M Vinyals, J Elffers, J Giráldez-Cru, S Gocht, J Nordström Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 28 | 2018 |
| Accelerating SAT Based Planning with Incremental SAT Solving S Gocht, T Balyo Proceedings of the Twenty-Seventh International Conference on Automated …, 2017 | 28 | 2017 |
| Cutting to the core of pseudo-boolean optimization: Combining core-guided search with cutting planes reasoning J Devriendt, S Gocht, E Demirović, J Nordström, PJ Stuckey Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3750-3758, 2021 | 25 | 2021 |
| Certifying parity reasoning efficiently using pseudo-Boolean proofs S Gocht, J Nordström Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3768-3777, 2021 | 23 | 2021 |
| Certified symmetry and dominance breaking for combinatorial optimisation B Bogaerts, S Gocht, C McCreesh, J Nordström Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3698-3707, 2022 | 20 | 2022 |
| On Division Versus Saturation in Pseudo-Boolean Solving. S Gocht, J Nordström, A Yehudayoff IJCAI, 1711-1718, 2019 | 15 | 2019 |
| Certified CNF translations for pseudo-Boolean solving S Gocht, R Martins, J Nordström, A Oertel 25th International Conference on Theory and Applications of Satisfiability …, 2022 | 12 | 2022 |
| An auditable constraint programming solver S Gocht, C McCreesh, J Nordström 28th International Conference on Principles and Practice of Constraint …, 2022 | 12 | 2022 |
| Cryptominisat with ccanr at the sat competition 2020 M Soos, J Devriendt, S Gocht, A Shaw, KS Meel SAT COMPETITION 2020, 27, 2020 | 7 | 2020 |
| SemSlice: Exploiting Relational Verification for Automatic Program Slicing B Beckert, T Bormer, S Gocht, M Herda, D Lentzsch, M Ulbrich Integrated Formal Methods: 13th International Conference, IFM 2017, Turin …, 2017 | 7 | 2017 |
| VeriPB: The easy way to make your combinatorial search algorithm trustworthy S Gocht, C McCreesh, J Nordström workshop From Constraint Programming to Trustworthy AI at the 26th …, 2020 | 3 | 2020 |
| CryptoMiniSat with WalkSAT at the SAT Competition 2020 M Soos, B Selman, H Kautz, J Devriendt, S Gocht SAT COMPETITION 2020, 29, 2020 | 3 | 2020 |
| Using relational verification for program slicing B Beckert, T Bormer, S Gocht, M Herda, D Lentzsch, M Ulbrich Software Engineering and Formal Methods: 17th International Conference, SEFM …, 2019 | 3 | 2019 |
| Certifying Correctness for Combinatorial Algorithms: by Using Pseudo-Boolean Reasoning S Gocht Lund University, 2022 | 2 | 2022 |
| Certified dominance and symmetry breaking for combinatorial optimisation B Bogaerts, S Gocht, C McCreesh, J Nordström Journal of Artificial Intelligence Research 77, 1539–1589-1539–1589, 2023 | 1 | 2023 |
