{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:11:00Z","timestamp":1767237060177,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112053"},{"type":"electronic","value":"9783319112060"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11206-0_13","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:31:55Z","timestamp":1410744715000},"page":"123-134","source":"Crossref","is-referenced-by-count":9,"title":["A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Manthey","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Philipp","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Steinke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","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_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1613\/jair.3653","volume":"45","author":"I. Ab\u00edo","year":"2012","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E., Mayer-Eichberger, V.: A new look at BDDs for pseudo-Boolean constraints. JAIR\u00a045, 443\u2013480 (2012)","journal-title":"JAIR"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"As\u00edn, R., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: Cardinality networks and their applications. In: Kullmann (ed.) [15], pp. 167\u2013180","DOI":"10.1007\/978-3-642-02777-2_18"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-33558-7_14","volume-title":"Principles and Practice of Constraint Programming","author":"A. Belov","year":"2012","unstructured":"Belov, A., Janota, M., Lynce, I., Marques-Silva, J.: On computing minimal equivalent subformulas. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 158\u2013174. Springer, Heidelberg (2012)"},{"key":"13_CR5","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): IOS Press, Amsterdam (2009)"},{"issue":"1-3","key":"13_CR6","first-page":"155","volume":"123","author":"E. Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. DAM\u00a0123(1-3), 155\u2013225 (2002)","journal-title":"DAM"},{"issue":"12","key":"13_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. CACM\u00a054(12), 92\u2013103 (2011)","journal-title":"CACM"},{"issue":"7","key":"13_CR8","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. CACM\u00a05(7), 394\u2013397 (1962)","journal-title":"CACM"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. JACM\u00a07(3), 201\u2013215 (1960)","journal-title":"JACM"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"key":"13_CR11","first-page":"1","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. JSAT\u00a02, 1\u201326 (2006)","journal-title":"JSAT"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-16242-8_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. H\u00f6lldobler","year":"2010","unstructured":"H\u00f6lldobler, S., Manthey, N., Saptawijaya, A.: Improving resource-unaware SAT solvers. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 519\u2013534. Springer, Heidelberg (2010)"},{"key":"13_CR13","first-page":"359","volume-title":"ECAI 1992","author":"H. Kautz","year":"1992","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Neumann, B. (ed.) ECAI 1992, pp. 359\u2013363. John Wiley & Sons, Inc., New York (1992)"},{"key":"13_CR14","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: AAAI 1996, pp. 1194\u20131201. MIT Press (1996)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","year":"2009","unstructured":"Kullmann, O. (ed.): SAT 2009. LNCS, vol.\u00a05584. Springer, Heidelberg (2009)"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"M.H. Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. JAR\u00a040(1), 1\u201333 (2008)","journal-title":"JAR"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-39611-3_14","volume-title":"Hardware and Software: Verification and Testing","author":"N. Manthey","year":"2013","unstructured":"Manthey, N., Heule, M.J.H., Biere, A.: Automated reencoding of Boolean formulas. In: Biere, A., Nahir, A., Vos, T. (eds.) HVC 2012. LNCS, vol.\u00a07857, pp. 102\u2013117. Springer, Heidelberg (2013)"},{"key":"13_CR18","unstructured":"Manthey, N., Steinke, P.: npSolver \u2013 A SAT based solver for optimization problems. In: POS 2012 (2012)"},{"key":"13_CR19","first-page":"530","volume-title":"DAC 2001","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC 2001, pp. 530\u2013535. ACM, New York (2001)"},{"key":"13_CR20","unstructured":"Nadel, A.: Boosting minimal unsatisfiable core extraction. In: Bloem, R., Sharygina, N. (eds.) FMCAD 2010, pp. 121\u2013128 (2010)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Bailleux, O., Boufkhad, Y., Roussel, O.: New encodings of pseudo-Boolean constraints into CNF. In: Kullmann (ed.) [15], pp. 181\u2013194","DOI":"10.1007\/978-3-642-02777-2_19"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D.A. Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. Journal of Symbolic Computation\u00a02(3), 293\u2013304 (1986)","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR23","volume-title":"Handbook of Constraint Programming","author":"F. Rossi","year":"2006","unstructured":"Rossi, F., Beek, P.v., Walsh, T.: Handbook of Constraint Programming. Elsevier Science Inc., New York (2006)"},{"key":"13_CR24","unstructured":"Roussel, O., Manquinho, V.: Pseudo-Boolean and cardinality constraints. In: Biere, et\u00a0al. (eds.) [5]"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/11527695_22","volume-title":"Theory and Applications of Satisfiability Testing","author":"S. Subbarayan","year":"2005","unstructured":"Subbarayan, S., Pradhan, D.K.: NiVER: Non-increasing variable elimination resolution for preprocessing SAT instances. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 276\u2013291. Springer, Heidelberg (2005)"},{"key":"13_CR26","series-title":"Symbolic Computation","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-81955-1_28","volume-title":"Automation of Reasoning","author":"G.S. Tseitin","year":"1983","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Automation of Reasoning. Symbolic Computation, pp. 466\u2013483. Springer, Heidelberg (1983)"}],"container-title":["Lecture Notes in Computer Science","KI 2014: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11206-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:04:12Z","timestamp":1676891052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11206-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112053","9783319112060"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11206-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}