Experience with heuristics, benchmarks & standards for cylindrical algebraic decomposition

Matthew England, James H. Davenport

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In the paper which inspired the SC2 project, [E. Ábrá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. Ábráham et al., SC2: Satisfiability Checking meets Symbolic Computation (Project Paper), Intelligent Computer Mathematics (LNCS 9761), pp. 28-43, Springer, 2015].

Original languageEnglish
Pages (from-to)24-31
Number of pages8
JournalCEUR Workshop Proceedings
Volume1804
Publication statusPublished - 2016

Fingerprint

Decomposition
Algebra

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Experience with heuristics, benchmarks & standards for cylindrical algebraic decomposition. / England, Matthew; Davenport, James H.

In: CEUR Workshop Proceedings, Vol. 1804, 2016, p. 24-31.

Research output: Contribution to journalArticle

@article{0860a973ea3846e0b4fa7893512dd9a1,
title = "Experience with heuristics, benchmarks & standards for cylindrical algebraic decomposition",
abstract = "In the paper which inspired the SC2 project, [E. {\'A}br{\'a}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}br{\'a}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.}",
year = "2016",
language = "English",
volume = "1804",
pages = "24--31",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

TY - JOUR

T1 - Experience with heuristics, benchmarks & standards for cylindrical algebraic decomposition

AU - England, Matthew

AU - Davenport, James H.

PY - 2016

Y1 - 2016

N2 - In the paper which inspired the SC2 project, [E. Ábrá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. Ábrá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. Ábrá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. Ábráham et al., SC2: Satisfiability Checking meets Symbolic Computation (Project Paper), Intelligent Computer Mathematics (LNCS 9761), pp. 28-43, Springer, 2015].

UR - http://www.scopus.com/inward/record.url?scp=85032108657&partnerID=8YFLogxK

M3 - Article

VL - 1804

SP - 24

EP - 31

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -