{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:58Z","timestamp":1725515338278},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540686767"},{"type":"electronic","value":"9783540686798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68679-8_15","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T02:58:16Z","timestamp":1213066696000},"page":"238-257","source":"Crossref","is-referenced-by-count":0,"title":["AND\/OR Multi-valued Decision Diagrams for Constraint Networks"],"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":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11889205_25","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"R. Mateescu","year":"2006","unstructured":"Mateescu, R., Dechter, R.: Compiling constraint networks into AND\/OR multi-valued decision diagrams (AOMDDs). In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 329\u2013343. Springer, Heidelberg (2006)"},{"key":"15_CR2","unstructured":"Mateescu, R., Dechter, R.: And\/or multi-valued decision diagrams (aomdds) for weighted graphical models. In: Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007 (2007)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-540-74970-7_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"R. Mateescu","year":"2007","unstructured":"Mateescu, R., Marinescu, R., Dechter, R.: AND\/OR multi-valued decision diagrams for constraint optimization. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 498\u2013513. Springer, Heidelberg (2007)"},{"key":"15_CR4","unstructured":"Dechter, R., Mateescu, R.: Mixtures of deterministic-probabilistic networks and their AND\/OR search space. In: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, UAI 2004, pp. 120\u2013129 (2004)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"15_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.artint.2006.11.003","volume":"171","author":"R. Dechter","year":"2007","unstructured":"Dechter, R., Mateescu, R.: AND\/OR search spaces for graphical models. Artificial Intelligence\u00a0171, 73\u2013106 (2007)","journal-title":"Artificial Intelligence"},{"key":"15_CR7","volume-title":"Model Checking","author":"E. Clarke","year":"1999","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"15_CR8","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 Publishers, Dordrecht (1993)"},{"key":"15_CR9","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 Transactions on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/226643.226644","volume":"43","author":"B. Selman","year":"1996","unstructured":"Selman, B., Kautz, H.: Knowledge compilation and theory approximation. Journal of the ACM\u00a043, 193\u2013224 (1996)","journal-title":"Journal of the ACM"},{"key":"15_CR11","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":"15_CR12","first-page":"137","volume":"10","author":"M. Cadoli","year":"1997","unstructured":"Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Communications\u00a010, 137\u2013150 (1997)","journal-title":"AI Communications"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0004-3702(01)00092-3","volume":"134","author":"R. Korf","year":"2002","unstructured":"Korf, R., Felner, A.: Disjoint pattern database heuristics. Artificial Intelligence\u00a0134, 9\u201322 (2002)","journal-title":"Artificial Intelligence"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Bertacco, V., Damiani, M.: The disjunctive decomposition of logic functions. In: International Conference on Computer-Aided Design (ICCAD), pp. 78\u201382 (1997)","DOI":"10.1109\/ICCAD.1997.643371"},{"key":"15_CR15","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":"15_CR16","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"},{"key":"15_CR17","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, 263\u2013287 (2004)","journal-title":"Constraints"},{"key":"15_CR18","unstructured":"Freuder, E.C., Quinn, M.J.: Taking advantage of stable sets of variables in constraint satisfaction problems. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI 1985), pp. 1076\u20131078 (1985)"},{"key":"15_CR19","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":"15_CR20","unstructured":"Bayardo, R., Miranker, D.: A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI 1996), pp. 298\u2013304 (1996)"},{"key":"15_CR21","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, 5\u201341 (2001)","journal-title":"Artificial Intelligence"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Srinivasan, A., Kam, T., Malik, S., Brayton, R.K.: Algorithms for discrete function manipulation. In: International Conference on Computer-Aided Design (ICCAD), pp. 92\u201395 (1990)","DOI":"10.1109\/ICCAD.1990.129849"},{"key":"15_CR23","unstructured":"Huang, J., Darwiche, A.: Dpll with a trace: From sat to knowledge compilation. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 156\u2013162 (2005)"},{"key":"15_CR24","unstructured":"McAllester, D., Collins, M., Pereira, F.: Case-factor diagrams for structured probabilistic modeling. In: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, UAI 2004, pp. 382\u2013391 (2004)"},{"key":"15_CR25","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":"15_CR26","unstructured":"Mateescu, R., Dechter, R.: The relationship between AND\/OR search and variable elimination. In: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005, pp. 380\u2013387 (2005)"}],"container-title":["Lecture Notes in Computer Science","Concurrency, Graphs and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68679-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T03:31:29Z","timestamp":1551497489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68679-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540686767","9783540686798"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68679-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}