{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:03:20Z","timestamp":1766311400155},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207214"},{"type":"electronic","value":"9783540246091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24609-1_32","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T03:31:31Z","timestamp":1294975891000},"page":"346-350","source":"Crossref","is-referenced-by-count":51,"title":["Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs"],"prefix":"10.1007","author":[{"given":"Yuliya","family":"Lierler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","volume-title":"The Logic Programming Paradigm: a 25-Year Perspective","author":"V. Marek","year":"1999","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective. Springer, Heidelberg (1999)"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025, 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"32_CR3","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proc. Fifth Int\u2019l Conf. and Symp., pp. 1070\u20131080 (1988)"},{"key":"32_CR4","doi-asserted-by":"crossref","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 Press, NewYork (1978)"},{"key":"32_CR5","unstructured":"Babovich,Y., Erdem, E., Lifschitz, V.: Fages\u2019 theorem and answer set programming. In: Proc. Eighth Int\u2019l Workshop on Non-Monotonic Reasoning (2000), \n                    \n                      http:\/\/arxiv.org\/abs\/cs.ai\/0003042"},{"key":"32_CR6","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"32_CR7","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proc. AAAI 2002 (2002)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-24599-5_31","volume-title":"Logic Programming","author":"J. Lee","year":"2003","unstructured":"Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 451\u2013465. Springer, Heidelberg (2003) (to appear)"},{"key":"32_CR9","unstructured":"Syrjanen, T.: Lparse manual (2003), \n                    \n                      http:\/\/www.tcs.hut.fi\/software\/smodels\/lparse.ps.gz"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025, 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming (to appear)","DOI":"10.1017\/S1471068403001923"},{"key":"32_CR12","unstructured":"Lierler, Y., Lifschitz, V.: Computing answer sets using program completion (unpublished draft), \n                    \n                      http:\/\/www.cs.utexas.edu\/users\/yuliya\/cmodels.ps"},{"key":"32_CR13","unstructured":"Armando, A., Castellini, C., Giunchiglia, E., Giunchiglia, F., Tacchella, A.: SAT-Based Decision Procedures for Automated Reasoning: a Unifying Perspective. In: Festschrift in Honor of J\u00f6rg H. Siekmann, to appear in LNAI, Springer-Verlag (2002)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24609-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T18:55:50Z","timestamp":1553367350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}