{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T04:04:54Z","timestamp":1750478694513,"version":"3.41.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2004,8,12]],"date-time":"2004-08-12T00:00:00Z","timestamp":1092268800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:p>We propose an alternative way to represent graphs via OBDDs based on the observation that a partition of the graph nodes allows sharing among the employed OBDDs. In the second part of the paper we present a method to compute at the same time the quotient w.r.t. the maximum bisimulation and the OBDD representation of a given graph. The proposed computation is based on an OBDD-rewriting of the notion of Ackermann encoding of hereditarily finite sets into natural numbers.<\/jats:p>","DOI":"10.1017\/s1471068404002091","type":"journal-article","created":{"date-parts":[[2004,10,14]],"date-time":"2004-10-14T08:31:43Z","timestamp":1097742703000},"page":"695-718","source":"Crossref","is-referenced-by-count":11,"title":["Ackermann encoding, bisimulations and OBDDs"],"prefix":"10.1017","volume":"4","author":[{"given":"CARLA","family":"PIAZZA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALBERTO","family":"POLICRITI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2004,8,12]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068404002091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T17:18:02Z","timestamp":1750439882000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068404002091\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,12]]},"references-count":0,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S1471068404002091"],"URL":"https:\/\/doi.org\/10.1017\/s1471068404002091","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2004,8,12]]}}}