Stephan Gocht
Titel
Zitiert von
Zitiert von
Jahr
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
192018
Accelerating SAT Based Planning with Incremental SAT Solving
S Gocht, T Balyo
Proceedings of the Twenty-Seventh International Conference on Automated …, 2017
162017
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
International Conference on Theory and Applications of Satisfiability …, 2018
132018
On Division Versus Saturation in Pseudo-Boolean Solving.
S Gocht, J Nordström, A Yehudayoff
IJCAI, 1711-1718, 2019
72019
Justifying All Differences Using Pseudo-Boolean Reasoning.
J Elffers, S Gocht, C McCreesh, J Nordström
AAAI, 1486-1494, 2020
62020
SemSlice: Exploiting Relational Verification for Automatic Program Slicing
B Beckert, T Bormer, S Gocht, M Herda, D Lentzsch, M Ulbrich
International Conference on Integrated Formal Methods, 312-319, 2017
52017
The freelunch planning system entering ipc 2014
T Balyo, S Gocht
IPC 2014 planner abstracts, 43-44, 2014
52014
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions
S Gocht, C McCreesh, J Nordström
Proceedings of the 29th International Joint Conference on Artificial …, 2020
32020
Using relational verification for program slicing
B Beckert, T Bormer, S Gocht, M Herda, D Lentzsch, M Ulbrich
International Conference on Software Engineering and Formal Methods, 353-372, 2019
22019
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
12020
Incremental SAT Solving for SAT Based Planning
S Gocht
Karlsruhe Institute of Technology (KIT), 2017
12017
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
2020
Refinement of Path Conditions for Information Flow Analysis
S Gocht
Karlsruhe Institute of Technology (KIT), 2014
2014
VeriPB: The Easy Way to Make Your Combinatorial Search Algorithm Trustworthy
S Gocht, C McCreesh, J Nordström
CryptoMiniSat with CCAnr at the SAT Competition 2020
M Soos, J Devriendt, S Gocht, A Shaw, KS Meel
SAT COMPETITION 2020, 27, 0
CryptoMiniSat with WalkSAT at the SAT Competition 2020
M Soos, B Selman, H Kautz, J Devriendt, S Gocht
SAT COMPETITION 2020, 29, 0
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–16