Abstract is missing.
- Hard Combinatorial Problems: A Challenge for SatisfiabilityIlias S. Kotsireas. 1 [doi]
- Towards Incremental Cylindrical Algebraic Decomposition in MapleAlexander I. Cowen-Rivers, Matthew England 0001. 3 [doi]
- Evaluation of Equational Constraints for CAD in SMT SolvingRebecca Haehn, Gereon Kremer, Erika Ábrahám. 19 [doi]
- Refutation of Products of Linear PolynomialsJan Horácek, Martin Kreuzer. 33 [doi]
- Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in EconomicsCasey B. Mulligan, Russell J. Bradford, James H. Davenport, Matthew England 0001, Zak Tonks. 48 [doi]
- A Practical Polynomial Calculus for Arithmetic Circuit VerificationDaniela Ritirc, Armin Biere, Manuel Kauers. 61 [doi]
- Unknot Recognition Through Quantifier EliminationSyed Mohammad Meesum, T. V. H. Prathamesh. 77 [doi]
- New in CoCoA-5.2.4 and CoCoALib-0.99600 for SC-SquareJohn Abbott, Anna Maria Bigatti, Elisa Palezzato. 88 [doi]
- Constraint Systems from Traffic Scenarios for the Validation of Autonomous DrivingAndreas Eggers, Matthias Stasch, Tino Teige, Tom Bienmüller, Udo Brockmeyer. 95 [doi]
- Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMTPascal Fontaine, Mizuhito Ogawa, Thomas Sturm 0001, To Van Khanh, Xuan-Tung Vu. 110 [doi]
- SMT-like Queries in MapleStephen A. Forrest. 118 [doi]
- Techniques for Natural-style Proofs in Elementary AnalysisTudor Jebelean. 122 [doi]