| Authors | Title | Paper | Talk |
|---|
| Ilias Kotsireas | Hard Combinatorial Problems: A Challenge for Satisfiability |  | Jul 11 09:00 |
| Alexander Cowen-Rivers and Matthew England | Towards Incremental Cylindrical Algebraic Decomposition in Maple | | Jul 11 14:30 |
| Rebecca Haehn, Gereon Kremer and Erika Ábrahám | Evaluation of Equational Constraints for CAD in SMT Solving | | Jul 11 15:00 |
| Jan Horacek and Martin Kreuzer | Refutation of Products of Linear Polynomials | | Jul 11 16:00 |
| Casey Mulligan, Russell Bradford, James H. Davenport, Matthew England and Zak Tonks | Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics | | Jul 11 14:00 |
| Daniela Ritirc, Armin Biere and Manuel Kauers | A Practical Polynomial Calculus for Arithmetic Circuit Verification | | Jul 11 16:30 |
| Meesum Syed Mohammad and Prathamesh T. V. H. | Unknot Recognition Through Quantifier Elimination | | Jul 11 17:00 |
| John Abbott, Anna Maria Bigatti and Elisa Palezzato | New in CoCoA-5.2.4 and CoCoALib-0.99570 for SC-Square | | Jul 11 11:25 |
| Andreas Eggers, Matthias Stasch, Tino Teige, Tom Bienmüller and Udo Brockmeyer | Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving | | Jul 11 10:05 |
| Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Van Khanh To and Xuan Tung Vu | Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT | | Jul 11 11:00 |
| Stephen A. Forrest | SMT-like Queries in Maple | | Jul 11 11:50 |
| Tudor Jebelean | Techniques for Natural-style Proofs in Elementary Analysis | | Jul 11 12:15 |