{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:50:10Z","timestamp":1761562210139,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T00:00:00Z","timestamp":1487721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2017,2,22]]},"abstract":"<jats:p>\n            <jats:italic>Symbolic Computation<\/jats:italic>\n            and\n            <jats:italic>Satisfiability Checking<\/jats:italic>\n            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 SC\n            <jats:sup>2<\/jats:sup>\n            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.\n          <\/jats:p>","DOI":"10.1145\/3055282.3055285","type":"journal-article","created":{"date-parts":[[2017,2,27]],"date-time":"2017-02-27T13:06:52Z","timestamp":1488200812000},"page":"145-147","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Satisfiability checking and symbolic computation"],"prefix":"10.1145","volume":"50","author":[{"given":"E.","family":"\u00c1brah\u00e1m","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Abbott","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Kassel, Kassel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Becker","sequence":"additional","affiliation":[{"name":"Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. M.","family":"Bigatti","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli studi di Genova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Brain","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Buchberger","sequence":"additional","affiliation":[{"name":"Johannes Kepler Universit\u00e4t, Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Cimatti","sequence":"additional","affiliation":[{"name":"Fondazione Bruno Kessler, Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. H.","family":"Davenport","sequence":"additional","affiliation":[{"name":"University of Bath, Bath, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"England","sequence":"additional","affiliation":[{"name":"Coventry University, Coventry, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Fontaine","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lorraine, Nancy, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Forrest","sequence":"additional","affiliation":[{"name":"Maplesoft Europe Ltd"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Griggio","sequence":"additional","affiliation":[{"name":"Fondazione Bruno Kessler, Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Kroening","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. M.","family":"Seiler","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Kassel, Kassel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Sturm","sequence":"additional","affiliation":[{"name":"CNRS, LORIA, Nancy, France and Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,2,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756636"},{"key":"e_1_2_1_2_1","volume-title":"CICM","author":"\u00c1brah\u00e1m E.","year":"2016","unstructured":"E. \u00c1brah\u00e1m , J. 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 and T. Sturm . SC2: Satisfiability Checking meets Symbolic Computation (Project Paper). Accepted for publication In: Proc . CICM 2016 . Preprint : http:\/\/www.sc-square.org\/Papers\/CICM16.pdf E. \u00c1brah\u00e1m, J. 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 and T. Sturm. SC2: Satisfiability Checking meets Symbolic Computation (Project Paper). Accepted for publication In: Proc. CICM 2016. Preprint: http:\/\/www.sc-square.org\/Papers\/CICM16.pdf"},{"key":"e_1_2_1_3_1","first-page":"825","volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, 185","author":"Barrett C.","year":"2009","unstructured":"C. Barrett , R. Sebastiani , S.A. Seshia and C. Tinelli . Satisfiability modulo theories . In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, 185 , p 825 -- 885 . IOS Press , 2009 C. Barrett, R. Sebastiani, S.A. Seshia and C. Tinelli. Satisfiability modulo theories. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, 185, p825--885. IOS Press, 2009"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02959-2_35"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055282.3055285","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055282.3055285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:37Z","timestamp":1750217797000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055282.3055285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,22]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,2,22]]}},"alternative-id":["10.1145\/3055282.3055285"],"URL":"https:\/\/doi.org\/10.1145\/3055282.3055285","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2017,2,22]]},"assertion":[{"value":"2017-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}