SC2 : Satisfiability Checking Meets Symbolic Computation

Erika Ábrahám, John Abbott, Bernd Becker, Anna M. Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm

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

17 Citations (Scopus)

Abstract

Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC2 community.
Original languageEnglish
Title of host publicationIntelligent Computer Mathematics
EditorsMichael Kohlhase, Moa Johansson, Bruce Miller, Leonardo de Moura, Frank Tompa
Place of PublicationSwitzerland
PublisherSpringer Verlag
Pages28-43
Number of pages16
Volume9791
ISBN (Electronic)978-3-319-42547-4
ISBN (Print)978-3-319-42546-7
DOIs
Publication statusPublished - 12 Jul 2016
Event2016 International Conference on Intelligent Computer Mathematics - Prague, Czech Republic
Duration: 8 Jul 201612 Jul 2016

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9791
ISSN (Print)0302-9743

Conference

Conference2016 International Conference on Intelligent Computer Mathematics
CountryCzech Republic
CityPrague
Period8/07/1612/07/16

Fingerprint

Industrial applications

Bibliographical note

Funded by EU Horizon 2020 FETOPEN-2016-2017-CSA project SC^2 (712689)

Keywords

  • Logical problems
  • Symbolic computation
  • Computer algebra systems
  • Satisfiability checking
  • Satisfiability modulo theories

Cite this

Ábrahám, E., Abbott, J., Becker, B., Bigatti, A. M., Brain, M., Buchberger, B., ... Sturm, T. (2016). SC2 : Satisfiability Checking Meets Symbolic Computation. In M. Kohlhase, M. Johansson, B. Miller, L. de Moura, & F. Tompa (Eds.), Intelligent Computer Mathematics (Vol. 9791, pp. 28-43). (Lecture Notes in Computer Science; Vol. 9791). Switzerland: Springer Verlag. https://doi.org/10.1007/978-3-319-42547-4_3

SC2 : Satisfiability Checking Meets Symbolic Computation. / Ábrahám, Erika; Abbott, John; Becker, Bernd; Bigatti, Anna M.; Brain, Martin; Buchberger, Bruno; Cimatti, Alessandro; Davenport, James H.; England, Matthew; Fontaine, Pascal; Forrest, Stephen; Griggio, Alberto; Kroening, Daniel; Seiler, Werner M.; Sturm, Thomas.

Intelligent Computer Mathematics. ed. / Michael Kohlhase; Moa Johansson; Bruce Miller; Leonardo de Moura; Frank Tompa. Vol. 9791 Switzerland : Springer Verlag, 2016. p. 28-43 (Lecture Notes in Computer Science; Vol. 9791).

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

Ábrahám, E, Abbott, J, Becker, B, Bigatti, AM, Brain, M, Buchberger, B, Cimatti, A, Davenport, JH, England, M, Fontaine, P, Forrest, S, Griggio, A, Kroening, D, Seiler, WM & Sturm, T 2016, SC2 : Satisfiability Checking Meets Symbolic Computation. in M Kohlhase, M Johansson, B Miller, L de Moura & F Tompa (eds), Intelligent Computer Mathematics. vol. 9791, Lecture Notes in Computer Science, vol. 9791, Springer Verlag, Switzerland, pp. 28-43, 2016 International Conference on Intelligent Computer Mathematics, Prague, Czech Republic, 8/07/16. https://doi.org/10.1007/978-3-319-42547-4_3
Ábrahám E, Abbott J, Becker B, Bigatti AM, Brain M, Buchberger B et al. SC2 : Satisfiability Checking Meets Symbolic Computation. In Kohlhase M, Johansson M, Miller B, de Moura L, Tompa F, editors, Intelligent Computer Mathematics. Vol. 9791. Switzerland: Springer Verlag. 2016. p. 28-43. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-42547-4_3
Ábrahám, Erika ; Abbott, John ; Becker, Bernd ; Bigatti, Anna M. ; Brain, Martin ; Buchberger, Bruno ; Cimatti, Alessandro ; Davenport, James H. ; England, Matthew ; Fontaine, Pascal ; Forrest, Stephen ; Griggio, Alberto ; Kroening, Daniel ; Seiler, Werner M. ; Sturm, Thomas. / SC2 : Satisfiability Checking Meets Symbolic Computation. Intelligent Computer Mathematics. editor / Michael Kohlhase ; Moa Johansson ; Bruce Miller ; Leonardo de Moura ; Frank Tompa. Vol. 9791 Switzerland : Springer Verlag, 2016. pp. 28-43 (Lecture Notes in Computer Science).
@inproceedings{de7e55d619c7404fb4d277c3b93ba0ff,
title = "SC2 : Satisfiability Checking Meets Symbolic Computation",
abstract = "Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC2 community.",
keywords = "Logical problems, Symbolic computation, Computer algebra systems, Satisfiability checking, Satisfiability modulo theories",
author = "Erika {\'A}brah{\'a}m and John Abbott and Bernd Becker and Bigatti, {Anna M.} and Martin Brain and Bruno Buchberger and Alessandro Cimatti and Davenport, {James H.} and Matthew England and Pascal Fontaine and Stephen Forrest and Alberto Griggio and Daniel Kroening and Seiler, {Werner M.} and Thomas Sturm",
note = "Funded by EU Horizon 2020 FETOPEN-2016-2017-CSA project SC^2 (712689)",
year = "2016",
month = "7",
day = "12",
doi = "10.1007/978-3-319-42547-4_3",
language = "English",
isbn = "978-3-319-42546-7",
volume = "9791",
series = "Lecture Notes in Computer Science",
publisher = "Springer Verlag",
pages = "28--43",
editor = "Michael Kohlhase and Moa Johansson and Bruce Miller and {de Moura}, Leonardo and Frank Tompa",
booktitle = "Intelligent Computer Mathematics",
address = "Austria",

}

TY - GEN

T1 - SC2 : Satisfiability Checking Meets Symbolic Computation

AU - Ábrahám, Erika

AU - Abbott, John

AU - Becker, Bernd

AU - Bigatti, Anna M.

AU - Brain, Martin

AU - Buchberger, Bruno

AU - Cimatti, Alessandro

AU - Davenport, James H.

AU - England, Matthew

AU - Fontaine, Pascal

AU - Forrest, Stephen

AU - Griggio, Alberto

AU - Kroening, Daniel

AU - Seiler, Werner M.

AU - Sturm, Thomas

N1 - Funded by EU Horizon 2020 FETOPEN-2016-2017-CSA project SC^2 (712689)

PY - 2016/7/12

Y1 - 2016/7/12

N2 - Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC2 community.

AB - Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC2 community.

KW - Logical problems

KW - Symbolic computation

KW - Computer algebra systems

KW - Satisfiability checking

KW - Satisfiability modulo theories

U2 - 10.1007/978-3-319-42547-4_3

DO - 10.1007/978-3-319-42547-4_3

M3 - Conference proceeding

SN - 978-3-319-42546-7

VL - 9791

T3 - Lecture Notes in Computer Science

SP - 28

EP - 43

BT - Intelligent Computer Mathematics

A2 - Kohlhase, Michael

A2 - Johansson, Moa

A2 - Miller, Bruce

A2 - de Moura, Leonardo

A2 - Tompa, Frank

PB - Springer Verlag

CY - Switzerland

ER -