{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:10:09Z","timestamp":1739315409992,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042379"},{"type":"electronic","value":"9783642042386"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04238-6_12","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T08:23:01Z","timestamp":1251706981000},"page":"115-128","source":"Crossref","is-referenced-by-count":10,"title":["Manifold Answer-Set Programs for Meta-reasoning"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Faber","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm \u2013 A 25-Year Perspective, pp. 375\u2013398 (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"issue":"3-4","key":"12_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 programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell.\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2002)","DOI":"10.1017\/CBO9780511543357"},{"key":"12_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-45632-5_16","volume-title":"Computational Logic: Logic Programming and Beyond","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M.: Representing knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02408, pp. 413\u2013451. Springer, Heidelberg (2002)"},{"key":"12_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-72200-7_3","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczy\u0144ski, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 3\u201317. Springer, Heidelberg (2007)"},{"key":"12_CR6","unstructured":"Bravo, L., Bertossi, L.E.: Logic programs for consistently querying data integration systems. In: IJCAI 2003, pp. 10\u201315 (2003)"},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(96)00067-1","volume":"58","author":"D. Sacc\u00e0","year":"1996","unstructured":"Sacc\u00e0, D.: Multiple total stable models are definitely needed to solve unique solution problems. Inf. Process. Lett.\u00a058(5), 249\u2013254 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"12_CR8","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/69.877512","volume":"12","author":"F. Buccafurri","year":"2000","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng.\u00a012(5), 845\u2013860 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","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.\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Reiter, R.: On closed world data bases. In: Logic and Databases, pp. 55\u201376. Plenum Press (1978)","DOI":"10.1007\/978-1-4684-3384-5_3"},{"issue":"10-15","key":"12_CR11","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2007.05.001","volume":"171","author":"T.J.M. Bench-Capon","year":"2007","unstructured":"Bench-Capon, T.J.M., Dunne, P.E.: Argumentation in artificial intelligence. Artif. Intell.\u00a0171(10-15), 619\u2013641 (2007)","journal-title":"Artif. Intell."},{"issue":"10-15","key":"12_CR12","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"P.M. Dung","year":"2007","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artif. Intell.\u00a0171(10-15), 642\u2013674 (2007)","journal-title":"Artif. Intell."},{"issue":"3\/4","key":"12_CR13","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. New Generation Comput.\u00a09(3\/4), 365\u2013386 (1991)","journal-title":"New Generation Comput."},{"key":"12_CR14","first-page":"147","volume-title":"COMMA 2008","author":"P.E. Dunne","year":"2008","unstructured":"Dunne, P.E.: The computational complexity of ideal semantics I: Abstract argumentation frameworks. In: COMMA 2008, pp. 147\u2013158. IOS Press, Amsterdam (2008)"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"P.M. Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell.\u00a077(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"issue":"10-15","key":"12_CR16","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.artint.2007.03.006","volume":"171","author":"P.E. Dunne","year":"2007","unstructured":"Dunne, P.E.: Computational properties of argument systems satisfying graph-theoretic constraints. Artif. Intell.\u00a0171(10-15), 701\u2013729 (2007)","journal-title":"Artif. Intell."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Osorio, M., Zepeda, C., Nieves, J.C., Cort\u00e9s, U.: Inferring acceptable arguments with answer set programming. In: ENC 2005, pp. 198\u2013205 (2005)","DOI":"10.1109\/ENC.2005.26"},{"key":"12_CR18","unstructured":"Egly, U., Gaggl, S., Woltran, S.: Answer-set programming encodings for argumentation frameworks. In: Proceedings ASPOCP 2008 (2008)"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0304-3975(01)00147-5","volume":"288","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Veith, H.: On the complexity of data disjunctions. Theor. Comput. Sci.\u00a0288(1), 101\u2013128 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.3166\/jancl.12.259-285","volume":"12","author":"J.P. Delgrande","year":"2002","unstructured":"Delgrande, J.P., Schaub, T.: Reasoning credulously and skeptically within a single extension. Journal of Applied Non-Classical Logics\u00a012(2), 259\u2013285 (2002)","journal-title":"Journal of Applied Non-Classical Logics"},{"issue":"4-5","key":"12_CR21","first-page":"463","volume":"3","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by meta-interpretation in answer set programming. TPLP\u00a03(4-5), 463\u2013498 (2003)","journal-title":"TPLP"}],"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-642-04238-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T22:39:43Z","timestamp":1739313583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04238-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042379","9783642042386"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04238-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}