{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:53Z","timestamp":1725565433853},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156748"},{"type":"electronic","value":"9783642156755"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15675-5_16","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T04:07:17Z","timestamp":1284350837000},"page":"169-181","source":"Crossref","is-referenced-by-count":1,"title":["An Incremental Answer Set Programming Based System for Finite ModelComputation"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[]},{"given":"Orkunt","family":"Sabuncu","sequence":"additional","affiliation":[]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-2653-9","volume-title":"Automated Model Building","author":"R. Caferra","year":"2004","unstructured":"Caferra, R., Leitsch, A., Peltier, N.: Automated Model Building. Kluwer Academic, Dordrecht (2004)"},{"doi-asserted-by":"crossref","unstructured":"Bibel, W.: Automated Theorem Proving. Vieweg (1987)","key":"16_CR2","DOI":"10.1007\/978-3-322-90102-6"},{"key":"16_CR3","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, Cambridge (2003)"},{"key":"16_CR4","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.\u00a05366, pp. 190\u2013205. Springer, Heidelberg (2008)"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.entcs.2004.07.023","volume":"125","author":"J. Zhang","year":"2005","unstructured":"Zhang, J., Huang, Z.: Reducing symmetries to generate easier SAT instances. Electronic Notes in Theoretical Computer Science\u00a0125(3), 149\u2013164 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"unstructured":"Tammet, T.: Finite model building: Improvements and comparisons. In: Baumgartner, P., Ferm\u00fcller, C. (eds.) Proceedings of the Workshop on Model Computation \u2014 Principles, Algorithms, Applications, MODEL 2003 (2003)","key":"16_CR6"},{"unstructured":"McCune, W.: A Davis-Putnam program and its application to finite first-order model search: Quasigroup existence problems. Technical Report ANL\/MCS-TM-194, Argonne National Laboratory (1994)","key":"16_CR7"},{"unstructured":"Claessen, K., S\u00f6rensson, N.: New techniques that improve MACE-style finite model finding. In: Baumgartner, P., Ferm\u00fcller, C. (eds.) Proceedings of the Workshop on Model Computation \u2014 Principles, Algorithms, Applications, MODEL 2003 (2003)","key":"16_CR8"},{"unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. IOS (2009)","key":"16_CR9"},{"key":"16_CR10","first-page":"298","volume-title":"Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995)","author":"J. Zhang","year":"1995","unstructured":"Zhang, J., Zhang, H.: SEM: A system for enumerating models. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 298\u2013303. Morgan Kaufmann, San Francisco (1995)"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00244457","volume":"17","author":"J. Zhang","year":"1996","unstructured":"Zhang, J.: Constructing finite algebras with FALCON. Journal of Automated Reasoning\u00a017(1), 1\u201322 (1996)","journal-title":"Journal of Automated Reasoning"},{"unstructured":"Syrj\u00e4nen, T.: Lparse 1.0 user\u2019s manual, \n                    \n                      http:\/\/www.tcs.hut.fi\/Software\/smodels\/lparse.ps.gz","key":"16_CR12"},{"unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user\u2019s guide to gringo, clasp, clingo, and iclingo, \n                    \n                      http:\/\/potassco.sourceforge.net","key":"16_CR13"},{"issue":"1-2","key":"16_CR14","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. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jal.2007.07.005","volume":"7","author":"P. Baumgartner","year":"2009","unstructured":"Baumgartner, P., Fuchs, A., de Nivelle, H., Tinelli, C.: Computing finite models by reduction to function-free clause logic. Journal of Applied Logic\u00a07(1), 58\u201374 (2009)","journal-title":"Journal of Applied Logic"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"unstructured":"Sabuncu, O., Alpaslan, F.: Computing answer sets using model generation theorem provers. In: Costantini, S., Watson, R. (eds.) Proceedings of the 4th International Workshop on Answer Set Programming (ASP 2007), pp. 225\u2013240 (2007)","key":"16_CR17"},{"unstructured":"Lierler, Y., Lifschitz, V.: Logic programs vs. first-order formulas in textual inference, \n                    \n                      http:\/\/z.cs.utexas.edu\/users\/ai-lab\/publications_recent.php","key":"16_CR18"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15675-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:47:32Z","timestamp":1553075252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15675-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156748","9783642156755"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15675-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}