{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:08:06Z","timestamp":1761487686669},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462675"},{"type":"electronic","value":"9783540462682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_25","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:07:42Z","timestamp":1159445262000},"page":"329-343","source":"Crossref","is-referenced-by-count":7,"title":["Compiling Constraint Networks into AND\/OR Multi-valued Decision Diagrams (AOMDDs)"],"prefix":"10.1007","author":[{"given":"Robert","family":"Mateescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rina","family":"Dechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Dechter, R., Mateescu, R.: Mixtures of deterministic-probabilistic networks and their and\/or search space. In: UAI 2004, pp. 120\u2013129 (2004)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/978-3-540-30201-8_56","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"R. Dechter","year":"2004","unstructured":"Dechter, R., Mateescu, R.: The impact of and\/or search spaces on constraint satisfaction and counting. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 731\u2013736. Springer, Heidelberg (2004)"},{"key":"25_CR3","unstructured":"Mateescu, R., Dechter, R.: The relationship between and\/or search and variable elimination. In: UAI 2005, pp. 380\u2013387 (2005)"},{"key":"25_CR4","unstructured":"Dechter, R., Mateescu, R.: And\/or search spaces for graphical models. Artificial Intelligence (forthcoming, 2006)"},{"key":"25_CR5","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"25_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic, Dordrecht (1993)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transaction on Computers"},{"key":"25_CR8","unstructured":"Brayton, R., McMullen, C.: The decomposition and factorization of boolean expressions. In: ISCAS, Proceedings of the International Symposium on Circuits and Systems, pp. 49\u201354 (1982)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Bertacco, V., Damiani, M.: The disjunctive decomposition of logic functions. In: ICCAD, International Conference on Computer-Aided Design, pp. 78\u201382 (1997)","DOI":"10.1109\/ICCAD.1997.643371"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Hierarchical representation of discrete functions with application to model checking. In: Computer Aided Verification, pp. 41\u201354 (1994)","DOI":"10.1007\/3-540-58179-0_42"},{"issue":"4","key":"25_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/B:CONS.0000049204.75635.7e","volume":"9","author":"H. Fargier","year":"2004","unstructured":"Fargier, H., Vilarem, M.: Compiling csps into tree-driven automata for interactive solving. Constraints\u00a09(4), 263\u2013287 (2004)","journal-title":"Constraints"},{"key":"25_CR12","unstructured":"Freuder, E.C., Quinn, M.J.: Taking advantage of stable sets of variables in constraint satisfaction problems. In: IJCAI 1985, pp. 1076\u20131078 (1985)"},{"key":"25_CR13","volume-title":"Nonserial Dynamic Programming","author":"U. Bertele","year":"1972","unstructured":"Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press, London (1972)"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence\u00a0113, 41\u201385 (1999)","journal-title":"Artificial Intelligence"},{"key":"25_CR15","unstructured":"Bayardo, R., Miranker, D.: A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In: AAAI 1996, pp. 298\u2013304 (1996)"},{"issue":"1-2","key":"25_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(00)00069-2","volume":"125","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: Recursive conditioning. Artificial Intelligence\u00a0125(1-2), 5\u201341 (2001)","journal-title":"Artificial Intelligence"},{"key":"25_CR17","unstructured":"Wilson, N.: Decision diagrams for the computation of semiring valuations. In: IJCAI 2005, pp. 331\u2013336 (2005)"},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A. Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research (JAIR)\u00a017, 229\u2013264 (2002)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"25_CR19","unstructured":"Huang, J., Darwiche, A.: Dpll with a trace: From sat to knowledge compilation. In: IJCAI 2005, pp. 156\u2013162 (2005)"},{"key":"25_CR20","unstructured":"McAllester, D., Collins, M., Pereira, F.: Case-factor diagrams for structured probabilistic modeling. In: UAI 2004, pp. 382\u2013391 (2004)"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"key":"25_CR22","unstructured":"Cobb, J.: Joining and\/or networks. Report, Radcliffe fellowship, Cambridge, MA (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:34Z","timestamp":1619508634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11889205_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}