Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition

Matthew England; James H. Davenport

Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition

Matthew England, James H. Davenport

University of Bath

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding

39 Downloads (Pure)

Abstract

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].

Original language	English
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
Publisher	CEUR
Pages	24-31
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

Publication series

Name	CEUR Workshop Proceedings
Volume	1804
ISSN (Print)	1613-0073

Workshop

Workshop	1st Workshop on Satisfiability Checking and Symbolic Computation
Country/Territory	Romania
City	Timisoara
Period	24/09/16 → 24/09/16

Bibliographical note

Copyright (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)

Access to Document

PublishedFinal published version, 476 KB

http://ceur-ws.org/Vol-1804/paper-06.pdfLicence: Unspecified

Cite this

England, M., & Davenport, J. H. (2017). Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition. In E. Ábrahám, J. H. Davenport, & P. Fontaine (Eds.), SC-Square 2016 Satisfiability Checking and Symbolic Computation: Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation (pp. 24-31). (CEUR Workshop Proceedings; Vol. 1804). CEUR. http://ceur-ws.org/Vol-1804/paper-06.pdf

Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition. / England, Matthew; Davenport, James H.
SC-Square 2016 Satisfiability Checking and Symbolic Computation: Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation. ed. / Erika Ábrahám; James H. Davenport; Pascal Fontaine. CEUR, 2017. p. 24-31 (CEUR Workshop Proceedings; Vol. 1804).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding

England, M & Davenport, JH 2017, Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition. in E Ábrahám, JH Davenport & P Fontaine (eds), SC-Square 2016 Satisfiability Checking and Symbolic Computation: Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation. CEUR Workshop Proceedings, vol. 1804, CEUR, pp. 24-31, 1st Workshop on Satisfiability Checking and Symbolic Computation, Timisoara, Romania, 24/09/16. <http://ceur-ws.org/Vol-1804/paper-06.pdf>

England, Matthew ; Davenport, James H. / Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition. SC-Square 2016 Satisfiability Checking and Symbolic Computation: Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation. editor / Erika Ábrahám ; James H. Davenport ; Pascal Fontaine. CEUR, 2017. pp. 24-31 (CEUR Workshop Proceedings).

@inproceedings{b8861368891149618df1a88427019671,

title = "Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition",

abstract = "In the paper which inspired the SC2 project, [E. A´ bra´ham, Building Bridges between Symbolic Computation and Satisfiability Checking, Proc. ISSAC {\textquoteright}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].",

author = "Matthew England and Davenport, {James H.}",

note = "Copyright (c) by the paper{\textquoteright}s authors. Copying permitted for private and academic purposes. Funded by EU Horizon 2020 FETOPEN-2016-2017-CSA project SC^2 (712689); 1st Workshop on Satisfiability Checking and Symbolic Computation ; Conference date: 24-09-2016 Through 24-09-2016",

year = "2017",

month = mar,

day = "2",

language = "English",

series = "CEUR Workshop Proceedings",

publisher = "CEUR",

pages = "24--31",

editor = "Erika {\'A}brah{\'a}m and Davenport, {James H.} and Pascal Fontaine",

booktitle = "SC-Square 2016 Satisfiability Checking and Symbolic Computation",

address = "Germany",

}

TY - GEN

T1 - Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition

AU - England, Matthew

AU - Davenport, James H.

N1 - Copyright (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)

PY - 2017/3/2

Y1 - 2017/3/2

N2 - 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].

AB - 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].

M3 - Conference proceeding

T3 - CEUR Workshop Proceedings

SP - 24

EP - 31

BT - SC-Square 2016 Satisfiability Checking and Symbolic Computation

A2 - Ábrahám, Erika

A2 - Davenport, James H.

A2 - Fontaine, Pascal

PB - CEUR

T2 - 1st Workshop on Satisfiability Checking and Symbolic Computation

Y2 - 24 September 2016 through 24 September 2016

ER -

Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition

Abstract

Publication series

Workshop

Bibliographical note

Access to Document

Fingerprint

Cite this