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

21 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

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

Fingerprint Dive into the research topics of 'SC<sup>2</sup> : Satisfiability Checking Meets Symbolic Computation'. Together they form a unique fingerprint.

  • 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