Satisfiability checking and symbolic computation

E. Ábrahám, John Abbott, B. Becker, A. M. Bigatti, M. Brain, B. Buchberger, A. Cimatti, J. H. Davenport, M. England, P. Fontaine, S. Forrest, A. Griggio, D. Kroening, W. M. Seiler, T. Sturm

Research output: Contribution to journalArticle

2 Citations (Scopus)
125 Downloads (Pure)

Abstract

Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite these commonalities, the two communities are currently only weakly connected. We introduce a new project SC2 to build a joint community in this area, supported by a newly accepted EU (H2020-FETOPEN-CSA) project of the same name. We aim to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap. This abstract and accompanying poster describes the motivation and aims for the project, and reports on the first activities.

Original languageEnglish
Pages (from-to)145-147
Number of pages3
JournalACM Communications in Computer Algebra
Volume50
Issue number4
DOIs
Publication statusPublished - 1 Dec 2016

Fingerprint Dive into the research topics of 'Satisfiability checking and symbolic computation'. Together they form a unique fingerprint.

  • Projects

  • Cite this

    Ábrahám, E., Abbott, J., Becker, B., Bigatti, A. M., Brain, M., Buchberger, B., Cimatti, A., Davenport, J. H., England, M., Fontaine, P., Forrest, S., Griggio, A., Kroening, D., Seiler, W. M., & Sturm, T. (2016). Satisfiability checking and symbolic computation. ACM Communications in Computer Algebra, 50(4), 145-147. https://doi.org/10.1145/3055282.3055285