{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:15:33Z","timestamp":1774988133850,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"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":2950,"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":[[2005,7]]},"DOI":"10.1016\/j.entcs.2004.06.068","type":"journal-article","created":{"date-parts":[[2005,7,7]],"date-time":"2005-07-07T11:24:27Z","timestamp":1120735467000},"page":"69-85","source":"Crossref","is-referenced-by-count":7,"title":["Justifying Equality"],"prefix":"10.1016","volume":"125","author":[{"given":"Leonardo","family":"de Moura","sequence":"first","affiliation":[]},{"given":"Harald","family":"Rue\u00df","sequence":"additional","affiliation":[]},{"given":"Natarajan","family":"Shankar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2004.06.068_bib001","series-title":"Automated Deduction\u2014CADE-17","first-page":"64","article-title":"Abstract congruence closure and specializations","volume":"volume 1831","author":"Bachmair","year":"2000"},{"key":"10.1016\/j.entcs.2004.06.068_bib002","series-title":"Computer-Aided Verification","first-page":"236","article-title":"Checking satisfiability of first-order formulas by incremental translation to SAT","volume":"volume 2404","author":"Barrett","year":"2002"},{"key":"10.1016\/j.entcs.2004.06.068_bib003","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/j.entcs.2004.06.068_bib004","series-title":"Formal Methods in Computer-Aided Design","first-page":"19","article-title":"Counter-example based predicate discovery in predicate abstraction","author":"Das","year":"2002"},{"key":"10.1016\/j.entcs.2004.06.068_bib005","unstructured":"L. de Moura and H. Rue\u00df. Lemmas on demand for satisfiability solvers. In Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'02), May 2002. Extended version at http:\/\/www.csl.sri.com\/users\/ruess\/papers\/SAT2002\/index.html"},{"key":"10.1016\/j.entcs.2004.06.068_bib006","series-title":"International Conference on Automated Deduction","first-page":"438","article-title":"Lazy theorem proving for bounded model checking over infinite domains","volume":"volume 2392","author":"de Moura","year":"2002"},{"key":"10.1016\/j.entcs.2004.06.068_bib007","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1006\/jcom.1993.1014","article-title":"Witnesses for boolean matrix multiplication and for transitive closure","volume":"9","author":"Galil","year":"1993","journal-title":"Journal of Complexity"},{"key":"10.1016\/j.entcs.2004.06.068_bib008","series-title":"Rewriting Techniques and Applications, RTA 1997","first-page":"23","article-title":"Shostak's congruence closure as completion","volume":"volume 1103","author":"Kapur","year":"1997"},{"key":"10.1016\/j.entcs.2004.06.068_bib009","first-page":"1","article-title":"Combining Shostak theories","volume":"volume 2378","author":"Shankar","year":"2002"},{"key":"10.1016\/j.entcs.2004.06.068_bib010","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/j.entcs.2004.06.068_bib011","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","author":"Tarjan","year":"1975","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.entcs.2004.06.068_bib012","unstructured":"A. Tiwari. Personal communication. June 2004"},{"key":"10.1016\/j.entcs.2004.06.068_bib013","unstructured":"S.A. Wolfman and D.S. Weld. The LPSAT engine: Its application to resource planning. In IJCAI, pages 310\u2013317, 1999"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105050735?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105050735?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T12:00:24Z","timestamp":1548331224000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105050735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["S1571066105050735"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2004.06.068","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}