| SAT-Based Subsumption Resolution
|
2023 |
Coutelier, Robin |
| A More Pragmatic CDCL for IsaSAT and Targetting LLVM (Short Paper)
|
2023 |
Fleury, Mathias |
| A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus
|
2023 |
Indrzejczak, Andrzej |
| Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic
|
2023 |
Nalon, Cláudia |
| Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
|
2023 |
Kassing, Jan-Christoph |
| Theorem Proving in Dependently-Typed Higher-Order Logic
|
2023 |
Rothgang, Colin |
| Towards Fast Nominal Anti-unification of Letrec-Expressions
|
2023 |
Schmidt-Schauß, Manfred |
| Incremental Rewriting Modulo SMT
|
2023 |
Whitters, Gerald |
| Superposition with Delayed Unification
|
2023 |
Bhayat, Ahmed |
| Certified Core-Guided MaxSAT Solving
|
2023 |
Berg, Jeremias |
| Verified Given Clause Procedures
|
2023 |
Blanchette, Jasmin |
| SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning
|
2023 |
Bromberger, Martin |
| Choose Your Colour: Tree Interpolation for Quantified Formulas in SMT
|
2023 |
Henkel, Elisabeth |
| Proving Termination of C Programs with Lists
|
2023 |
Hensel, Jera |
| Reasoning About Regular Properties: A Comparative Study
|
2023 |
Fiedor, Tomás |
| Program Synthesis in Saturation
|
2023 |
Hozzovd, Petra |
| Confluence Criteria for Logically Constrained Rewrite Systems
|
2023 |
Schopf, Jonas |
| Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory
|
2023 |
Stevens, Lukas |
| An Isabelle/HOL Formalization of the SCL(FOL) Calculus
|
2023 |
Bromberger, Martin |
| Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs
|
2023 |
Brieger, Marvin |
Tag hinzufügen