{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:18:38Z","timestamp":1725686318343},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642294488"},{"type":"electronic","value":"9783642294495"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29449-5_6","type":"book-chapter","created":{"date-parts":[[2012,5,26]],"date-time":"2012-05-26T09:08:46Z","timestamp":1338023326000},"page":"137-171","source":"Crossref","is-referenced-by-count":1,"title":["Representing CSPs with Set-Labeled Diagrams: A Compilation Map"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Niveau","sequence":"first","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Fargier","sequence":"additional","affiliation":[]},{"given":"C\u00e9dric","family":"Pralet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(01)00162-X","volume":"135","author":"J. Amilhastre","year":"2002","unstructured":"Amilhastre, J., Fargier, H., Marquis, P.: Consistency restoration and explanations in dynamic CSPs \u2014 application to configuration. Artificial Intelligence\u00a0135(1-2), 199\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-74970-7_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"H.R. Andersen","year":"2007","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A Constraint Store Based on Multivalued Decision Diagrams. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 118\u2013132. Springer, Heidelberg (2007)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45526-4_1","volume-title":"Automata Implementation","author":"J. Amilhastre","year":"2001","unstructured":"Amilhastre, J., Janssen, P., Vilarem, M.-C.: FA Minimisation Heuristics for a Class of Finite Languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, pp. 1\u201312. Springer, Heidelberg (2001)"},{"issue":"8","key":"6_CR4","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(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1145\/502090.502091","volume":"48","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: Decomposable Negation Normal Form. Journal of the ACM\u00a048(4), 608\u2013647 (2001)","journal-title":"Journal of the ACM"},{"key":"6_CR6","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. JAIR\u00a017, 229\u2013264 (2002)","journal-title":"JAIR"},{"key":"6_CR7","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.-C.: Compiling CSPs into tree-driven automata for interactive solving. Constraints\u00a09, 263\u2013287 (2004)","journal-title":"Constraints"},{"key":"6_CR8","unstructured":"Kautz, H.A., Selman, B.: Forming concepts for fast inference. In: Proc. of AAAI 1992, San Jose, CA, pp. 786\u2013793 (1992)"},{"key":"6_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2622-0","volume-title":"Synthesis of Finite State Machines: Functional Optimization","author":"T. Kam","year":"1997","unstructured":"Kam, T., Villa, T., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: Synthesis of Finite State Machines: Functional Optimization. Kluwer Academic Publishers, Norwell (1997)"},{"issue":"1-2","key":"6_CR10","first-page":"9","volume":"4","author":"T. Kam","year":"1998","unstructured":"Kam, T., Villa, T., Brayton, R.K., Sangiovanni-Vincentelli, A.: Multi-valued Decision Diagrams: Theory and Applications. Multiple-Valued Logic\u00a04(1-2), 9\u201362 (1998)","journal-title":"Multiple-Valued Logic"},{"key":"6_CR11","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":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58940-9","volume-title":"Algorithms and Data Structures in VLSI Design: OBDD \u2014 Foundations and Applications","author":"C. Meinel","year":"1998","unstructured":"Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design: OBDD \u2014 Foundations and Applications. Springer, Heidelberg (1998)"},{"key":"6_CR13","unstructured":"Niveau, A., Fargier, H., Pralet, C., Verfaillie, G.: Knowledge compilation using interval automata and applications to planning. In: ECAI, pp. 459\u2013464 (2010)"},{"key":"6_CR14","unstructured":"Pipatsrisawat, K., Darwiche, A.: New compilation languages based on structured decomposability. In: AAAI 2008, pp. 517\u2013522 (2008)"},{"key":"6_CR15","volume-title":"Handbook of Constraint Programming (Foundations of Artificial Intelligence)","author":"F. Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)"},{"key":"6_CR16","unstructured":"Srinivasan, A., Kam, T., Malik, S., Brayton, R.K.: Algorithms for discrete function manipulation. In: ICCAD 1990, pp. 92\u201395 (November 1990)"},{"key":"6_CR17","unstructured":"Vempaty, N.R.: Solving Constraint Satisfaction Problems Using Finite State Automata. In: AAAI, pp. 453\u2013458 (1992)"}],"container-title":["Lecture Notes in Computer Science","Graph Structures for Knowledge Representation and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29449-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:34:19Z","timestamp":1558312459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29449-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642294488","9783642294495"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29449-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}