{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T08:27:23Z","timestamp":1725438443408},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We present some parallelization techniques for the Model Evolution (ME) calculus,<\/jats:p><jats:p>an instantiation-based calculus that lifts the DPLL procedure<\/jats:p><jats:p>to first-order clause logic.<\/jats:p><jats:p>Specifically, we consider a restriction of ME to the EPR fragment<\/jats:p><jats:p>of clause logic for which the calculus is a decision procedure.<\/jats:p><jats:p>The main operations in ME's proof procedures, namely clause instantiation<\/jats:p><jats:p>and candidate literal generation, offer opportunities for MapReduce-style<\/jats:p><jats:p>parallelization.<\/jats:p><jats:p>This term\/clause-level parallelization is largely orthogonal to the sort<\/jats:p><jats:p>of search-level parallelization performed by portfolio approaches.<\/jats:p><jats:p>We describe a hybrid parallel proof procedure for the restricted calculus<\/jats:p><jats:p>that exploits parallelism at both levels to synergistic effect.<\/jats:p><jats:p>The calculus and the proof procedure have been implemented in<\/jats:p><jats:p>a new solver for EPR formulas.<\/jats:p><jats:p>Our initial experimental results show that our term\/clause-level parallelization<\/jats:p><jats:p>alone is effective in reducing runtime and can be combined<\/jats:p><jats:p>with a portfolio-based approach to maximize performance.<\/jats:p>","DOI":"10.29007\/v1f2","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:08Z","timestamp":1516748348000},"page":"96-82","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting parallelism in the ME calculus"],"prefix":"10.29007","volume":"21","author":[{"given":"Tianyi","family":"Liang","sequence":"first","affiliation":[]},{"given":"Cesare","family":"Tinelli","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:12Z","timestamp":1516748352000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/WdR"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/v1f2","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}