{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T07:54:30Z","timestamp":1726300470314},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_13","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"195-210","source":"Crossref","is-referenced-by-count":4,"title":["Explaining Propagators for s-DNNF Circuits"],"prefix":"10.1007","author":[{"given":"Graeme","family":"Gange","sequence":"first","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-540-85958-1_34","volume-title":"Principles and Practice of Constraint Programming","author":"K.C.K. Cheng","year":"2008","unstructured":"Cheng, K.C.K., Yap, R.H.C.: Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 509\u2013523. Springer, Heidelberg (2008)"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1613\/jair.3014","volume":"38","author":"G. Gange","year":"2010","unstructured":"Gange, G., Stuckey, P., Lagoon, V.: Fast set bounds propagation using a BDD-SAT hybrid. Journal of Artificial Intelligence Research\u00a038, 307\u2013338 (2010)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10601-011-9111-x","volume":"16","author":"G. Gange","year":"2011","unstructured":"Gange, G., Stuckey, P.J., Szymanek, R.: MDD propagators with explanation. Constraints\u00a016(4), 407\u2013429 (2011)","journal-title":"Constraints"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pesant","year":"2004","unstructured":"Pesant, G.: A Regular Language Membership Constraint for Finite Sequences of Variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"13_CR5","unstructured":"Darwiche, A.: Sdd: A new canonical representation of propositional knowledge bases. In: IJCAI, pp. 819\u2013826 (2011)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, part 2, pp. 115\u2013125 (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"issue":"1","key":"13_CR7","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1452044.1452046","volume":"31","author":"C. Schulte","year":"2008","unstructured":"Schulte, C., Stuckey, P.: Efficient constraint propagation engines. ACM Transactions on Programming Languages and Systems\u00a031(1), Article No. 2 (2008)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"13_CR9","unstructured":"Fargier, H., Marquis, P.: On valued negation normal form formulas. In: IJCAI, pp. 360\u2013365 (2007)"},{"key":"13_CR10","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\u00a017, 229\u2013264 (2002)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/11889205_64","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C. Quimper","year":"2006","unstructured":"Quimper, C., Walsh, T.: Global Grammar Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 751\u2013755. Springer, Heidelberg (2006)"},{"key":"13_CR12","unstructured":"Jung, J.C., Barahona, P., Katsirelos, G., Walsh, T.: Two encodings of DNNF theories. In: ECAI Workshop on Inference Methods Based on Graphical Structures of Knowledge (2008)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11603023_8","volume-title":"Practical Aspects of Declarative Languages","author":"P. Hawkins","year":"2005","unstructured":"Hawkins, P., Stuckey, P.J.: A Hybrid BDD and SAT Finite Domain Constraint Solver. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol.\u00a03819, pp. 103\u2013117. Springer, Heidelberg (2005)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-77442-6_5","volume-title":"Practical Aspects of Declarative Languages","author":"S. Subbarayan","year":"2008","unstructured":"Subbarayan, S.: Efficient Reasoning for Nogoods in Constraint Solvers with BDDs. In: Hudak, P., Warren, D.S. (eds.) PADL 2008. LNCS, vol.\u00a04902, pp. 53\u201367. Springer, Heidelberg (2008)"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S. Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., Rousseau, L.M.: A cost-regular based hybrid column generation approach. Constraints\u00a011(4), 315\u2013333 (2006)","journal-title":"Constraints"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-21581-0_7","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"I. Ab\u00edo","year":"2011","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: BDDs for Pseudo-Boolean Constraints \u2013 Revisited. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 61\u201375. Springer, Heidelberg (2011)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: Reformulating global grammar constraints. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 132\u2013147 (2009)","DOI":"10.1007\/978-3-642-01929-6_11"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:17:39Z","timestamp":1620127059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}