{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:16:09Z","timestamp":1729674969551,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/hpcsim.2009.5195313","type":"proceedings-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T15:09:58Z","timestamp":1250003398000},"page":"168-175","source":"Crossref","is-referenced-by-count":0,"title":["Concurrent-distributed programming techniques for SAT using DPLL-stålmarck"],"prefix":"10.1109","author":[{"family":"Sripriya G","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Bundy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Smaill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00323-3"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0030"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/MTV.2005.17"},{"key":"12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/3-540-49519-3_7","article-title":"a tutorial on stalmarck's proof procedure for propositional logic","volume":"152","author":"sheeran","year":"1998","journal-title":"Lecture Notes in Computer Science"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2005.1558680"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-008-9115-4"},{"key":"1","first-page":"725","article-title":"a proof engine approach to solving combinational design automation problems","author":"andersson","year":"2002","journal-title":"Design Automation Conference"},{"journal-title":"Informatics Programming Systems Saarland-University","year":"2007","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/276675.276685"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.10.020"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.01.004"},{"key":"9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1006366304347","article-title":"the propositional formula checker heerhugo","volume":"24","author":"groote","year":"2000","journal-title":"Journal of Automated Reasoning"},{"journal-title":"Practical Algorithms for the SAT-problem","year":"2006","author":"goldberg","key":"8"}],"event":{"name":"Simulation (HPCS)","start":{"date-parts":[[2009,6,21]]},"location":"Leipzig, Germany","end":{"date-parts":[[2009,6,24]]}},"container-title":["2009 International Conference on High Performance Computing & Simulation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5173446\/5191573\/05195313.pdf?arnumber=5195313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T18:43:28Z","timestamp":1497811408000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5195313\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/hpcsim.2009.5195313","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}