default search action
3rd SC-Square@FLoC 2018: Oxford, UK
- Anna Maria Bigatti, Martin Brain:
Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference, SC-Square@FLOC 2018, Oxford, UK, July 11, 2018. CEUR Workshop Proceedings 2189, CEUR-WS.org 2018
1 - Invited Talk
- Ilias S. Kotsireas:
Hard Combinatorial Problems: A Challenge for Satisfiability. 1
2 - Research Papers
- Alexander I. Cowen-Rivers, Matthew England:
Towards Incremental Cylindrical Algebraic Decomposition in Maple. 3 - Rebecca Haehn, Gereon Kremer, Erika Ábrahám:
Evaluation of Equational Constraints for CAD in SMT Solving. 19 - Jan Horácek, Martin Kreuzer:
Refutation of Products of Linear Polynomials. 33 - Casey B. Mulligan, Russell J. Bradford, James H. Davenport, Matthew England, Zak Tonks:
Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics. 48 - Daniela Ritirc, Armin Biere, Manuel Kauers:
A Practical Polynomial Calculus for Arithmetic Circuit Verification. 61 - Syed Mohammad Meesum, T. V. H. Prathamesh:
Unknot Recognition Through Quantifier Elimination. 77
3 - Extended Abstracts
- John Abbott, Anna Maria Bigatti, Elisa Palezzato:
New in CoCoA-5.2.4 and CoCoALib-0.99600 for SC-Square. 88 - Andreas Eggers, Matthias Stasch, Tino Teige, Tom Bienmüller, Udo Brockmeyer:
Constraint Systems from Traffic Scenarios for the Validation of Autonomous Driving. 95 - Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, To Van Khanh, Xuan-Tung Vu:
Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT. 110 - Stephen A. Forrest:
SMT-like Queries in Maple. 118 - Tudor Jebelean:
Techniques for Natural-style Proofs in Elementary Analysis. 122
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.