{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:52:33Z","timestamp":1773939153371,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642156748","type":"print"},{"value":"9783642156755","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15675-5_12","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T04:07:17Z","timestamp":1284350837000},"page":"117-129","source":"Crossref","is-referenced-by-count":3,"title":["Sets of Boolean Connectives That Make Argumentation Easier"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Schmidt","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1014490210693","volume":"34","author":"L. Amgoud","year":"2002","unstructured":"Amgoud, L., Cayrol, C.: A model of reasoning based on the production of acceptable arguments. Ann. Math. Artif. Intell.\u00a034, 197\u2013216 (2002)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/954092.954101","volume":"34","author":"E. B\u00f6hler","year":"2003","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks I: Post\u2019s lattice with applications to complexity theory. SIGACT News\u00a034(4), 38\u201352 (2003)","journal-title":"SIGACT News"},{"issue":"10-15","key":"12_CR3","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2007.05.001","volume":"171","author":"T. Bench-Capon","year":"2007","unstructured":"Bench-Capon, T., Dunne, P.: Argumentation in artificial intelligence. Artif. Intell.\u00a0171(10-15), 619\u2013641 (2007)","journal-title":"Artif. Intell."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0004-3702(01)00071-6","volume":"128","author":"P. Besnard","year":"2001","unstructured":"Besnard, P., Hunter, A.: A logic-based theory of deductive arguments. Artif. Intell.\u00a0128, 203\u2013235 (2001)","journal-title":"Artif. Intell."},{"key":"12_CR5","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262026437.001.0001","volume-title":"Elements of Argumentation","author":"P. Besnard","year":"2008","unstructured":"Besnard, P., Hunter, A.: Elements of Argumentation. MIT Press, Cambridge (2008)"},{"issue":"18","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1016\/j.ipl.2009.06.015","volume":"109","author":"O. Beyersdorff","year":"2009","unstructured":"Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of propositional implication. Inf. Process. Lett.\u00a0109(18), 1071\u20131077 (2009)","journal-title":"Inf. Process. Lett."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/371578.371581","volume":"32","author":"C. Ches\u00f1evar","year":"2000","unstructured":"Ches\u00f1evar, C., Maguitman, A., Loui, R.: Logical models of argument. ACM Comput. Surv.\u00a032, 337\u2013383 (2000)","journal-title":"ACM Comput. Surv."},{"key":"12_CR8","first-page":"8","volume-title":"Proc. 12th KR","author":"N. Creignou","year":"2010","unstructured":"Creignou, N., Schmidt, J., Thomas, M.: Complexity of propositional abduction for restricted sets of Boolean functions. In: Proc. 12th KR, pp. 8\u201316. AAAI, Menlo Park (2010)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.artint.2005.07.002","volume":"170","author":"P. Dung","year":"2006","unstructured":"Dung, P., Kowalski, R., Toni, F.: Dialectical proof procedures for assumption-based admissible argumentation. Artif. Intell.\u00a0170, 114\u2013159 (2006)","journal-title":"Artif. Intell."},{"issue":"2","key":"12_CR10","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":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/200836.200838","volume":"42","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM\u00a042(1), 3\u201342 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S1471068403001674","volume":"4","author":"A. Garc\u00eda","year":"2004","unstructured":"Garc\u00eda, A., Simari, G.: Defeasible logic programming: An argumentative approach. Theory and Practice of Logic Programming\u00a04(1), 95\u2013138 (2004)","journal-title":"Theory and Practice of Logic Programming"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1093\/logcom\/exp074","volume":"20","author":"R. Hirsch","year":"2010","unstructured":"Hirsch, R., Gorogiannis, N.: The complexity of the warranted formula problem in propositional argumentation. J. Log. Comput.\u00a020, 481\u2013499 (2010)","journal-title":"J. Log. Comput."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01744287","volume":"13","author":"H. Lewis","year":"1979","unstructured":"Lewis, H.: Satisfiability problems for propositional calculi. Mathematical Systems Theory\u00a013, 45\u201353 (1979)","journal-title":"Mathematical Systems Theory"},{"key":"12_CR15","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"12_CR16","first-page":"1","volume":"5","author":"E. Post","year":"1941","unstructured":"Post, E.: The two-valued iterative systems of mathematical logic. Ann. Math. Stud.\u00a05, 1\u2013122 (1941)","journal-title":"Ann. Math. Stud."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Prakken, H., Vreeswijk, G.: Logical systems for defeasible argumentation. In: Gabbay, D. (ed.) Handbook of Philosophical Logic. Kluwer, Dordrecht (2002)","DOI":"10.1007\/978-94-017-0456-4_3"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"C. Papadimitriou","year":"1988","unstructured":"Papadimitriou, C., Wolfe, D.: The complexity of facets resolved. J. Comput. Syst. Sci.\u00a037(1), 2\u201313 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1093\/logcom\/13.3.347","volume":"13","author":"S. Parsons","year":"2003","unstructured":"Parsons, S., Wooldridge, M., Amgoud, L.: Properties and complexity of some formal inter-agent dialogues. J. Log. Comput.\u00a013(3), 347\u2013376 (2003)","journal-title":"J. Log. Comput."},{"key":"12_CR20","volume-title":"Argumentation in Artificial Intelligence","year":"2009","unstructured":"Rahwan, I., Simari, G. (eds.): Argumentation in Artificial Intelligence. Springer, Heidelberg (2009)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-04238-6_25","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Thomas","year":"2009","unstructured":"Thomas, M.: The complexity of circumscriptive inference in Post\u2019s lattice. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 290\u2013302. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15675-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T16:43:58Z","timestamp":1559666638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15675-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156748","9783642156755"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15675-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}