{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:57:43Z","timestamp":1743145063392,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276590"},{"type":"electronic","value":"9783642276606"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","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-27660-6_50","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T10:14:28Z","timestamp":1326708868000},"page":"612-624","source":"Crossref","is-referenced-by-count":13,"title":["Knowledge Compilation with Empowerment"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Bordeaux","sequence":"first","affiliation":[]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution. J. of Artif. Intel. Research (JAIR) 40, 353\u2013373 (2011); preliminary version in SAT 2009"},{"key":"50_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F. Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC Via Unit Propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 133\u2013147. Springer, Heidelberg (2007)"},{"issue":"2","key":"50_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375827.375835","volume":"48","author":"E. Ben-Sasson","year":"2001","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. J. of the ACM\u00a048(2), 149\u2013169 (2001)","journal-title":"J. of the ACM"},{"key":"50_CR4","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Decompositions of all different, global cardinality and related constraints. In: Int. Joint. Conf. on Artif. Intel. (IJCAI), pp. 419\u2013424 (2009)"},{"key":"50_CR5","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: Int. Joint. Conf. on Artif. Intel. (IJCAI), pp. 412\u2013418 (2009)"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-74970-7_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Brand","year":"2007","unstructured":"Brand, S., Narodytska, N., Quimper, C.-G., Stuckey, P.J., Walsh, T.: Encodings of the Sequence Constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 210\u2013224. Springer, Heidelberg (2007)"},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/inco.2001.3043","volume":"176","author":"M. Cadoli","year":"2002","unstructured":"Cadoli, M., Donini, F., Liberatore, P., Schaerf, M.: Preprocessing of intractable problems. Information and Computation\u00a0176, 89\u2013120 (2002)","journal-title":"Information and Computation"},{"key":"50_CR8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"D. Darwiche","year":"2002","unstructured":"Darwiche, D., Marquis, P.: A knowledge compilation map. J. of Artif. Intel. Research (JAIR)\u00a017, 229\u2013264 (2002)","journal-title":"J. of Artif. Intel. Research (JAIR)"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T. Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy Clause Generation Reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 352\u2013366. Springer, Heidelberg (2009)"},{"key":"50_CR10","unstructured":"Gent, I.P.: Arc consistency in SAT. In: Euro. Conf. on Artif. Intel. (ECAI), pp. 121\u2013125 (2002)"},{"key":"50_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-85958-1_10","volume-title":"Principles and Practice of Constraint Programming","author":"J. Huang","year":"2008","unstructured":"Huang, J.: Universal Booleanization of Constraint Models. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 144\u2013158. Springer, Heidelberg (2008)"},{"key":"50_CR12","unstructured":"Marquis, P., Sadaoui, S.: A new algorithm for computing theory prime implicates compilations. In: Conf. on Artif. Intel. (AAAI), pp. 504\u2013509 (1996)"},{"key":"50_CR13","unstructured":"Marquis, P.: Knowledge compilation using theory prime implicates. In: IJCAI, pp. 837\u2013845 (1995)"},{"issue":"2","key":"50_CR14","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.artint.2010.10.002","volume":"175","author":"K. Pipatsrisawat","year":"2011","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers as resolution engines. Artif. Intel.\u00a0175(2), 512\u2013525 (2011); preliminary works in AAAI 2008 (notion of empowerment) and CP (2009)","journal-title":"Artif. Intel."},{"key":"50_CR15","unstructured":"Quimper, C.G., Walsh, T.: Decompositions of grammar constraints. In: Conf. on Artif. Intel. (AAAI), pp. 1567\u20131570 (2008)"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"del Val, A.: Tractable databases: How to make propositional unit resolution complete through compilation. In: Knowledge Representation and Reasoning (KR), pp. 551\u2013561 (1994)","DOI":"10.1016\/B978-1-4832-1452-8.50146-9"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:35:47Z","timestamp":1558298147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}