{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:57:38Z","timestamp":1743047858503,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115573"},{"type":"electronic","value":"9783319115580"}],"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_37","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"529-542","source":"Crossref","is-referenced-by-count":15,"title":["System aspmt2smt: Computing ASPMT Theories by SMT Solvers"],"prefix":"10.1007","author":[{"given":"Michael","family":"Bartholomew","sequence":"first","affiliation":[]},{"given":"Joohyung","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","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.\u00a05649, pp. 235\u2013249. Springer, Heidelberg (2009)"},{"key":"37_CR2","unstructured":"Balduccini, M.: Representing constraint satisfaction problems in answer set programming. In: Working Notes of the Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP (2009)"},{"key":"37_CR3","unstructured":"Janhunen, T., Liu, G., Niemel\u00e4, I.: Tight integration of non-ground answer set programming and satisfiability modulo theories. In: Working notes of the 1st Workshop on Grounding and Transformations for Theories with Variables (2011)"},{"key":"37_CR4","unstructured":"Bartholomew, M., Lee, J.: Functional stable model semantics and answer set programming modulo theories. In: Proceedings of International Joint Conference on Artificial Intelligence, IJCAI (2013)"},{"key":"37_CR5","unstructured":"Bartholomew, M., Lee, J.: Stable models of formulas with intensional functions. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 2\u201312 (2012)"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","volume":"175","author":"P. Ferraris","year":"2011","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artificial Intelligence\u00a0175, 236\u2013263 (2011)","journal-title":"Artificial Intelligence"},{"key":"37_CR7","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp. 825\u2013885. IOS Press (2009)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-40564-8_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. Babb","year":"2013","unstructured":"Babb, J., Lee, J.: Cplus2ASP: Computing action language $\\cal C$+ in answer set programming. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol.\u00a08148, pp. 122\u2013134. Springer, Heidelberg (2013)"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-04238-6_51","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. Lee","year":"2009","unstructured":"Lee, J., Palla, R.: System f2lp \u2013 computing answer sets of first-order formulas. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 515\u2013521. Springer, Heidelberg (2009)"},{"key":"37_CR10","unstructured":"Lee, J., Lifschitz, V.: Describing additive fluents in action language $\\cal C$+. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 1079\u20131084 (2003)"},{"key":"37_CR11","unstructured":"Chintabathina, S.: Towards answer set prolog based architectures for intelligent agents. In: AAAI 2008, pp. 1843\u20131844 (2008)"}],"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_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T10:17:44Z","timestamp":1675246664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}