Methodologies of Symbolic Computation

James Davenport

doi:10.1007/978-3-319-99957-9_2

Methodologies of Symbolic Computation

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

Abstract

The methodologies of computer algebra are about making algebra (in the broad sense) algorithmic, and efficient as well. There are ingenious algorithms, even in the obvious settings, and also mechanisms where problems are translated into other (generally smaller) settings, solved there, and translated back. Much of the efficiency of modern systems comes from these translations. One of the major challenges is sparsity, and the complexity of algorithms in the sparse setting is often unknown, as many problems are NP-hard, or much worse. In view of this, it is argued that the traditional complexity-theoretic method of measuring progress has its limits, and computer algebra should look to the work of the SAT community, with its large families of benchmarks and serious contests, for lessons.

Original language	English
Title of host publication	Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Proceedings
Editors	Dongming Wang, Jacques Fleuriot, Jacques Calmet
Place of Publication	Cham
Publisher	Springer International Publishing
Pages	19-33
Number of pages	15
ISBN (Print)	9783319999562
DOIs	https://doi.org/10.1007/978-3-319-99957-9_2
Publication status	Published - Sept 2018
Event	13th International Conference on Artificial Intelligence and Symbolic Computation - Quishan Hotel, Souzhou, China Duration: 16 Sept 2018 → 19 Sept 2018 http://aisc2018.cc4cm.org/index.html

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11110 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Conference on Artificial Intelligence and Symbolic Computation
Abbreviated title	AISC 2018
Country/Territory	China
City	Souzhou
Period	16/09/18 → 19/09/18
Internet address	http://aisc2018.cc4cm.org/index.html

Keywords

Benchmarking
Computer algebra

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-99957-9_2

Cite this

Davenport, J. (2018). Methodologies of Symbolic Computation. In D. Wang, J. Fleuriot, & J. Calmet (Eds.), Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Proceedings (pp. 19-33). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11110 LNAI). Springer International Publishing. https://doi.org/10.1007/978-3-319-99957-9_2

Methodologies of Symbolic Computation. / Davenport, James.
Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Proceedings. ed. / Dongming Wang; Jacques Fleuriot; Jacques Calmet. Cham: Springer International Publishing, 2018. p. 19-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11110 LNAI).

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

Davenport, J 2018, Methodologies of Symbolic Computation. in D Wang, J Fleuriot & J Calmet (eds), Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11110 LNAI, Springer International Publishing, Cham, pp. 19-33, 13th International Conference on Artificial Intelligence and Symbolic Computation, Souzhou, China, 16/09/18. https://doi.org/10.1007/978-3-319-99957-9_2

Davenport J. Methodologies of Symbolic Computation. In Wang D, Fleuriot J, Calmet J, editors, Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Proceedings. Cham: Springer International Publishing. 2018. p. 19-33. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-99957-9_2

Davenport, James. / Methodologies of Symbolic Computation. Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Proceedings. editor / Dongming Wang ; Jacques Fleuriot ; Jacques Calmet. Cham : Springer International Publishing, 2018. pp. 19-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{789c0e02b1dd48d5b9581feb57f21353,

title = "Methodologies of Symbolic Computation",

abstract = "The methodologies of computer algebra are about making algebra (in the broad sense) algorithmic, and efficient as well. There are ingenious algorithms, even in the obvious settings, and also mechanisms where problems are translated into other (generally smaller) settings, solved there, and translated back. Much of the efficiency of modern systems comes from these translations. One of the major challenges is sparsity, and the complexity of algorithms in the sparse setting is often unknown, as many problems are NP-hard, or much worse. In view of this, it is argued that the traditional complexity-theoretic method of measuring progress has its limits, and computer algebra should look to the work of the SAT community, with its large families of benchmarks and serious contests, for lessons.",

keywords = "Benchmarking, Computer algebra",

author = "James Davenport",

year = "2018",

month = sep,

doi = "10.1007/978-3-319-99957-9_2",

language = "English",

isbn = "9783319999562",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer International Publishing",

pages = "19--33",

editor = "Dongming Wang and Jacques Fleuriot and Jacques Calmet",

booktitle = "Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Proceedings",

address = "Switzerland",

note = "13th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2018 ; Conference date: 16-09-2018 Through 19-09-2018",

url = "http://aisc2018.cc4cm.org/index.html",

}

TY - GEN

T1 - Methodologies of Symbolic Computation

AU - Davenport, James

PY - 2018/9

Y1 - 2018/9

N2 - The methodologies of computer algebra are about making algebra (in the broad sense) algorithmic, and efficient as well. There are ingenious algorithms, even in the obvious settings, and also mechanisms where problems are translated into other (generally smaller) settings, solved there, and translated back. Much of the efficiency of modern systems comes from these translations. One of the major challenges is sparsity, and the complexity of algorithms in the sparse setting is often unknown, as many problems are NP-hard, or much worse. In view of this, it is argued that the traditional complexity-theoretic method of measuring progress has its limits, and computer algebra should look to the work of the SAT community, with its large families of benchmarks and serious contests, for lessons.

AB - The methodologies of computer algebra are about making algebra (in the broad sense) algorithmic, and efficient as well. There are ingenious algorithms, even in the obvious settings, and also mechanisms where problems are translated into other (generally smaller) settings, solved there, and translated back. Much of the efficiency of modern systems comes from these translations. One of the major challenges is sparsity, and the complexity of algorithms in the sparse setting is often unknown, as many problems are NP-hard, or much worse. In view of this, it is argued that the traditional complexity-theoretic method of measuring progress has its limits, and computer algebra should look to the work of the SAT community, with its large families of benchmarks and serious contests, for lessons.

KW - Benchmarking

KW - Computer algebra

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

U2 - 10.1007/978-3-319-99957-9_2

DO - 10.1007/978-3-319-99957-9_2

M3 - Chapter in a published conference proceeding

SN - 9783319999562

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 19

EP - 33

BT - Artificial Intelligence and Symbolic Computation - 13th International Conference, AISC 2018, Proceedings

A2 - Wang, Dongming

A2 - Fleuriot, Jacques

A2 - Calmet, Jacques

PB - Springer International Publishing

CY - Cham

T2 - 13th International Conference on Artificial Intelligence and Symbolic Computation

Y2 - 16 September 2018 through 19 September 2018

ER -

Methodologies of Symbolic Computation

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this