{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:32:51Z","timestamp":1648996371929},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3742,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1571-0661(04)80661-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"162-173","source":"Crossref","is-referenced-by-count":6,"title":["Transforming equality logic to propositional logic"],"prefix":"10.1016","volume":"86","author":[{"given":"Hans","family":"Zantema","sequence":"first","affiliation":[]},{"given":"Jan Friso","family":"Groote","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB1","series-title":"Studies in Logic and the Foundations of Mathematics","article-title":"\u201cSolvable cases of the decision problem\u201d","author":"Ackermann","year":"1954"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/371282.371364","article-title":"Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic","volume":"2","author":"Bryant","year":"2001","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB3","series-title":"Computer-Aided Verification (CAV'00)","first-page":"85","article-title":"Boolean satisfiability with transitivity constraints","author":"Bryant","year":"2000"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB4","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/566385.566390","article-title":"Boolean satisfiability with transitivity constraints","volume":"3","author":"Bryant","year":"2002","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB5","series-title":"Computer-Aided Verification (CAV'94)","first-page":"68","article-title":"Automated verification of pipelined microprocessor control","author":"Burch","year":"1994"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Goel A., K. Sajid, H. Zhou, A. Aziz and V. Singhal, BDD based procedures for a theory of equality with uninterpreted functions, in: Proceedings of Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1427 (1998), pp. 244\u2013255.","DOI":"10.1007\/BFb0028749"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB7","series-title":"Logic for Programming and Reasoning (LPAR)","first-page":"161","article-title":"Equational binary decision diagrams","author":"Groote","year":"2000"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1006366304347","article-title":"The propositional formula checker HeerHugo","volume":"24","author":"Groote","year":"2000","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB9","series-title":"Computer Aided Verification (CAV'99)","first-page":"455","article-title":"Deciding equality formulas by small domains instantiations","author":"Pnueli","year":"1999"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB10","series-title":"Computer Aided Verification (CAV'01)","first-page":"144","article-title":"Finite instantiations in equivalence logic with uninterpreted functions","author":"Rodeh","year":"2001"},{"key":"10.1016\/S1571-0661(04)80661-3_NEWBIB11","unstructured":"Tveretina O. and H. Zantema, A proof system and a decision procedure for equality logic, Technical Report CS-report 03\u201302, Eindhoven University of Technology (2003), available via http:\/\/www.win.tue.nl\/~hzantema\/TZ.pdf."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806613?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806613?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:06Z","timestamp":1549191186000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1571066104806613"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80661-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}