{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:15:02Z","timestamp":1760170502741,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006081"},{"type":"electronic","value":"9783642006098"}],"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-00609-8_22","type":"book-chapter","created":{"date-parts":[[2009,4,5]],"date-time":"2009-04-05T21:09:54Z","timestamp":1238965794000},"page":"254-269","source":"Crossref","is-referenced-by-count":9,"title":["Computing Argumentation Semantics in Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Toshiko","family":"Wakaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsumi","family":"Nitta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), pp. 59\u201364 (2004)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11853886_11","volume-title":"Logics in Artificial Intelligence","author":"M. Caminada","year":"2006","unstructured":"Caminada, M.: On the issue of reinstatement in argumentation. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol.\u00a04160, pp. 111\u2013123. Springer, Heidelberg (2006)"},{"key":"22_CR3","first-page":"121","volume-title":"Proceedings of the first International Conference on Computational Models of Argument (COMMA 2006)","author":"M. Caminada","year":"2006","unstructured":"Caminada, M.: Semi-stable semantics. In: Proceedings of the first International Conference on Computational Models of Argument (COMMA 2006), pp. 121\u2013130. IOS Press, Amsterdam (2006)"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1093\/logcom\/13.3.377","volume":"13","author":"C. Cayrol","year":"2003","unstructured":"Cayrol, C., Doutre, S., Mengin, J.: On decision problems related to the preferred semantics for argumentation frameworks. Journal of Logic and Computation\u00a013(3), 377\u2013403 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"22_CR5","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. Artificial Intelligence\u00a077, 321\u2013357 (1995)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.artint.2005.07.002","volume":"170","author":"P.M. Dung","year":"2006","unstructured":"Dung, P.M., Kowalski, R.A., Toni, F.: Dialectic proof procedures for assumption-based, admissible argumentation. Artificial Intelligence\u00a0170(2), 114\u2013159 (2006)","journal-title":"Artificial Intelligence"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","volume":"141","author":"P.E. Dunne","year":"2002","unstructured":"Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artificial Intelligence\u00a0141, 187\u2013203 (2002)","journal-title":"Artificial Intelligence"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","first-page":"364","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol.\u00a01265, pp. 364\u2013375. Springer, Heidelberg (1997), \n                    \n                      http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\/"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-24609-1_11","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Polleres, A.: Towards automated integration of guess and check programs in answer set programming. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS, vol.\u00a02923, pp. 100\u2013113. Springer, Heidelberg (2004)"},{"key":"22_CR10","first-page":"133","volume-title":"Proceedings of the first International Conference on Computational Models of Argument (COMMA 2006)","author":"U. Egly","year":"2006","unstructured":"Egly, U., Woltran, S.: Reasoning in argumentation frameworks using quantified boolean formulas. In: Proceedings of the first International Conference on Computational Models of Argument (COMMA 2006), pp. 133\u2013144. IOS Press, Amsterdam (2006)"},{"key":"22_CR11","first-page":"1070","volume-title":"Proceedings of the fifth International Conference and Symposium on Logic Programming (ICLP\/SLP 1988)","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the fifth International Conference and Symposium on Logic Programming (ICLP\/SLP 1988), pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"22_CR12","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 Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"22_CR13","unstructured":"Lifschitz, V.: Computing circumscription. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI 1985), pp. 121\u2013127 (1985)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence\u00a028, 89\u2013116 (1986)","journal-title":"Artificial Intelligence"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-63255-7_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Niemel\u00e4","year":"1997","unstructured":"Niemel\u00e4, I., Simons, P.: Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, pp. 421\u2013430. Springer, Heidelberg (1997), \n                    \n                      http:\/\/www.tcs.hut.fi\/Software\/smodels\/"},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S1471068408003359","volume":"8","author":"J.C. Nieves","year":"2008","unstructured":"Nieves, J.C., Cortes, U., Osorio, M.: Preferred extensions as stable models. Theory and Practice of Logic Programming\u00a08(4), 527\u2013543 (2008)","journal-title":"Theory and Practice of Logic Programming"},{"key":"22_CR17","first-page":"218","volume-title":"Handbook of Philosophical Logic","author":"H. Prakken","year":"2001","unstructured":"Prakken, H., Vreeswijk, G.A.W.: Logics for defeasible argumentation. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol.\u00a04, pp. 218\u2013319. Kluwer, Dordecht (2001)","edition":"2"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0004-3702(00)00054-0","volume":"123","author":"C. Sakama","year":"2000","unstructured":"Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence\u00a0123, 185\u2013222 (2000)","journal-title":"Artificial Intelligence"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-39813-4_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Wakaki","year":"2003","unstructured":"Wakaki, T., Inoue, K., Sakama, C., Nitta, K.: Computing preferred answer sets in answer set programming. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol.\u00a02850, pp. 259\u2013273. Springer, Heidelberg (2003)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-27775-0_25","volume-title":"Logic Programming","author":"T. Wakaki","year":"2004","unstructured":"Wakaki, T., Inoue, K.: Compiling prioritized circumscription into answer set programming. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 356\u2013370. Springer, Heidelberg (2004)"},{"key":"#cr-split#-22_CR21.1","doi-asserted-by":"crossref","unstructured":"Wakaki, T., Tomita, T.: Circumscriptive theorem prover based on integration of guess and check program. Transactions of the Japanese Society for Artificial Intelligence, pp. 472-481 (2006)","DOI":"10.1527\/tjsai.22.472"},{"key":"#cr-split#-22_CR21.2","doi-asserted-by":"crossref","unstructured":"also the revised version is, Wakaki, T., Tomita, T.: Circumscriptive theorem prover based on integration of guess and check program. Transactions of the Japanese Society for Artificial Intelligence\u00a022(5), 472-481 (2007) (in Japanese)","DOI":"10.1527\/tjsai.22.472"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00609-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:58:39Z","timestamp":1558267119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00609-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006081","9783642006098"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00609-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}