{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:37:43Z","timestamp":1761590263614,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s1567-8326(01)00013-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:11:55Z","timestamp":1027588315000},"page":"61-86","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["A rewriting approach to binary decision diagrams"],"prefix":"10.1016","volume":"49","author":[{"given":"Hans","family":"Zantema","sequence":"first","affiliation":[]},{"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1567-8326(01)00013-3_BIB1","series-title":"Boolean expression diagrams, in: Twelfth Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland","first-page":"88","author":"Andersen","year":"1997"},{"year":"1998","series-title":"Term Rewriting and All That","author":"Baader","key":"10.1016\/S1567-8326(01)00013-3_BIB2"},{"issue":"3","key":"10.1016\/S1567-8326(01)00013-3_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/(SICI)1097-024X(200003)30:3<259::AID-SPE298>3.0.CO;2-Y","volume":"30","author":"van den Brand","year":"2000","journal-title":"Efficient annotated terms. Software \u2013 Practice and Experience"},{"issue":"8","key":"10.1016\/S1567-8326(01)00013-3_BIB4","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans.Comput."},{"issue":"3","key":"10.1016\/S1567-8326(01)00013-3_BIB5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","article-title":"Symbolic boolean manipulation with ordered binary-decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM Comput. Surveys"},{"issue":"4","key":"10.1016\/S1567-8326(01)00013-3_BIB6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/43.275352","article-title":"Symbolic model checking for sequential circuit verification","volume":"13","author":"Burch","year":"1994","journal-title":"IEEE Trans. Comput. Aided Design"},{"issue":"2","key":"10.1016\/S1567-8326(01)00013-3_BIB7","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","article-title":"Automatic verification of finite-state concurrent systems using temporal logic specifications","volume":"8","author":"Clarke","year":"1986","journal-title":"ACM Trans. Prog. Languages Syst."},{"key":"10.1016\/S1567-8326(01)00013-3_BIB8","first-page":"161","article-title":"Equational binary decision diagrams","volume":"vol. 1955","author":"Groote","year":"2000"},{"key":"10.1016\/S1567-8326(01)00013-3_BIB9","series-title":"in: European Design Automation Conference","first-page":"164","article-title":"MORE: Alternative implementation of BDD packages by multi-operand synthesis","author":"Hett","year":"1996"},{"key":"10.1016\/S1567-8326(01)00013-3_BIB10","first-page":"115","article-title":"Unlimp: Uniqueness as a leitmotiv for implementation, in: Proc. Programming Language Implementation and Logic Programming","volume":"vol. 631","author":"Kahrs","year":"1992"},{"key":"10.1016\/S1567-8326(01)00013-3_BIB11","doi-asserted-by":"crossref","unstructured":"J.E. Klop, Term rewriting systems, in: D.G.S. Abramski, T. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Oxford University Press, Oxford, 1992","DOI":"10.1093\/oso\/9780198537618.003.0001"},{"year":"1998","series-title":"Algorithms and Data Structures in VLSI Design OBDD\u2014Foundations and Applications","author":"Meinel","key":"10.1016\/S1567-8326(01)00013-3_BIB12"},{"year":"1999","series-title":"Difference decision diagrams, in: Computer Science Logic, Denmark","author":"M\u00f8ller","key":"10.1016\/S1567-8326(01)00013-3_BIB13"},{"key":"10.1016\/S1567-8326(01)00013-3_BIB14","doi-asserted-by":"crossref","unstructured":"D. Plump, Term graph rewriting, H. Ehrig, G. Engels, H.J. Kreowski, G. Rozenberg (Eds.), in: Handbook of Graph Grammars and Computing by Graph Transformation, Applications, Languages, vol. 2, World Scientific, Singapore, 1999, pp. 3\u201361","DOI":"10.1142\/9789812815149_0001"},{"key":"10.1016\/S1567-8326(01)00013-3_BIB15","doi-asserted-by":"crossref","unstructured":"J. van de Pol, H. Zantema, Binary decision diagrams by shared rewriting, in: M. Nielsen, B. Rovan (Eds.), Mathematical Foundations of Computer Science MFCS2000, Lecture Notes in Comput. Sci., vol. 1893, Springer, Berlin, 2000, pp. 609\u2013618","DOI":"10.1007\/3-540-44612-5_56"},{"key":"10.1016\/S1567-8326(01)00013-3_BIB16","series-title":"Monographs on discrete mathematics and applications","article-title":"Branching programs and binary decision diagrams","author":"Wegener","year":"2000"},{"key":"10.1016\/S1567-8326(01)00013-3_BIB17","unstructured":"H. Zantema, Decision trees: Equivalence and propositional operations, in: H.L. Poutr\u00e9, J. van den Herik (Eds.), Proceedings 10th Netherlands\/Belgium Conference on Artificial Intelligence (NAIC'98), Extended version appeared as report UU-CS-1998-14, Utrecht University, 1998, pp. 157\u2013166"},{"key":"10.1016\/S1567-8326(01)00013-3_BIB18","unstructured":"H. Zantema, H.L. Bodlaender, Sizes of ordered decision trees, Int. J. on Found. of Comp. Sci. (2001), to appear (preliminary version appeared as report UU-CS-1999-31, Utrecht University)"}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832601000133?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832601000133?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:33:27Z","timestamp":1761590007000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567832601000133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S1567832601000133"],"URL":"https:\/\/doi.org\/10.1016\/s1567-8326(01)00013-3","relation":{},"ISSN":["1567-8326"],"issn-type":[{"type":"print","value":"1567-8326"}],"subject":[],"published":{"date-parts":[[2001,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A rewriting approach to binary decision diagrams","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic and Algebraic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1567-8326(01)00013-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}