Satisfiability Checking and Symbolic Computation

E. Abraham, J. Abbott, B. Becker, A. M. Bigatti, M. Brain, B. Buchberger, A. Cimatti, J. H. Davenport, Matthew England, P. Fontaine, S. Forrest, A. Griggio, D. Kroening, W. M. Seiler, T. Sturm

Research output: Contribution to journalMeeting Abstract

1 Citation (Scopus)
36 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
JournalACM Communications in Computer Algebra
Volume50
Issue number4
DOIs
Publication statusPublished - Dec 2016
EventInternational Symposium on Symbolic and Algebraic Computation - Wilfrid Laurier University, Waterloo, Canada
Duration: 20 Jul 201622 Jul 2016
http://www.issac-conference.org/2016/

Fingerprint

Symbolic Computation
Decision Procedures
Interaction
Community

Bibliographical note

© ACM, 2016. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Communications in Computer Algebra, {50, 4, (2016)}
http://doi.acm.org/10.1145/3055282.3055285

Cite this

Abraham, E., Abbott, J., Becker, B., Bigatti, A. M., Brain, M., Buchberger, B., ... Sturm, T. (2016). Satisfiability Checking and Symbolic Computation. ACM Communications in Computer Algebra, 50(4), 145-147. https://doi.org/10.1145/3055282.3055285

Satisfiability Checking and Symbolic Computation. / Abraham, E.; Abbott, J.; Becker, B.; Bigatti, A. M.; Brain, M.; Buchberger, B.; Cimatti, A.; Davenport, J. H.; England, Matthew; Fontaine, P.; Forrest, S.; Griggio, A.; Kroening, D.; Seiler, W. M.; Sturm, T.

In: ACM Communications in Computer Algebra, Vol. 50, No. 4, 12.2016, p. 145-147.

Research output: Contribution to journalMeeting Abstract

Abraham, 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, 'Satisfiability Checking and Symbolic Computation' ACM Communications in Computer Algebra, vol. 50, no. 4, pp. 145-147. https://doi.org/10.1145/3055282.3055285
Abraham E, Abbott J, Becker B, Bigatti AM, Brain M, Buchberger B et al. Satisfiability Checking and Symbolic Computation. ACM Communications in Computer Algebra. 2016 Dec;50(4):145-147. https://doi.org/10.1145/3055282.3055285
Abraham, E. ; Abbott, J. ; Becker, B. ; Bigatti, A. M. ; Brain, M. ; Buchberger, B. ; Cimatti, A. ; Davenport, J. H. ; England, Matthew ; Fontaine, P. ; Forrest, S. ; Griggio, A. ; Kroening, D. ; Seiler, W. M. ; Sturm, T. / Satisfiability Checking and Symbolic Computation. In: ACM Communications in Computer Algebra. 2016 ; Vol. 50, No. 4. pp. 145-147.
@article{58356be1c18a4dd5be3470474c5b0c14,
title = "Satisfiability Checking and Symbolic Computation",
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.",
author = "E. Abraham and J. Abbott and B. Becker and Bigatti, {A. M.} and M. Brain and B. Buchberger and A. Cimatti and Davenport, {J. H.} and Matthew England and P. Fontaine and S. Forrest and A. Griggio and D. Kroening and Seiler, {W. M.} and T. Sturm",
note = "{\circledC} ACM, 2016. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Communications in Computer Algebra, {50, 4, (2016)} http://doi.acm.org/10.1145/3055282.3055285",
year = "2016",
month = "12",
doi = "10.1145/3055282.3055285",
language = "English",
volume = "50",
pages = "145--147",
journal = "ACM Communications in Computer Algebra",
issn = "1932-2232",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Satisfiability Checking and Symbolic Computation

AU - Abraham, E.

AU - Abbott, J.

AU - Becker, B.

AU - Bigatti, A. M.

AU - Brain, M.

AU - Buchberger, B.

AU - Cimatti, A.

AU - Davenport, J. H.

AU - England, Matthew

AU - Fontaine, P.

AU - Forrest, S.

AU - Griggio, A.

AU - Kroening, D.

AU - Seiler, W. M.

AU - Sturm, T.

N1 - © ACM, 2016. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Communications in Computer Algebra, {50, 4, (2016)} http://doi.acm.org/10.1145/3055282.3055285

PY - 2016/12

Y1 - 2016/12

N2 - 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.

AB - 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.

U2 - 10.1145/3055282.3055285

DO - 10.1145/3055282.3055285

M3 - Meeting Abstract

VL - 50

SP - 145

EP - 147

JO - ACM Communications in Computer Algebra

JF - ACM Communications in Computer Algebra

SN - 1932-2232

IS - 4

ER -