{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T11:53:46Z","timestamp":1772366026651,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Austrian Science Fund","award":["Y698"],"award-info":[{"award-number":["Y698"]}]},{"name":"Austrian Science Fund","award":["S11408-N23"],"award-info":[{"award-number":["S11408-N23"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10472-019-09633-x","type":"journal-article","created":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:02:42Z","timestamp":1559980962000},"page":"121-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A multiparametric view on answer set programming"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8681-7470","authenticated-orcid":false,"given":"Johannes K.","family":"Fichte","sequence":"first","affiliation":[]},{"given":"Martin","family":"Kronegger","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"9633_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: a Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: a Modern Approach. Cambridge University Press, Cambridge (2009)"},{"key":"9633_CR2","doi-asserted-by":"crossref","unstructured":"Bliem, B., Moldovan, M., Morak, M., Woltran, S.: The impact of treewidth on ASP grounding and solving. In: Sierra, C. (ed.) Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI\u201917). pp. 852\u2013858. The AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/118"},{"key":"9633_CR3","unstructured":"Bliem, B., Ordyniak, S., Woltran, S.: Clique-width and directed width measures for answer-set programming. In: Fox, M., Kaminka, G. (eds.) Proceedings of the 22st Eureopean Conference on Artificial Intelligence (ECAI\u201916). Frontiers in Artificial Intelligence and Applications, vol. 285, pp 1105\u20131113. IOS Press, The Hague (2016). extended version arXiv: 1606.09449"},{"issue":"1","key":"9633_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1093\/bioinformatics\/11.1.49","volume":"11","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized complexity analysis in computational biology. Bioinformatics 11 (1), 49\u201357 (1995)","journal-title":"Bioinformatics"},{"issue":"1&2","key":"9633_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(94)00251-D","volume":"147","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Wareham, H.T.: The parameterized complexity of sequence alignment and consensus. Theor. Comput. Sci. 147(1&2), 31\u201354 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9633_CR6","doi-asserted-by":"crossref","unstructured":"Bomanson, J., Gebser, M., Janhunen, T.: Improving the normalization of weight rules in answer set programs. In: Ferm\u00e9, E., Leite, J. (eds.) Proceedings of the 14th European Conference on Logics in Artificial Intelligence (JELIA\u201914), Lecture Notes in Computer Science, vol. 8761, pp 166\u2013180. Springer, Funchal (2014)","DOI":"10.1007\/978-3-319-11558-0_12"},{"key":"9633_CR7","doi-asserted-by":"crossref","unstructured":"Bomanson, J., Janhunen, T.: Normalizing cardinality rules using merging and sorting constructions. In: Cabalar, P., Son, T. (eds.) Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201913). Lecture Notes in Computer Science, vol. 8148, pp 187\u2013199. Springer, Corunna (2013)","DOI":"10.1007\/978-3-642-40564-8_19"},{"key":"9633_CR8","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: van Leeuwen, J (ed.) Handbook of Theoretical Computer Science, Vol.B, Vol. Formal Models and Semantics, pp 193\u2013242. Elsevier Science Publishers, North-Holland (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"issue":"4","key":"9633_CR9","first-page":"737","volume":"60","author":"N Creignou","year":"2017","unstructured":"Creignou, N., Meier, A., M\u00fcller, J.S., Schmidt, J., Vollmer, H.: Paradigms for parameterized enumeration. Theor. Comput. Sci. 60(4), 737\u2013758 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"9633_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., D\u00e1niel Marx, M.P., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"issue":"3","key":"9633_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"WF 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":"9633_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity. Monographs in Computer Science","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"9633_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity. Texts in Computer Science","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)"},{"issue":"1-4","key":"9633_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. J. on Satisfiability Boolean Modeling and Computation 2(1-4), 1\u201326 (2006)","journal-title":"J. on Satisfiability Boolean Modeling and Computation"},{"issue":"3\u20134","key":"9633_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. Artif. Intell. 15(3\u20134), 289\u2013323 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1-2","key":"9633_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1017\/S1471068405002577","volume":"6","author":"T Eiter","year":"2006","unstructured":"Eiter, T., Polleres, A.: Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications. Theory Pract. Logic Program. 6(1-2), 23\u201360 (2006)","journal-title":"Theory Pract. Logic Program."},{"key":"9633_CR17","unstructured":"Fichte, J.K.: The good, the bad, and the odd: Cycles in answer-set programs. In: Lassiter, D., Slavkovik, M. (eds.) Proceedings of the 23rd European Summer School in Logic, Language and Information (ESSLLI\u201911) and in New Directions in Logic, Language and Computation (ESSLLI\u201910 and ESSLLI\u201911 Student Sessions, Selected Papers Series), Lecture Notes in Computer Science, vol. 7415, pp 78\u201390. Springer, Berlin (2012)"},{"key":"9633_CR18","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M.: Exploiting treewidth for counting projected answer sets. In: Lierler, Y., Woltran, S. (eds.) Proceedings of the 15th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR\u201919). Philadelphia, . to appear (2019)","DOI":"10.1007\/978-3-030-20528-7_9"},{"key":"9633_CR19","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M., Meier, A.: Counting complexity for reasoning in abstract argumentation. In: Hentenryck, P.V., Zhou, Z. (eds.) Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI\u201919). The AAAI Press, Honolulu (2019)","DOI":"10.1609\/aaai.v33i01.33012827"},{"key":"9633_CR20","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M., Morak, M., Woltran, S.: Answer set solving with bounded treewidth revisited. In: Balduccini, M., Janhunen, T (eds.) Proceedings of the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201917). Lecture Notes in Computer Science, vol. 10377, pp 132\u2013145. Springer, Espoo (2017)","DOI":"10.1007\/978-3-319-61660-5_13"},{"key":"9633_CR21","unstructured":"Fichte, J.K., Hecher, M., Morak, M., Woltran, S.: dynASP2.5: Dynamic programming on tree decompositions in action. In: Lokshtanov, D., Nishimura, N (eds.) Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC\u201917). pp. 17:1\u201317:12. Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl Publishing (2017)"},{"key":"9633_CR22","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M., Morak, M., Woltran, S.: Exploiting treewidth for projected model counting and its limits. In: Beyersdorff, O., Wintersteiger, C. (eds.) Proceedings on the 21th International Conference on Theory and Applications of Satisfiability Testing (SAT\u201918). Lecture Notes in Computer Science, vol. 10929, pp 165\u2013184. Springer, Oxford (2018)","DOI":"10.1007\/978-3-319-94144-8_11"},{"key":"9633_CR23","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M., Schindler, I.: Default logic and bounded Treewidth. In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) Proceedings of the 12th International Conference on Language and Automata Theory and Applications (LATA\u201918). Lecture Notes in Computer Science, vol. 10792, pp 130\u2013142. Springer, Ramat Gan (2018)","DOI":"10.1007\/978-3-319-77313-1_10"},{"key":"9633_CR24","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Meier, A., Schindler, I.: Strong backdoors for default logic. In: Creignou, N., Le Berre, D (eds.) Proceedings of the 19th International Conference Theory and Applications of Satisfiability Testing (SAT\u201916), pp 45\u201359. Springer, Bordeaux (Jul 2016)","DOI":"10.1007\/978-3-319-40970-2_4"},{"issue":"1","key":"9633_CR25","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/2818646","volume":"17","author":"JK Fichte","year":"2015","unstructured":"Fichte, J.K., Szeider, S.: Backdoors to normality for disjunctive logic programs. ACM Trans. Comput. Log. 17(1), 7 (2015)","journal-title":"ACM Trans. Comput. Log."},{"issue":"0","key":"9633_CR26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.artint.2014.12.001","volume":"220","author":"JK Fichte","year":"2015","unstructured":"Fichte, J.K., Szeider, S.: Backdoors to tractable answer-set programming. Artif. Intell. 220(0), 64\u2013103 (2015)","journal-title":"Artif. Intell."},{"key":"9633_CR27","unstructured":"Fichte, J.K., Szeider, S.: Backdoor trees for answer set programming. In: Bogaerts, B., Harrison, A. (eds.) Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR\u201917), vol. 1868, pp 9:1\u201314. CEUR Workshop Proceedings (CEUR-WS.org), Espoo (Jul 2017)"},{"key":"9633_CR28","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Truszczy\u0144ski, M., Woltran, S.: Dual-normal programs \u2013 the forgotten class. Theory and Practice of Logic Programming. In: proceedings of the 31st International Conference on Logic Programming (ICLP\u201915), pp. 495\u2013510 (2015)","DOI":"10.1017\/S1471068415000186"},{"issue":"2","key":"9633_CR29","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0890-5401(03)00161-5","volume":"187","author":"J Flum","year":"2003","unstructured":"Flum, J., Grohe, M.: Describing parameterized complexity classes. Inf. Comput. 187(2), 291\u2013319 (2003)","journal-title":"Inf. Comput."},{"key":"9633_CR30","volume-title":"Parameterized Complexity Theory Theoretical Computer Science, vol. XIV","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory Theoretical Computer Science, vol. XIV. Springer, Berlin (2006)"},{"key":"9633_CR31","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer set solving in practice. Morgan & Claypool (2012)","DOI":"10.1007\/978-3-642-20832-4_6"},{"issue":"2","key":"9633_CR32","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2480759.2480767","volume":"14","author":"M Gebser","year":"2013","unstructured":"Gebser, M., Schaub, T.: Tableau calculi for logic programs under answer set semantics. ACM Trans. Comput. Log. 14(2), 15 (2013)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2-3","key":"9633_CR33","first-page":"323\u2014360","volume":"11","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Schaub, T., Thiele, S., Veber, P.: Detecting inconsistencies in large biological networks with answer set programming. Theory Pract. Logic Program. 11(2-3), 323\u2014360 (2011)","journal-title":"Theory Pract. Logic Program."},{"key":"9633_CR34","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K. (eds.) Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP\/SLP\u201988), vol. 2, pp 1070\u20131080. MIT Press, Seattle (1988)"},{"issue":"3\/4","key":"9633_CR35","doi-asserted-by":"publisher","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. N. Gener. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"N. Gener. Comput."},{"issue":"1","key":"9633_CR36","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.artint.2009.10.003","volume":"174","author":"G Gottlob","year":"2010","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell. 174(1), 105\u2013132 (2010)","journal-title":"Artif. Intell."},{"issue":"1-2","key":"9633_CR37","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0004-3702(02)00182-0","volume":"138","author":"G Gottlob","year":"2002","unstructured":"Gottlob, G., Scarcello, F., Sideri, M.: Fixed-parameter complexity in AI and nonmonotonic reasoning. Artif. Intell. 138(1-2), 55\u201386 (2002)","journal-title":"Artif. Intell."},{"issue":"3","key":"9633_CR38","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1093\/comjnl\/bxm056","volume":"51","author":"G Gottlob","year":"2008","unstructured":"Gottlob, G., Szeider, S.: Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems. Comput. J. 51(3), 303\u2013325 (2008)","journal-title":"Comput. J."},{"key":"9633_CR39","unstructured":"Jakl, M., Pichler, R., Woltran, S.: Answer-set programming with bounded treewidth. In: Boutilier, C (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI\u201909), vol. 2, pp 816\u2013822. The AAAI Press, Pasadena (2009)"},{"key":"9633_CR40","doi-asserted-by":"crossref","unstructured":"Janhunen, T.: On the effect of default negation on the expressiveness of disjunctive rules. In: Eiter, T., Faber, W., Truszczy\u0144ski, M (eds.) Proceedings of the 6th International Conference on Logic Programming and Nonmotonic Reasoning (LPNMR\u201901). Lecture Notes in Computer Science, vol. 2173, pp 93\u2013106. Springer, Vienna (2001)","DOI":"10.1007\/3-540-45402-0_7"},{"key":"9633_CR41","doi-asserted-by":"crossref","unstructured":"Janhunen, T., Niemel\u00e4, I.: Compact translations of non-disjunctive answer set programs to propositional clauses. In: Balduccini, M., Son, T. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning \u2013 Essays Dedicated to Michael Gelfond on the Occasion of His 65Th Birthday, Lecture Notes in Artificial Intelligence, vol. 6565, pp 111\u2013130. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20832-4_8"},{"key":"9633_CR42","doi-asserted-by":"crossref","unstructured":"Janota, M., Marques-Silva, J.: On deciding mus membership with QBF. In: Lee, J (ed.) Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP\u201911). Lecture Notes in Computer Science, vol. 6876, pp 414\u2013428. Springer, Perugia (2011)","DOI":"10.1007\/978-3-642-23786-7_32"},{"key":"9633_CR43","doi-asserted-by":"crossref","unstructured":"Kronegger, M., Ordyniak, S., Pfandler, A.: Backdoors to planning. In: Brodley, C.E., Stone, P (eds.) Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI\u201914), pp 2300\u20132307. The AAAI Press, Qu\u00e9bec City (2014)","DOI":"10.1609\/aaai.v28i1.9033"},{"key":"9633_CR44","doi-asserted-by":"crossref","unstructured":"Kronegger, M., Ordyniak, S., Pfandler, A.: Variable-deletion backdoors to planning. In: Bonet, B., Koenig, S (eds.) Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI\u201915), pp 3305\u20133312. The AAAI Press, Austin (2015)","DOI":"10.1609\/aaai.v29i1.9662"},{"key":"9633_CR45","unstructured":"Kronegger, M., Pfandler, A., Pichler, R.: Parameterized complexity of optimal planning: A detailed map. In: Rossi, F., Thrun, S (eds.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI\u201913), pp 954\u2013961. The AAAI Press, Beijing (2013)"},{"key":"9633_CR46","unstructured":"Lackner, M., Pfandler, A.: Fixed-parameter algorithms for finding minimal models. In: Eiter, T., McIlraith, S (eds.) Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201912), pp 85\u201395. The AAAI Press, Rome (2012)"},{"issue":"1","key":"9633_CR47","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"JK Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41\u201355 (2003)","journal-title":"Inf. Comput."},{"key":"9633_CR48","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Thirteen definitions of a stable model. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation, Lecture Notes in Computer Science, vol. 6300, pp 488\u2013503. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15025-8_24"},{"issue":"1","key":"9633_CR49","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/601775.601779","volume":"4","author":"Z Lonc","year":"2003","unstructured":"Lonc, Z., Truszczy\u0144ski, M.: Fixed-parameter complexity of semantics for logic programs. ACM Trans. Comput. Log. 4(1), 91\u2013119 (2003)","journal-title":"ACM Trans. Comput. Log."},{"key":"9633_CR50","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: Apt, K.R., Marek, V.W., Truszczy\u0144ski, M., Warren, D. (eds.) The Logic Programming Paradigm: a 25-Year Perspective, pp 375\u2013398. Artificial Intelligence, Springer, Berlin (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"9633_CR51","unstructured":"Marx, D., Pilipczuk, M.: Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). In: Mayr, E. W., Portier, N (eds.) Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS\u201914). Leibniz International Proceedings in Informatics (LIPIcs), vol. 25, pp 542\u2013553. Dagstuhl Publishing, Lyon (2014)"},{"issue":"5-6","key":"9633_CR52","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s00153-015-0435-x","volume":"54","author":"A Meier","year":"2015","unstructured":"Meier, A., Schindler, I., Schmidt, J., Thomas, M., Vollmer, H.: On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54(5-6), 685\u2013710 (2015)","journal-title":"Arch. Math. Log."},{"key":"9633_CR53","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)"},{"key":"9633_CR54","doi-asserted-by":"crossref","unstructured":"Pearce, D.: A new logical characterisation of stable models and answer sets. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds.) Non-Monotonic Extensions of Logic Programming, pp 57\u201370. Springer, Berlin (1997)","DOI":"10.1007\/BFb0023801"},{"key":"9633_CR55","doi-asserted-by":"crossref","unstructured":"Peschiera, C., Pulina, L., Tacchella, A., Bubeck, U., Kullmann, O., Lynce, I.: The seventh QBF solvers evaluation (QBFEVAL\u201910). In: Strichman, O., Szeider, S (eds.) Proceedings of the 13th International Conference Theory and Applications of Satisfiability Testing (SAT\u201910). Lecture Notes in Computer Science, vol. 6175, pp 237\u2013250. Springer, Edinburgh (2010)","DOI":"10.1007\/978-3-642-14186-7_20"},{"issue":"2","key":"9633_CR56","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1017\/S1471068412000099","volume":"14","author":"R Pichler","year":"2014","unstructured":"Pichler, R., R\u00fcmmele, S., Szeider, S., Woltran, S.: Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory Pract. Logic Program. 14(2), 141\u2013164 (2014)","journal-title":"Theory Pract. Logic Program."},{"key":"9633_CR57","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A. (eds.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC\u201978), pp 216\u2013226. New York, Assoc. Comput. Mach. (1978)","DOI":"10.1145\/800133.804350"},{"issue":"1-2","key":"9633_CR58","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-2), 181\u2013234 (2002)","journal-title":"Artif. Intell."},{"key":"9633_CR59","unstructured":"Syrj\u00e4nen, T.: Lparse 1.0 user\u2019s manual. http:\/\/www.tcs.hut.fi\/Software\/smodels\/lparse.ps\/ (2002)"},{"key":"9633_CR60","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1017\/S1471068410000463","volume":"11","author":"M Truszczy\u0144ski","year":"2011","unstructured":"Truszczy\u0144ski, M.: Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs. Theory Pract. Logic Program. 11, 881\u2013904 (2011)","journal-title":"Theory Pract. Logic Program."},{"issue":"1","key":"9633_CR61","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2010.04.007","volume":"175","author":"PH Tu","year":"2011","unstructured":"Tu, P.H., Son, T.C., Gelfond, M., Morales, A.R.: Approximation of action theories and its application to conformant planning. Artif. Intell. 175(1), 79\u2013119 (2011). John McCarthy\u2019s Legacy","journal-title":"Artif. Intell."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09633-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-019-09633-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09633-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T23:41:06Z","timestamp":1663630866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-019-09633-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":61,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9633"],"URL":"https:\/\/doi.org\/10.1007\/s10472-019-09633-x","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}