Satisfiability checking and symbolic computation

  title={Satisfiability checking and symbolic computation},
  author={E. {\'A}brah{\'a}m and J. Abbott and B. Becker and Anna Maria Bigatti and Martin Brain and B. Buchberger and A. Cimatti and J. Davenport and Matthew England and P. Fontaine and S. Forrest and A. Griggio and D. Kroening and W. Seiler and T. Sturm},
  journal={ACM Commun. Comput. Algebra},
  • E. Ábrahám, J. Abbott, +12 authors T. Sturm
  • Published 2017
  • Mathematics, Computer Science
  • ACM Commun. Comput. Algebra
  • 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… CONTINUE READING
    5 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    First-Order Tests for Toricity
    • 2
    • PDF
    Parameter Synthesis for Markov Models
    • 6
    • PDF