{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T00:26:13Z","timestamp":1787531173933,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319232638","type":"print"},{"value":"9783319232645","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_13","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"143-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Answer Set Programming Modulo Acyclicity"],"prefix":"10.1007","author":[{"given":"Jori","family":"Bomanson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomi","family":"Janhunen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"13_CR1","unstructured":"Cussens, J.: Bayesian network learning with cutting planes. In: Proceeding UAI 2011, pp. 153\u2013160. AUAI Press (2011)"},{"key":"13_CR2","unstructured":"Corander, J., Janhunen, T., Rintanen, J., Nyman, H., Pensar, J.: Learning chordal Markov networks by constraint satisfaction. In: Proceeding NIPS 2013, NIPS Foundation, pp. 1349\u20131357 (2013)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/3-540-44957-4_55","volume-title":"Computational Logic - CL 2000","author":"E Erdem","year":"2000","unstructured":"Erdem, E., Lifschitz, V., Wong, M.D.F.: Wire routing and satisfiability planning. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 822\u2013836. Springer, Heidelberg (2000)"},{"key":"13_CR4","unstructured":"Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, pp. 825\u2013885. IOS Press (2009)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-319-11558-0_10","volume-title":"Logics in Artificial Intelligence","author":"M Gebser","year":"2014","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: SAT modulo graphs: Acyclicity. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 137\u2013151. Springer, Heidelberg (2014)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bayless, S., Bayless, N., Hoos, H., Hu, A.: SAT modulo monotonic theories. In: Proceeding AAAI 2015, pp. 3702\u20133709. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9755"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as SAT modulo Acyclicity. In: Proceeding ECAI 2014, pp. 351\u2013356. IOS Press (2014)","DOI":"10.1007\/978-3-319-11558-0_10"},{"key":"13_CR8","doi-asserted-by":"publisher","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, Cambridge (2003)"},{"key":"13_CR9","doi-asserted-by":"publisher","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."},{"issue":"3","key":"13_CR10","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"13_CR11","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: ASP encodings of Acyclicity properties. In: Proceeding KR 2014. AAAI Press (2014)"},{"key":"13_CR12","first-page":"51","volume":"1","author":"F Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and the existence of stable models. J. Methods Logic Comput. Sci. 1, 51\u201360 (1994)","journal-title":"J. Methods Logic Comput. Sci."},{"issue":"4\u20135","key":"13_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theor. Pract. Logic Program. 3(4\u20135), 499\u2013518 (2003)","journal-title":"Theor. Pract. Logic Program."},{"key":"13_CR14","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":"13_CR15","unstructured":"Liu, G., Janhunen, T., Niemel\u00e4, I.: Answer set programming via mixed integer programming. In: Proceeding KR 2012, pp. 32\u201342. AAAI Press (2012)"},{"key":"13_CR16","unstructured":"Lee, J., Meng, Y.: Answer set programming modulo theories and reasoning about continuous changes. In: Proceeding IJCAI 2013, pp. 990\u2013996. IJCAI\/AAAI Press (2013)"},{"issue":"1\u20132","key":"13_CR17","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":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-01929-6_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected Boolean search problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 71\u201386. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T23:59:40Z","timestamp":1674259180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}