{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T16:40:02Z","timestamp":1748623202680,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"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_30","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"354-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["ASP Solving for Expanding Universes"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomi","family":"Janhunen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Jost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Kaminski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"30_CR1","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, New York (2003)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7, 201\u2013215 (1960)","journal-title":"J. ACM"},{"key":"30_CR3","unstructured":"Claessen, K., S\u00f6rensson, N.: New techniques that improve MACE-style finite model finding. In: Proceedings of the Workshop on Model Computation (MODEL 2003) (2003)"},{"issue":"4","key":"30_CR4","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S1571-0661(05)82542-3","volume":"89","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electron. Notes Theoret. Comput. Sci. 89(4), 543\u2013560 (2003)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"issue":"12\u201313","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.artint.2006.08.002","volume":"170","author":"J Rintanen","year":"2006","unstructured":"Rintanen, J., Heljanko, K., Niemel\u00e4, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12\u201313), 1031\u20131080 (2006)","journal-title":"Artif. Intell."},{"key":"30_CR6","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report [25]. http:\/\/arxiv.org\/abs\/1405.3694v1"},{"key":"30_CR7","first-page":"89","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K Apt","year":"1987","unstructured":"Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufmann, San Mateo (1987)"},{"key":"30_CR8","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070\u20131080. MIT Press (1988)"},{"key":"30_CR9","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."},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K Clark","year":"1978","unstructured":"Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum, New York (1978)"},{"key":"30_CR11","unstructured":"Lee, J.: A model-theoretic counterpart of loop formulas. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 503\u2013508 (2005)"},{"issue":"1\u20132","key":"30_CR12","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. Artif. Intell. 157(1\u20132), 115\u2013137 (2004)","journal-title":"Artif. Intell."},{"key":"30_CR13","volume-title":"Principles of Database and Knowledge-Base Systems","author":"J Ullman","year":"1988","unstructured":"Ullman, J.: Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville (1988)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, pp. 131\u2013153. IOS (2009)","DOI":"10.3233\/978-1-58603-929-5-131"},{"key":"30_CR15","unstructured":"Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceedings of the European Conference on Artificial Intelligence (ECAI 2006), pp. 412\u2013416. IOS (2006)"},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1613\/jair.2810","volume":"35","author":"T Janhunen","year":"2009","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. 35, 813\u2013857 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"30_CR17","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: The design of the fifth answer set programming competition [25]. http:\/\/arxiv.org\/abs\/1405.3710v4"},{"issue":"1\u20132","key":"30_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."},{"issue":"2","key":"30_CR19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/AIC-2011-0496","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Sabuncu, O., Schaub, T.: An incremental answer set programming based system for finite model computation. AI Commun. 24(2), 195\u2013212 (2011)","journal-title":"AI Commun."},{"key":"30_CR20","unstructured":"Eiter, T., Fink, M., Krennwallner, T., Redl, C.: Grounding HEX-programs with expanding domains. In: Proceedings of GTTV 2013, pp. 3\u201315 (2013)"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-642-04238-6_52","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Lef\u00e8vre","year":"2009","unstructured":"Lef\u00e8vre, C., Nicolas, P.: The first version of a new ASP solver: ASPeRiX. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 522\u2013527. Springer, Heidelberg (2009)"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-02846-5_14","volume-title":"Logic Programming","author":"A Dal Pal\u00f9","year":"2009","unstructured":"Dal Pal\u00f9, A., Dovier, A., Pontelli, E., Rossi, G.: Answer set programming with constraints using lazy grounding. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 115\u2013129. Springer, Heidelberg (2009)"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-33353-8_38","volume-title":"Logics in Artificial Intelligence","author":"M Dao-Tran","year":"2012","unstructured":"Dao-Tran, M., Eiter, T., Fink, M., Weidinger, G., Weinzierl, A.: OMiGA: an open minded grounding on-the-fly answer set solver. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 480\u2013483. Springer, Heidelberg (2012)"},{"key":"30_CR24","unstructured":"De Cat, B., Denecker, M., Stuckey, P.: Lazy model expansion by incremental grounding. In: Technical Communications of ICLP 2012, pp. 201\u2013211. LIPIcs (2012)"},{"key":"30_CR25","unstructured":"Leuschel, M., Schrijvers, T. (eds.): Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP 2014). Theory and Practice of Logic Programming, Online Supplement (2014)"}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T16:22:10Z","timestamp":1748622130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}