In the paper which inspired the SC2 project, [E. A´ bra´ham, Building Bridges between Symbolic Computation and Satisfiability Checking, Proc. ISSAC ’15, pp. 1–6, ACM, 2015] the author identified the use of sophisticated heuristics as a technique that the Satisfiability Checking community excels in and from which it is likely the Symbolic Computation community could learn and prosper. To start this learning process we summarise our experience with heuristic development for the computer algebra algorithm Cylindrical Algebraic Decomposition. We also propose and discuss standards and benchmarks as another area where Symbolic Computation could prosper from Satisfiability Checking expertise, noting that these have been identified as initial actions for the new SC2 community in the CSA project, as described in [E. A´ bra´ham et al., SC2: Satisfiability Checking meets Symbolic Computation (Project Paper), Intelligent Computer Mathematics (LNCS 9761), pp. 28–43, Springer, 2015].
|Title of host publication||SC-Square 2016 Satisfiability Checking and Symbolic Computation|
|Subtitle of host publication||Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation|
|Editors||Erika Ábrahám, James H. Davenport, Pascal Fontaine|
|Number of pages||8|
|Publication status||Published - 2 Mar 2017|
|Event||1st Workshop on Satisfiability Checking and Symbolic Computation - Timisoara, Romania|
Duration: 24 Sept 2016 → 24 Sept 2016
|Name||CEUR Workshop Proceedings|
|Workshop||1st Workshop on Satisfiability Checking and Symbolic Computation|
|Period||24/09/16 → 24/09/16|
Bibliographical noteCopyright (c) by the paper’s authors. Copying permitted for private and academic purposes.
Funded by EU Horizon 2020 FETOPEN-2016-2017-CSA project SC^2 (712689)