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 Abstractpeer-review

    4 Citations (Scopus)
    83 Downloads (Pure)


    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
    Issue number4
    Publication statusPublished - 1 Dec 2016
    EventInternational Symposium on Symbolic and Algebraic Computation - Wilfrid Laurier University, Waterloo, Canada
    Duration: 20 Jul 201622 Jul 2016

    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)}


    Dive into the research topics of 'Satisfiability Checking and Symbolic Computation'. Together they form a unique fingerprint.

    Cite this