{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:25Z","timestamp":1750220005167,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"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":[[2021,9]]},"abstract":"<jats:p>This abstract seeks to introduce the ISSAC community to the DEWCAD project, which is based at Coventry University and the University of Bath, in the United Kingdom. The project seeks to push back the Doubly Exponential Wall of Cylindrical Algebraic Decomposition, through the integration of SAT\/SMT technology, the extension of Lazard projection theory, and the development of new algorithms based on CAD technology but without producing CADs themselves. The project also seeks to develop applications of CAD and will focus on applications in the domains of economics and bio-network analysis.<\/jats:p>","DOI":"10.1145\/3511528.3511538","type":"journal-article","created":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T17:07:13Z","timestamp":1642007233000},"page":"107-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The DEWCAD project"],"prefix":"10.1145","volume":"55","author":[{"given":"R.","family":"Bradford","sequence":"first","affiliation":[{"name":"University of Bath, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. H.","family":"Davenport","sequence":"additional","affiliation":[{"name":"University of Bath, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"England","sequence":"additional","affiliation":[{"name":"Coventry University, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sadeghimanesh","sequence":"additional","affiliation":[{"name":"Coventry University, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Uncu","sequence":"additional","affiliation":[{"name":"University of Bath, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,1,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42547-4_3"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2020.100633"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2627488"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-929-5-825"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313880.3313885"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.008"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.11.002"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60026-6_8"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756654"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277557"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00419-017-1271-8"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576718"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96418-8_20"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.019"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.11.010"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31365-3_27"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.018"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1_12"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/309831.309892"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.02.001"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2017.12.002"},{"key":"e_1_2_1_23_1","first-page":"48","volume-title":"Proc. 3rd Workshop on Satisfiability Checking and Symbolic Computation (SC2 2018), CEUR Workshop Proceedings 2189","author":"Mulligan C.","year":"2018","unstructured":"C. Mulligan , R. Bradford , J.H. Davenport , M. England , and Z. Tonks . Non-linear real arithmetic benchmarks derived from automated reasoning in economics. In A.M. Bigatti and M. Brain, editors , Proc. 3rd Workshop on Satisfiability Checking and Symbolic Computation (SC2 2018), CEUR Workshop Proceedings 2189 , pages 48 -- 60 , 2018 . URL: http:\/\/ceur-ws.org\/Vol-2189\/. C. Mulligan, R. Bradford, J.H. Davenport, M. England, and Z. Tonks. Non-linear real arithmetic benchmarks derived from automated reasoning in economics. In A.M. Bigatti and M. Brain, editors, Proc. 3rd Workshop on Satisfiability Checking and Symbolic Computation (SC2 2018), CEUR Workshop Proceedings 2189, pages 48--60, 2018. URL: http:\/\/ceur-ws.org\/Vol-2189\/."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96418-8_44"},{"key":"e_1_2_1_25_1","volume-title":"Proc. 4th Workshop on Satisfiability Checking and Symbolic Computation (SC2 2019), CEUR Workshop Proceedings 2460","author":"Nair A.","year":"2019","unstructured":"A. Nair , J.H. Davenport , and G. Sankaran . On benefits of equality constraints in lex-least invariant cad. In J. Abbott and A. Griggio, editors , Proc. 4th Workshop on Satisfiability Checking and Symbolic Computation (SC2 2019), CEUR Workshop Proceedings 2460 , 2019 . URL: http:\/\/ceur-ws.org\/Vol-2460\/. A. Nair, J.H. Davenport, and G. Sankaran. On benefits of equality constraints in lex-least invariant cad. In J. Abbott and A. Griggio, editors, Proc. 4th Workshop on Satisfiability Checking and Symbolic Computation (SC2 2019), CEUR Workshop Proceedings 2460, 2019. URL: http:\/\/ceur-ws.org\/Vol-2460\/."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52200-1_2"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1101\/2021.02.03.429609"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.11.018"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993935"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511528.3511538","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511528.3511538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:04Z","timestamp":1750182664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511528.3511538"}},"subtitle":["pushing back the doubly exponential wall of cylindrical algebraic decomposition"],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["10.1145\/3511528.3511538"],"URL":"https:\/\/doi.org\/10.1145\/3511528.3511538","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"2022-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}