{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T07:14:23Z","timestamp":1761549263271,"version":"build-2065373602"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-4","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SAT"],"DOI":"10.3233\/sat190015","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T15:11:33Z","timestamp":1575040293000},"page":"27-46","source":"Crossref","is-referenced-by-count":18,"title":["Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques"],"prefix":"10.1177","volume":"2","author":[{"given":"Harri","family":"Haanp\u00e4\u00e4","sequence":"first","affiliation":[{"name":"Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[{"name":"Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[{"name":"Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[{"name":"Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. E-mails:\u00a0Harri.Haanpaa@tkk.fi,\u00a0Matti.Jarvisalo@tkk.fi,\u00a0Petteri.Kaski@tkk.fi,\u00a0Ilkka.Niemela@tkk.fi"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2006,3,1]]},"container-title":["Journal on Satisfiability, Boolean Modeling and Computation"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SAT190015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T07:08:27Z","timestamp":1761548907000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SAT190015"}},"subtitle":[],"editor":[{"given":"Daniel","family":"Le Berre","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Laurent","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2006,3,1]]},"references-count":0,"journal-issue":{"issue":"1-4","published-online":{"date-parts":[[2006,3,1]]}},"URL":"https:\/\/doi.org\/10.3233\/sat190015","relation":{},"ISSN":["1574-0617"],"issn-type":[{"type":"electronic","value":"1574-0617"}],"subject":[],"published":{"date-parts":[[2006,3,1]]}}}