{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:52:08Z","timestamp":1743119528233,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319089089"},{"type":"electronic","value":"9783319089096"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08909-6_8","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T06:02:05Z","timestamp":1405058525000},"page":"118-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Introducing Real Variables and Integer Objective Functions to Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Guohua","family":"Liu","sequence":"first","affiliation":[]},{"given":"Tomi","family":"Janhunen","sequence":"additional","affiliation":[]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-20895-9_33","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Balduccini","year":"2011","unstructured":"Balduccini, M.: Industrial-size scheduling with ASP+CP. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 284\u2013296. Springer, Heidelberg (2011)"},{"issue":"12","key":"8_CR2","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Logics and Databases, pp. 293\u2013322 (1978)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczy\u0144ski, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637\u2013654. Springer, Heidelberg (2009)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B Dutertre","year":"2006","unstructured":"Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81\u201394. Springer, Heidelberg (2006)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-20895-9_39","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., K\u00f6nig, A., Schaub, T.: Advances in gringo series 3. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 345\u2013351. Springer, Heidelberg (2011)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-02846-5_22","volume-title":"Logic Programming","author":"M Gebser","year":"2009","unstructured":"Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235\u2013249. Springer, Heidelberg (2009)"},{"key":"8_CR8","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15\u201319, 1988, vol. 2, pp. 1070\u20131080. MIT Press (1988). ISBN: 0-262-61056-6"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D Goldberg","year":"1991","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Comput. Surv. 23(1), 5\u201348 (1991)","journal-title":"ACM Comput. Surv."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-04244-7_33","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"D Grimes","year":"2009","unstructured":"Grimes, D., Hebrard, E., Malapert, A.: Closing the open shop: contradicting conventional wisdom. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 400\u2013408. Springer, Heidelberg (2009)"},{"key":"8_CR11","unstructured":"IBM: CPLEX performance tuning for linear programs. http:\/\/www-01.ibm.com\/support\/docview.wss?uid=swg21400034"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint logic programming: a survey. J. Logic Program. 19\/20, 503\u2013581 (1994)","journal-title":"J. Logic Program."},{"key":"8_CR13","unstructured":"Liu, G., Janhunen, T., Niemel\u00e4, I.: Answer set programming via mixed integer programming. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10\u201314, 2012, pp. 32\u201342. AAAI Press (2012). ISBN: 978-1-57735-560-1"},{"issue":"1\u20134","key":"8_CR14","first-page":"251","volume":"53","author":"VS Mellarkod","year":"2008","unstructured":"Mellarkod, V.S., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. AMAI 53(1\u20134), 251\u2013287 (2008)","journal-title":"AMAI"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","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, vol. 7773, pp. 91\u2013109. Springer, Heidelberg (2013)"},{"issue":"3\u20134","key":"8_CR16","first-page":"241","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. AMAI 25(3\u20134), 241\u2013273 (1999)","journal-title":"AMAI"},{"key":"8_CR17","unstructured":"Niemel\u00e4, I.: Linear and integer programming modelling and tools. Lecture Notes for the course on Search Problems and Algorithms, Helsinki University of Technology (2008)"},{"issue":"1\u20132","key":"8_CR18","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. Artif. Intell. 138(1\u20132), 181\u2013234 (2002)","journal-title":"Artif. Intell."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-540-27775-0_22","volume-title":"Logic Programming","author":"J-H You","year":"2004","unstructured":"You, J.-H., Hou, G.: Arc-consistency + unit propagation = lookahead. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 314\u2013328. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Declarative Programming and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08909-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T19:41:29Z","timestamp":1674157289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08909-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089089","9783319089096"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08909-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}