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 SC2SC2 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 SC2SC2 community.

SC^2: 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. - 9791:(2016), pp. 28-43. (Intervento presentato al convegno 9th Conference on Intelligent Computer Mathematics CICM 2016 tenutosi a Bialystok, Poland nel July 25-29, 2016) [10.1007/978-3-319-42547-4_3].

SC^2: Satisfiability Checking Meets Symbolic Computation

Cimatti Alessandro;Griggio Alberto;
2016-01-01

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 SC2SC2 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 SC2SC2 community.
2016
Intelligent Computer Mathematics - 9th International Conference, CICM 2016
Cham, Switzerland
Springer
978-3-319-42546-7
Á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
SC^2: 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. - 9791:(2016), pp. 28-43. (Intervento presentato al convegno 9th Conference on Intelligent Computer Mathematics CICM 2016 tenutosi a Bialystok, Poland nel July 25-29, 2016) [10.1007/978-3-319-42547-4_3].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/342994
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 29
  • ???jsp.display-item.citation.isi??? 21
social impact