{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T18:13:16Z","timestamp":1778523196249,"version":"3.51.4"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319115573","type":"print"},{"value":"9783319115580","type":"electronic"}],"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-11558-0_12","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"166-180","source":"Crossref","is-referenced-by-count":17,"title":["Improving the Normalization of Weight Rules in Answer Set Programs"],"prefix":"10.1007","author":[{"given":"Jori","family":"Bomanson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomi","family":"Janhunen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-40627-0_9","volume-title":"Principles and Practice of Constraint Programming","author":"I. Ab\u00edo","year":"2013","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: A parametric approach for smaller and better encodings of cardinality constraints. In: Schulte, C. (ed.) CP 2013. LNCS, vol.\u00a08124, pp. 80\u201396. Springer, Heidelberg (2013)"},{"key":"12_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. Journal of Artificial Intelligence Research\u00a045, 443\u2013480 (2012)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"12_CR3","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: Preliminary report on WASP 2.0. In: NMR 2014 (2014)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-40564-8_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Alviano","year":"2013","unstructured":"Alviano, M., et al.: The fourth answer set programming competition: Preliminary report. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol.\u00a08148, pp. 42\u201353. Springer, Heidelberg (2013)"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10601-010-9105-0","volume":"16","author":"R. As\u00edn","year":"2011","unstructured":"As\u00edn, R., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: Cardinality networks: A theoretical and empirical study. Constraints\u00a016(2), 195\u2013221 (2011)","journal-title":"Constraints"},{"issue":"1-4","key":"12_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/SAT190021","volume":"2","author":"O. Bailleux","year":"2006","unstructured":"Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo Boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02(1-4), 191\u2013200 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02777-2_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"O. Bailleux","year":"2009","unstructured":"Bailleux, O., Boufkhad, Y., Roussel, O.: New encodings of pseudo-Boolean constraints into CNF. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 181\u2013194. Springer, Heidelberg (2009)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Batcher, K.: Sorting networks and their applications. In: AFIPS 1968, pp. 307\u2013314. ACM (1968)","DOI":"10.1145\/1468075.1468121"},{"key":"12_CR9","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS (2009)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-40564-8_19","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. Bomanson","year":"2013","unstructured":"Bomanson, J., Janhunen, T.: Normalizing cardinality rules using merging and sorting constructions. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol.\u00a08148, pp. 187\u2013199. Springer, Heidelberg (2013)"},{"issue":"12","key":"12_CR11","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. Communications of the ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Communications of the ACM"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-19835-9_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Codish","year":"2011","unstructured":"Codish, M., Fekete, Y., Fuhs, C., Schneider-Kamp, P.: Optimal base encodings for pseudo-Boolean constraints. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 189\u2013204. Springer, Heidelberg (2011)"},{"key":"12_CR13","unstructured":"Corander, J., Janhunen, T., Rintanen, J., Nyman, H., Pensar, J.: Learning chordal Markov networks by constraint satisfaction. In: Advances in Neural Information Processing Systems 26, NIPS 2013, pp. 1349\u20131357 (2013)"},{"key":"12_CR14","unstructured":"Cussens, J.: Bayesian network learning with cutting planes. In: UAI 2011, pp. 153\u2013160. AUAI (2011)"},{"key":"12_CR15","unstructured":"De Cat, B., Bogaerts, B., Bruynooghe, M., Denecker, M.: Predicate logic as a modelling language: The IDP system. CoRR abs\/1401.6312 (2014)"},{"issue":"1-4","key":"12_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02(1-4), 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"5-6","key":"12_CR17","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1017\/S1471068408003323","volume":"8","author":"W. Faber","year":"2008","unstructured":"Faber, W., Pfeifer, G., Leone, N., Dell\u2019Armi, T., Ielpa, G.: Design and implementation of aggregate functions in the DLV system. Theory and Practice of Logic Programming\u00a08(5-6), 545\u2013580 (2008)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1-2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S1471068403001923","volume":"5","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming\u00a05(1-2), 45\u201374 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2","key":"12_CR19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: The Potsdam answer set solving collection. AI Communications\u00a024(2), 107\u2013124 (2011)","journal-title":"AI Communications"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-02846-5_23","volume-title":"Logic Programming","author":"M. Gebser","year":"2009","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: On the implementation of weight constraint rules in conflict-driven ASP solvers. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 250\u2013264. Springer, Heidelberg (2009)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"M. Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: From theory to practice. Artificial Intelligence\u00a0187, 52\u201389 (2012)","journal-title":"Artificial Intelligence"},{"key":"12_CR22","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP 1988, pp. 1070\u20131080. MIT (1988)"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","volume":"36","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning\u00a036(4), 345\u2013377 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"12_CR24","series-title":"LNCS","first-page":"107","volume-title":"KI 2012: Advances in Artificial Intelligence","author":"S. H\u00f6lldobler","year":"2012","unstructured":"H\u00f6lldobler, S., Manthey, N., Steinke, P.: A compact encoding of pseudo-Boolean constraints into SAT. In: Glimm, B., Kr\u00fcger, A. (eds.) KI 2012. LNCS, vol.\u00a07526, pp. 107\u2013118. Springer, Heidelberg (2012)"},{"key":"12_CR25","unstructured":"Jaakkola, T., Sontag, D., Globerson, A., Meila, M.: Learning Bayesian network structure using LP relaxations. In: AISTATS 2010, pp. 358\u2013365. JMLR (2010)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Janhunen, T., Niemel\u00e4, I.: Compact translations of non-disjunctive answer set programs to propositional clauses. In: Balduccini, M., Son, T.C. (eds.) Gelfond Festschrift. LNCS (LNAI), vol.\u00a06565, pp. 111\u2013130. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20832-4_8"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Janhunen, T., Niemel\u00e4, I.: Applying visible strong equivalence in answer-set program transformations. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Lifschitz Festschrift. LNCS, vol.\u00a07265, pp. 363\u2013379. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-30743-0_24"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04238-6_14","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2009","unstructured":"Janhunen, T., Niemel\u00e4, I., Sevalnev, M.: Computing stable models via reductions to difference logic. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 142\u2013154. Springer, Heidelberg (2009)"},{"issue":"3","key":"12_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Answer set planning. In: ICLP 1999, pp. 23\u201337. MIT (1999)","DOI":"10.1007\/3-540-46767-X_28"},{"issue":"3-4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1-2","key":"12_CR32","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective, pp. 375\u2013398. Springer (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"12_CR34","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-41524-1_6","volume-title":"Applications of Declarative Programming and Knowledge Management","author":"M. Nguyen","year":"2013","unstructured":"Nguyen, M., Janhunen, T., Niemel\u00e4, I.: Translating answer-set programs into bit-vector logic. In: Tompits, H., Abreu, S., Oetsch, J., P\u00fchrer, J., Seipel, D., Umeda, M., Wolf, A. (eds.) INAP\/WLP 2011. LNCS (LNAI), vol.\u00a07773, pp. 95\u2013113. Springer, Heidelberg (2013)"},{"issue":"3-4","key":"12_CR35","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"12_CR36","unstructured":"Roussel, O., Manquinho, V.: Pseudo-Boolean and cardinality constraints. In: Handbook of Satisfiability, pp. 695\u2013733. IOS (2009)"},{"key":"12_CR37","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/3-540-46767-X_22","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Simons","year":"1999","unstructured":"Simons, P.: Extending the stable model semantics with more expressive rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol.\u00a01730, pp. 305\u2013316. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"12_CR38","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Tamura, N., Banbara, M., Soh, T.: PBSugar: Compiling pseudo-Boolean constraints to SAT with order encoding. In: PoS 2013 (2013)","DOI":"10.1109\/ICTAI.2013.153"},{"issue":"2","key":"12_CR40","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"J. Warners","year":"1998","unstructured":"Warners, J.: A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters\u00a068(2), 63\u201369 (1998)","journal-title":"Information Processing Letters"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Wittocx, J., Denecker, M., Bruynooghe, M.: Constraint propagation for first-order logic and inductive definitions. ACM Transactions on Computational Logic\u00a014(3), 17:1\u201317:45 (2013)","DOI":"10.1145\/2499937.2499938"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11558-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T23:36:58Z","timestamp":1675121818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}