{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:00:54Z","timestamp":1775818854026,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319610320","type":"print"},{"value":"9783319610337","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-61033-7_6","type":"book-chapter","created":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T03:40:08Z","timestamp":1496979608000},"page":"167-203","source":"Crossref","is-referenced-by-count":21,"title":["A Tutorial on Hybrid Answer Set Solving with clingo"],"prefix":"10.1007","author":[{"given":"Roland","family":"Kaminski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Wanko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Balduccini, M., Lierler, Y.: Constraint answer set solver EZCSP and why integration schemas matter. CoRR, abs\/1702.04047 (2017)","DOI":"10.1017\/S1471068417000102"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-23264-5_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Banbara","year":"2015","unstructured":"Banbara, M., Gebser, M., Inoue, K., Ostrowski, M., Peano, A., Schaub, T., Soh, T., Tamura, N., Weise, M.: aspartame: solving constraint satisfaction problems with answer set programming. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 112\u2013126. Springer, Cham (2015). doi: 10.1007\/978-3-319-23264-5_10"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Banbara, M., Kaufmann, B., Ostrowski, M., Schaub, T.: Clingcon: the next generation. Theory and Practice of Logic Programming (2017, To appear)","DOI":"10.1017\/S1471068417000138"},{"key":"6_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, New York (2003)"},{"key":"6_CR5","unstructured":"Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Biere et al. [7], Chap. 26, pp. 825\u2013885"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-11558-0_37","volume-title":"Logics in Artificial Intelligence","author":"M Bartholomew","year":"2014","unstructured":"Bartholomew, M., Lee, J.: System aspmt2smt: computing ASPMT theories by SMT solvers. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 529\u2013542. Springer, Cham (2014). doi: 10.1007\/978-3-319-11558-0_37"},{"key":"6_CR7","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)"},{"key":"6_CR8","unstructured":"Cabalar, P., Kaminski, R., Ostrowski, M., Schaub, T.: An ASP semantics for default reasoning with constraints. In: Kambhampati, R. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 1015\u20131021. IJCAI\/AAAI Press (2016)"},{"key":"6_CR9","unstructured":"Carro, M., King, A. (eds.): Technical Communications of the Thirty-second International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), vol. 52 (2016)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11814948_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"S Cotton","year":"2006","unstructured":"Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 170\u2013183. Springer, Heidelberg (2006). doi: 10.1007\/11814948_19"},{"key":"6_CR11","unstructured":"Crawford, J., Baker, A.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Hayes-Roth, B., Korf, R. (eds.) Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), pp. 1092\u20131097. AAAI Press (1994)"},{"key":"6_CR12","unstructured":"Dodaro, C., Ricca, F., Sch\u00fcler, P.: External propagators in wasp: preliminary report. In: Proceedings of the Twenty-Third International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2016), vol. 1745, pp. 1\u20139. CEUR Workshop Proceedings (2016)"},{"issue":"4\u20136","key":"6_CR13","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1017\/S1471068410000220","volume":"10","author":"C Drescher","year":"2010","unstructured":"Drescher, C., Walsh, T.: A translational approach to constraint answer set solving. Theory Pract. Logic Program. 10(4\u20136), 465\u2013480 (2010)","journal-title":"Theory Pract. Logic Program."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-03754-2_2","volume-title":"Reasoning Web. Semantic Technologies for Information Systems","author":"T Eiter","year":"2009","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web 2009. LNCS, vol. 5689, pp. 40\u2013110. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03754-2_2"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-20895-9_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Grote, T., Kaminski, R., Schaub, T.: Reactive answer set programming. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 54\u201366. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-20895-9_7"},{"key":"6_CR16","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Lindauer, M., Ostrowski, M., Romero, J., Schaub, T., Thiele, S.: Potassco User Guide, 2nd edn. University of Potsdam (2015)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-89982-2_23","volume-title":"Logic Programming","author":"M Gebser","year":"2008","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: Engineering an incremental ASP solver. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 190\u2013205. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-89982-2_23"},{"key":"6_CR18","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Carro and King [9], pp. 2:1\u20132:15"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice, Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers (2012)","DOI":"10.2200\/S00457ED1V01Y201211AIM019"},{"key":"6_CR20","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report. In: Leuschel, M., Schrijvers, T. (eds.) Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP 2014). Theory and Practice of Logic Programming, arXiv:1405.3694v1 , Online Supplement (2014). http:\/\/arxiv.org\/abs\/1405.3694v1"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-14726-0_2","volume-title":"Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Kaminski, R., Obermeier, P., Schaub, T.: Ricochet robots reloaded: a case-study in multi-shot ASP solving. In: Eiter, T., Strass, H., Truszczy\u0144ski, M., Woltran, S. (eds.) Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. LNCS (LNAI), vol. 9060, pp. 17\u201332. Springer, Cham (2015). doi: 10.1007\/978-3-319-14726-0_2"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187\u2013188","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187\u2013188, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781139342124"},{"key":"6_CR24","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP 1988), pp. 1070\u20131080. MIT Press (1988)"},{"key":"6_CR25","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Janhunen, T., Kaminski, R., Ostrowski, M., Schaub, T., Schellhorn, S., Wanko, P.: Clingo goes linear constraints over reals and integers: A preliminary study (2017, In preparation)","DOI":"10.1017\/S1471068417000242"},{"key":"6_CR27","unstructured":"Janhunen, T., Liu, G., Niemel\u00e4, I.: Tight integration of non-ground answer set programming and satisfiability modulo theories. In: Cabalar, P., Mitchell, D., Pearce, D., Ternovska, E. (eds.) Proceedings of the First Workshop on Grounding and Transformation for Theories with Variables (GTTV 2011), pp. 1\u201313 (2011)"},{"key":"6_CR28","unstructured":"Li, C., Many\u00e0, F.: MaxSAT. In: Biere et al. [7], Chap. 19, pp. 613\u2013631"},{"key":"6_CR29","unstructured":"Lierler, Y., Susman, B.: SMT-based constraint answer set solver EZSMT (system description). In: Carro and King [9], pp. 1:1\u20131:15"},{"key":"6_CR30","unstructured":"Lifschitz, V.: Introduction to answer set programming. Unpublished draft (2004)"},{"key":"6_CR31","unstructured":"Liu, G., Janhunen, T., Niemel\u00e4, I.: Answer set programming via mixed integer programming. In: Brewka, G., Eiter, T., McIlraith, S. (eds.) Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), pp. 32\u201342. AAAI Press (2012)"},{"key":"6_CR32","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere et al. [7], Chap. 4, pp. 131\u2013153"},{"issue":"1\u20134","key":"6_CR33","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10472-009-9116-y","volume":"53","author":"V Mellarkod","year":"2008","unstructured":"Mellarkod, V., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Ann. Math. Artif. Intell. 53(1\u20134), 251\u2013287 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"6","key":"6_CR34","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"key":"6_CR35","unstructured":"Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI 2006), pp. 412\u2013416. IOS Press (2006)"},{"issue":"5\u20136","key":"6_CR36","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1017\/S1471068416000211","volume":"16","author":"C Redl","year":"2016","unstructured":"Redl, C.: The dlvhex system for knowledge representation: recent advances (system description). Theory Pract. Logic Program. 16(5\u20136), 866\u2013883 (2016)","journal-title":"Theory Pract. Logic Program."},{"key":"6_CR37","unstructured":"Roussel, O., Manquinho, V.: Pseudo-Boolean and cardinality constraints. In: Biere et al. [7], Chap. 22, pp. 695\u2013733"},{"issue":"1\u20132","key":"6_CR38","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P Simons","year":"2002","unstructured":"Simons, P., Niemel, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1\u20132), 181\u2013234 (2002)","journal-title":"Artif. Intell."},{"key":"6_CR39","unstructured":"Syrj\u00e4nen, T.: Lparse 1.0 user\u2019s manual (2001)"},{"issue":"2","key":"6_CR40","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N Tamura","year":"2009","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254\u2013272 (2009)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Reasoning Web. Semantic Interoperability on the Web"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61033-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T16:43:08Z","timestamp":1569429788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61033-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319610320","9783319610337"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61033-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}