{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T05:07:22Z","timestamp":1738991242687,"version":"3.37.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10472-009-9113-1","type":"journal-article","created":{"date-parts":[[2009,1,23]],"date-time":"2009-01-23T12:48:04Z","timestamp":1232714884000},"page":"169-204","source":"Crossref","is-referenced-by-count":16,"title":["On the relation among answer set solvers"],"prefix":"10.1007","volume":"53","author":[{"given":"Enrico","family":"Giunchiglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,24]]},"reference":[{"key":"9113_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/380752.380820","volume-title":"Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC)","author":"D. Achlioptas","year":"2001","unstructured":"Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 337\u2013346. ACM, New York (2001)"},{"key":"9113_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/11591191_8","volume-title":"Proc. of the 12th International Conference on Logic Programming, Artificial Intelligence, and Reasoning (LPAR)","author":"C. Anger","year":"2005","unstructured":"Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving. In: Sutcliffe, G., Voronkov, A. (eds.) Proc. of the 12th International Conference on Logic Programming, Artificial Intelligence, and Reasoning (LPAR), Lecture Notes in Computer Science, vol. 3835, pp. 95\u2013109. Springer, New York (2005)"},{"key":"9113_CR3","first-page":"769","volume-title":"Proc. of the 17th European Conference on Artificial Intelligence (ECAI)","author":"C. Anger","year":"2006","unstructured":"Anger, C., Gebser, M., Janhunen, T., Schaub, T.: What\u2019s a head without a body? In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proc. of the 17th European Conference on Artificial Intelligence (ECAI), pp. 769\u2013770. IOS, Amsterdam (2006)"},{"key":"9113_CR4","unstructured":"Babovich, Y., Lifschitz, V.: Computing answer sets using program completion. Available at http:\/\/www.cs.utexas.edu\/users\/tag\/cmodels\/cmodels-1.ps (2003)"},{"issue":"2-3","key":"9113_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3233\/FUN-2006-712-303","volume":"71","author":"F. Calimeri","year":"2006","unstructured":"Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning operators for disjunctive logic programming systems. Fundam. Inform. 71(2-3), 183\u2013214 (2006)","journal-title":"Fundam. Inform."},{"issue":"4","key":"9113_CR6","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","volume":"35","author":"V. Chv\u00e1tal","year":"1988","unstructured":"Chv\u00e1tal, V., Szemer\u00e9di, E.: Many hard examples for resolution. J. ACM 35(4), 759\u2013768 (1988)","journal-title":"J. ACM"},{"key":"9113_CR7","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, New York (1978)"},{"key":"9113_CR8","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT, Cambridge (2001)"},{"key":"9113_CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1613\/jair.1656","volume":"23","author":"H.E. Dixon","year":"2005","unstructured":"Dixon, H.E., Ginsberg, M.L., Hofer, D.K., Luks, E.M., Parkes, A.J.: Generalizing Boolean satisfiability III: implementation. J. Artif. Intell. Res. (JAIR) 23, 441\u2013531 (2005)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"3","key":"9113_CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program. 1(3), 267\u2013284 (1984)","journal-title":"J. Log. Program."},{"key":"9113_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/3-540-45757-7_49","volume-title":"Proc. of 8th European Conference on Logics in Artificial Intelligence (JELIA)","author":"D. East","year":"2002","unstructured":"East, D., Truszczynski, M.: The aspps system. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) Proc. of 8th European Conference on Logics in Artificial Intelligence (JELIA), Lecture Notes in Computer Science, vol. 2424, pp. 533\u2013536. Springer, New York (2002)"},{"issue":"4-5","key":"9113_CR12","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory Pract. Log. Program. 3(4-5), 499\u2013518 (2003)","journal-title":"Theory Pract. Log. Program."},{"key":"9113_CR13","unstructured":"Faber, W.: Enhancing efficiency and expressiveness in ASP systems. Ph.D. thesis, University of Wien (2002)"},{"key":"9113_CR14","series-title":"Lecture Notes in Computer Science","first-page":"107","volume-title":"Proc. of the 5th International Conference on Logic Programming and Nonmonostonic Reasoning (LPNMR)","author":"W. Faber","year":"1999","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Pushing goal derivation in DLP computation. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) Proc. of the 5th International Conference on Logic Programming and Nonmonostonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 1730, pp. 107\u2013116. Springer, New York (1999)"},{"key":"9113_CR15","first-page":"635","volume-title":"Proc. of the 17th International Joint Conference on Artificial Intelligence (IJCAI)","author":"W. Faber","year":"2001","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Experimenting with heuristics for ASP. In: Nebel, B. (ed.) Proc. of the 17th International Joint Conference on Artificial Intelligence (IJCAI), pp. 635\u2013640. Morgan Kaufmann, San Francisco (2001)"},{"key":"9113_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Proc. of the 9th European Conference on Logics in Artificial Intelligence (JELIA)","author":"W. Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) Proc. of the 9th European Conference on Logics in Artificial Intelligence (JELIA), Lecture Notes in Computer Science, vol. 3229, pp. 200\u2013212. Springer, New York (2004)"},{"key":"9113_CR17","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Methods Logic Comput. Sci. 1, 51\u201360 (1994)","journal-title":"Methods Logic Comput. Sci."},{"key":"9113_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/11799573_4","volume-title":"Proc. of the 22nd International Conference on Logic Programming (ICLP)","author":"M. Gebser","year":"2006","unstructured":"Gebser, M., Schaub, T.: Tableaux calculi for answer set programming. In: Etalle, S., Truszczynski, M. (eds.) Proc. of the 22nd International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, vol. 4079, pp. 11\u201325. Springer, New York (2006)"},{"key":"9113_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-540-74610-2_9","volume-title":"Proc. of the 23rd International Conference on Logic Programming (ICLP)","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Schaub, T.: Generic tableaux for answer set programming. In: Dahl V, Niemel\u00e4 I (eds) Proc. of the 23rd International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, vol. 4670, pp. 119\u2013133. Springer, New York (2007)"},{"key":"9113_CR20","unstructured":"Gebser, M., Kaufmann, B., Neumann, B., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M.M. (ed.) Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 386\u2013392 (2007a)"},{"key":"9113_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-72200-7_3","volume-title":"Proc. of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczynski, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J.S. (eds.) Proc. of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 4483, pp. 3\u201317. Springer, New York (2007b)"},{"key":"9113_CR22","first-page":"1070","volume-title":"Proc. of 5th International Conference and Symposium on Logic Programming (ICLP\/SLP)","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski R, Bowen K (eds.) Proc. of 5th International Conference and Symposium on Logic Programming (ICLP\/SLP), pp. 1070\u20131080. MIT, Cambridge (1988)"},{"issue":"3\/4","key":"9113_CR23","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3\/4), 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"key":"9113_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/11558590_13","volume-title":"Advanced in Artificial Intelligence: 9th Congress of the Italian Association for Artificial Intelligence (AI*IA)","author":"E. Giunchiglia","year":"2005","unstructured":"Giunchiglia, E., Maratea, M.: Evaluating search strategies and heuristics for efficient answer set programming. In: Bandini, S., Manzoni, S. (eds.) Advanced in Artificial Intelligence: 9th Congress of the Italian Association for Artificial Intelligence (AI*IA), Lecture Notes in Computer Science, vol. 4733, pp. 122\u2013134. Springer, New York (2005a)"},{"key":"9113_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/11562931_6","volume-title":"Proc. of the 21st International Conference on Logic Programming (ICLP)","author":"E. Giunchiglia","year":"2005","unstructured":"Giunchiglia, E., Maratea, M.: On the relation between ASP and SAT procedures (or, between smodels and cmodels). In: Gabbrielli, M., Gupta, G. (eds.) Proc. of the 21st International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, vol. 3668, pp. 37\u201351. Springer, New York (2005b)"},{"key":"9113_CR26","series-title":"Lecture Notes in Computer Science","first-page":"84","volume-title":"Advances in Artificial Intelligence: 6th Congress of the Italian Association for Artificial Intelligence (AI*IA)","author":"E. Giunchiglia","year":"1999","unstructured":"Giunchiglia, E., Sebastiani, R.: Applying the Davis-Putnam procedure to non-clausal formulas. In: Lamma, E., Mello, P. (eds.) Advances in Artificial Intelligence: 6th Congress of the Italian Association for Artificial Intelligence (AI*IA), Lecture Notes in Computer Science, vol. 1792, pp. 84\u201394. Springer, New York (1999)"},{"issue":"4","key":"9113_CR27","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","volume":"36","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. J. Autom. Reason. 36(4), 345\u2013377 (2006)","journal-title":"J. Autom. Reason."},{"key":"9113_CR28","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theor. Comp. Sci. 39, 297\u2013308 (1985)","journal-title":"Theor. Comp. Sci."},{"key":"9113_CR29","first-page":"358","volume-title":"Proc. of the 16th Eureopean Conference on Artificial Intelligenc (ECAI)","author":"T. Janhunen","year":"2004","unstructured":"Janhunen, T.: Representing normal programs with clauses. In: de\u00a0M\u00e1ntaras, R.L., Saitta, L. (eds.) Proc. of the 16th Eureopean Conference on Artificial Intelligenc (ECAI), pp. 358\u2013362. IOS, Amsterdam (2004)"},{"issue":"1-2","key":"9113_CR30","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3166\/jancl.16.35-86","volume":"16","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. J. Appl. Non-Class. Log. 16(1-2), 35\u201386 (2006)","journal-title":"J. Appl. Non-Class. Log."},{"key":"9113_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-540-74610-2_10","volume-title":"Proc. of the 23rd International Conference on Logic Programming (ICLP)","author":"M. J\u00e4rvisalo","year":"2007","unstructured":"J\u00e4rvisalo, M., Oikarinen, E.: Extended ASP tableaux and rule redundancy in normal logic programs. In: Dahl, V., Niemel\u00e4, I. (eds.) Proc. of the 23rd International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, vol. 4670, pp. 134\u2013148. Springer, New York (2007)"},{"issue":"2","key":"9113_CR32","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/inco.1997.2630","volume":"135","author":"N. Leone","year":"1997","unstructured":"Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: unfounded sets, fixpoint semantics and computation. Inf. Comput. 135(2), 69\u2013112 (1997)","journal-title":"Inf. Comput."},{"issue":"3","key":"9113_CR33","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. (TOCL) 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"issue":"1\u20132","key":"9113_CR34","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0004-3702(99)00097-1","volume":"116","author":"P. Liberatore","year":"2000","unstructured":"Liberatore, P.: On the complexity of choosing the branching literal in DPLL. Artif. Intell. 116(1\u20132), 315\u2013326 (2000)","journal-title":"Artif. Intell."},{"key":"9113_CR35","doi-asserted-by":"crossref","unstructured":"Lierler, Y.: Abstract answer set solver. Accepted at the 24th International Conference on Logic Programming (ICLP). Available at http:\/\/www.cs.utexas.edu\/users\/yuliya\/papers\/aasp.pdf (2008)","DOI":"10.1007\/978-3-540-89982-2_35"},{"key":"9113_CR36","first-page":"23","volume-title":"Proc. of the 16th International Conference on Logic Programming (ICLP)","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V.: Answer set planning. In: Schreye, D.D. (ed.) Proc. of the 16th International Conference on Logic Programming (ICLP), pp. 23\u201337. MIT, Cambridge (1999)"},{"issue":"2","key":"9113_CR37","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/1131313.1131316","volume":"7","author":"V. Lifschitz","year":"2006","unstructured":"Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Trans. Comput. Log. 7(2), 183\u2013214 (2006)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1\u20132","key":"9113_CR38","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"147","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artif. Intell. 147((1\u20132)), 115\u2013137 (2004)","journal-title":"Artif. Intell."},{"key":"9113_CR39","series-title":"Lecture Notes in Computer Science","first-page":"410","volume-title":"Proc. of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)","author":"L. Liu","year":"2005","unstructured":"Liu, L., Truszczynski, M.: Pbmodels - software to compute stable models by pseudoboolean solvers. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) Proc. of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 3662, pp. 410\u2013415. Springer, New York (2005)"},{"issue":"1-3","key":"9113_CR40","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.jalgor.2008.02.006","volume":"63","author":"M. Maratea","year":"2008","unstructured":"Maratea, M., Ricca, F., Faber, W., Leone, N.: Look-back techniques and heuristics in DLV: Implementation, evaluation and comparison to QBF solvers. J. Algorithms 63(1-3), 70\u201389 (2008)","journal-title":"J. Algorithms"},{"key":"9113_CR41","series-title":"Lecture Notes in Computer Science","volume-title":"The Logic Programming Paradigm: a 25.Years perspective","author":"V. Marek","year":"1999","unstructured":"Marek, V., Truszczynski, M.: Stable models as an alternative programming paradigm. In: The Logic Programming Paradigm: a 25.Years perspective, Lecture Notes in Computer Science, Springer, New York (1999)"},{"key":"9113_CR42","volume-title":"Nonmonotonic Logics\u2014Context-Dependent Reasoning","author":"V.W. Marek","year":"1993","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Nonmonotonic Logics\u2014Context-Dependent Reasoning. Springer, New York (1993)"},{"key":"9113_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/978-3-540-45193-8_38","volume-title":"Proc. of the 9th International Conference on Principles and Practice of Constraint Programming (CP)","author":"D.G. Mitchell","year":"2003","unstructured":"Mitchell, D.G.: Resolution and constraint satisfaction. In: Rossi, F. (ed.) Proc. of the 9th International Conference on Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, vol. 2833, pp. 555\u2013569. Springer, New York (2003)"},{"key":"9113_CR44","series-title":"Lecture Notes in Physics","volume-title":"On the analysis of backtrack procedures for the coloring of random graphs, Chap Complex Networks","author":"R. Monasson","year":"2004","unstructured":"Monasson, R.: On the analysis of backtrack procedures for the coloring of random graphs, Chap Complex Networks. Lecture Notes in Physics. Springer, New York (2004)"},{"key":"9113_CR45","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proc. of the 38th Design Automation Conference (DAC\u201901), pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"issue":"3-4","key":"9113_CR46","doi-asserted-by":"crossref","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. Ann. Math. Artif. Intell. 25(3-4), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"6","key":"9113_CR47","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract Davis\u2013Putnam\u2013Logemann\u2013Loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"issue":"2","key":"9113_CR48","first-page":"155","volume":"19","author":"F. Ricca","year":"2006","unstructured":"Ricca, F., Faber, W., Leone, N.: A backjumping technique for disjunctive logic programming. AI Commun. 19(2), 155\u2013172 (2006)","journal-title":"AI Commun."},{"key":"9113_CR49","unstructured":"Simons, P.: Extending and implementing the stable model semantics. Ph.D. thesis, Helsinky University (2000)"},{"issue":"1-2","key":"9113_CR50","doi-asserted-by":"crossref","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-2), 181\u2013234 (2002)","journal-title":"Artif. Intell."},{"key":"9113_CR51","unstructured":"Syrjanen, T.: Lparse manual. http:\/\/www.tcs.hut.fi\/software\/smodels\/lparse.ps.gz (2003)"},{"key":"9113_CR52","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: On the complexity of proofs in propositional logics. Semin. Math. 8 (1970)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"9113_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Proc. of 6th International Conference on Principles and Practice of Constraint Programming (CP)","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) Proc. of 6th International Conference on Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, vol. 1894, pp. 441\u2013456. Springer, New York (2000)"},{"key":"9113_CR54","series-title":"Lecture Notes in Computer Science","first-page":"302","volume-title":"Proc. of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)","author":"J. Ward","year":"2004","unstructured":"Ward, J., Schlipf, J.: Answer set programming with clause learning. In: Lifschitz, V., Niemel\u00e4, I. (eds.) Proc. of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 2923, pp. 302\u2013313. Springer, New York (2004)"},{"key":"9113_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/11546207_21","volume-title":"Proc. of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, (LPNMR)","author":"J.H. You","year":"2005","unstructured":"You, J.H., Liu, G., Yuan, L.Y., Onuczko, C.: Lookahead in smodels compared to local consistencies in CSP. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) Proc. of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, (LPNMR), Lecture Notes in Computer Science, pp. 266\u2013278. Springer, New York (2005)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9113-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-009-9113-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9113-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T05:49:20Z","timestamp":1738907360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-009-9113-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":55,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9113"],"URL":"https:\/\/doi.org\/10.1007\/s10472-009-9113-1","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}