{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:33:40Z","timestamp":1725831220098},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319244884"},{"type":"electronic","value":"9783319244891"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-24489-1_19","type":"book-chapter","created":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T03:00:40Z","timestamp":1443495640000},"page":"241-248","source":"Crossref","is-referenced-by-count":4,"title":["A Software System Using a SAT Solver for Reasoning Under Complete, Stable, Preferred, and Grounded Argumentation Semantics"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Beierle","sequence":"first","affiliation":[]},{"given":"Florian","family":"Brons","sequence":"additional","affiliation":[]},{"given":"Nico","family":"Potyka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-29184-5_2","volume-title":"Theorie and Applications of Formal Argumentation","author":"R Baumann","year":"2012","unstructured":"Baumann, R., Brewka, G., Wong, R.: Splitting argumentation frameworks: an empirical evaluation. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 17\u201331. Springer, Heidelberg (2012)"},{"key":"19_CR2","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: Delgrande, J.P., Schaub, T. (eds.) Proc. of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), pp. 59\u201364 (2004)"},{"key":"19_CR3","unstructured":"Biere, A.: Lingeling, Plingeling and Treengeling entering the SAT competition 2013. In: Balint, A., Belov, A., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings of SAT Competition 2013. Department of Computer Science Series of Publications B, vol. B-2013-1, pp. 51\u201352. University of Helsinki (2013)"},{"key":"19_CR4","unstructured":"Biere, A.: Yet another local search solver and Lingeling and friends entering the sat competition 2014. In: Balint, A., Belov, A., Heule, M., J\u00e4rvisalo, M. (eds.) Proceedings of SAT Competition 2014. Department of Computer Science Series of Publications B, vol. B-2014-2, pp. 39\u201340. University of Helsinki (2014)"},{"key":"19_CR5","unstructured":"Brons, F.: Verwendung des Labelling-Ansatzes nach Caminada als aussagenlogisches Erf\u00fcllbarkeitsproblem f\u00fcr die Berechnung der Semantik abstrakter Argumentationssysteme. M.Sc. Thesis, Dept. of Computer Science, University of Hagen, Germany (2015). (in German)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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. 4160, pp. 111\u2013123. Springer, Heidelberg (2006)"},{"issue":"2\u20133","key":"19_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11225-009-9218-x","volume":"93","author":"M Caminada","year":"2009","unstructured":"Caminada, M., Gabbay, D.: A logical account of formal argumentation. Studia Logica 93(2\u20133), 109\u2013145 (2009)","journal-title":"Studia Logica"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/978-3-642-54373-9_12","volume-title":"Theory and Applications of FormalArgumentation","author":"F Cerutti","year":"2014","unstructured":"Cerutti, F., Dunne, P.E., Giacomin, M., Vallati, M.: Computing preferred extensions in abstract argumentation: a SAT-based approach. In: Black, E., Modgil, S., Oren, N. (eds.) TAFA 2013. LNCS, vol. 8306, pp. 176\u2013193. Springer, Heidelberg (2014). (extended version as technical report)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"P Dung","year":"1995","unstructured":"Dung, P.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77, 321\u2013357 (1995)","journal-title":"Artificial Intelligence"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.artint.2013.10.001","volume":"206","author":"W Dvor\u00e1k","year":"2014","unstructured":"Dvor\u00e1k, W., J\u00e4rvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. 206, 53\u201378 (2014)","journal-title":"Artif. Intell."},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/19462166.2010.486479","volume":"1","author":"U Egly","year":"2010","unstructured":"Egly, U., Gaggl, S., Woltran, S.: Answer set programming encodings for argumentation frameworks. Argument and Computation 1(2), 147\u2013177 (2010)","journal-title":"Argument and Computation"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Modgil, S., Caminada, M.: Proof theories and algorithms for abstract argumentation frameworks. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 105\u2013129. Springer (2009)","DOI":"10.1007\/978-0-387-98197-0_6"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Prakken, H., Vreeswijk, G.: Logics for defeasible argumentation. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 4, pp. 219\u2013318. Springer, Netherlands (2002)","DOI":"10.1007\/978-94-017-0456-4_3"}],"container-title":["Lecture Notes in Computer Science","KI 2015: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24489-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:30:16Z","timestamp":1559255416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24489-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244884","9783319244891"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24489-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}