{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:36Z","timestamp":1762101756006,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231136"},{"type":"electronic","value":"9783319231143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_22","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"359-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Verification in Argument-Incomplete Argumentation Frameworks"],"prefix":"10.1007","author":[{"given":"Dorothea","family":"Baumeister","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]},{"given":"Hilmar","family":"Schadrack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Baumeister, D., Rothe, J.: Preference aggregation by voting (chapter 4). In: Rothe, J. (ed.) Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, pp. 197\u2013325. Springer (2015). doi:10.1007\/978-3-662-47904-9_4","DOI":"10.1007\/978-3-662-47904-9_4"},{"key":"22_CR2","unstructured":"Baumeister, D., Roos, M., Rothe, J.: Computational complexity of two variants of the possible winner problem. In: Proceedings of AAMAS 2011, pp. 853\u2013860. IFAAMAS (2011)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Roos, M., Rothe, J., Schend, L., Xia, L.: The possible winner problem with uncertain weights. In: Proceedings of ECAI 2012, pp. 133\u2013138. IOS Press (2012)","DOI":"10.1016\/j.jcss.2023.103464"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.mathsocsci.2015.03.006","volume":"76","author":"D Baumeister","year":"2015","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Erd\u00e9lyi, O., Rothe, J.: Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Math. Soc. Sci. 76, 19\u201330 (2015)","journal-title":"Math. Soc. Sci."},{"key":"22_CR5","unstructured":"Baumeister, D., Bouveret, S., Lang, J., Nguyen, T., Nguyen, N., Rothe, J.: Scoring rules for the allocation of indivisible goods. In: Proceedings of ECAI 2014, pp. 75\u201380. IOS Press (2014)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Neugebauer, D., Rothe, J.: Verification in attack-incomplete argumentation frameworks. In: Walsh, T. (ed.) ADT 2015. LNCS (LNAI), vol. 9346, pp. xx\u2013yy. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-23114-3_21"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-02906-6_11","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"G Boella","year":"2009","unstructured":"Boella, G., Kaci, S., van der Torre, L.: Dynamics in argumentation with single extensions: abstraction principles and the grounded extension. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 107\u2013118. Springer, Heidelberg (2009)"},{"key":"22_CR8","volume-title":"Handbook of Computational Social Choice","author":"C Boutilier","year":"2015","unstructured":"Boutilier, C., Rosenschein, J.: Incomplete information and communication in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2015). (Chapter 10)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S Bouveret","year":"2008","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. J. Artif. Intell. Res. 32, 525\u2013564 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR10","unstructured":"Bouveret, S., Endriss, U., Lang, J.: Fair division under ordinal preferences: computing envy-free allocations of indivisible goods. In: Proceedings of ECAI 2010, pp. 387\u2013392. IOS Press (2010)"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/B:THEO.0000024421.85722.0a","volume":"55","author":"S Brams","year":"2003","unstructured":"Brams, S., Edelman, P., Fishburn, P.: Fair division of indivisible items. Theor. Decis. 55(2), 147\u2013180 (2003)","journal-title":"Theor. Decis."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-75256-1_25","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"C Cayrol","year":"2007","unstructured":"Cayrol, C., Devred, C., Lagasquie-Schiex, M.C.: Handling ignorance in argumentation: semantics of partial argumentation frameworks. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 259\u2013270. Springer, Heidelberg (2007)"},{"key":"22_CR13","unstructured":"Cayrol, C., de Saint-Cyr, F., Lagasquie-Schiex, M.: Revision of an argumentation system. In: Proceedings of KR 2008, pp. 124\u2013134. AAAI Press (2008)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1613\/jair.2965","volume":"38","author":"C Cayrol","year":"2010","unstructured":"Cayrol, C., de Saint-Cyr, F., Lagasquie-Schiex, M.: Change in abstract argumentation frameworks: adding an argument. J. Artif. Intell. Res. 38, 49\u201384 (2010)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.mathsocsci.2011.12.003","volume":"64","author":"Y Chevaleyre","year":"2012","unstructured":"Chevaleyre, Y., Lang, J., Maudet, N., Monnot, J., Xia, L.: New candidates welcome! Possible winners with respect to the addition of new candidates. Math. Soc. Sci. 64(1), 74\u201388 (2012)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","volume":"170","author":"Y Dimopoulos","year":"1996","unstructured":"Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theoret. Comput. Sci. 170(1), 209\u2013244 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-11508-5_12","volume-title":"Scalable Uncertainty Management","author":"D Doder","year":"2014","unstructured":"Doder, D., Woltran, S.: Probabilistic argumentation frameworks \u2013 a logical approach. In: Straccia, U., Cal\u00ec, A. (eds.) SUM 2014. LNCS, vol. 8720, pp. 134\u2013147. Springer, Heidelberg (2014)"},{"issue":"2","key":"22_CR18","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. Artif. Intell. 77(2), 321\u2013357 (1995)","journal-title":"Artif. Intell."},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-0-387-98197-0_5","volume-title":"Argumentation in Artificial Intelligence","author":"P Dunne","year":"2009","unstructured":"Dunne, P., Wooldridge, M.: Complexity of abstract argumentation. In: Rahwan, I., Simari, G. (eds.) Argumentation in Artificial Intelligence, pp. 85\u2013104. Springer, New York (2009). (Chapter 5)"},{"key":"22_CR20","unstructured":"Fazzinga, B., Flesca, S., Parisi, F.: On the complexity of probabilistic abstract argumentation. In: Proceedings of IJCAI 2013, pp. 898\u2013904. AAAI Press\/IJCAI (2013)"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-40381-1_9","volume-title":"Scalable Uncertainty Management","author":"B Fazzinga","year":"2013","unstructured":"Fazzinga, B., Flesca, S., Parisi, F.: Efficiently estimating the probability of extensions in abstract argumentation. In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS, vol. 8078, pp. 106\u2013119. Springer, Heidelberg (2013)"},{"key":"22_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"22_CR23","unstructured":"Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: Proceedings of Multidisciplinary IJCAI 2005 Workshop on Advances in Preference Handling, pp. 124\u2013129 (2005)"},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s10458-011-9171-8","volume":"25","author":"J Lang","year":"2012","unstructured":"Lang, J., Pini, M., Rossi, F., Salvagnin, D., Venable, K., Walsh, T.: Winner determination in voting trees with incomplete preferences and weighted votes. J. Auton. Agents Multi-Agent Syst. 25(1), 130\u2013157 (2012)","journal-title":"J. Auton. Agents Multi-Agent Syst."},{"key":"22_CR25","unstructured":"Lang, J., Rey, A., Rothe, J., Schadrack, H., Schend, L.: Representing and solving hedonic games with ordinal preferences and thresholds. In: Proceedings of AAMAS 2015. IFAAMAS (2015)"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-29184-5_1","volume-title":"Theorie and Applications of Formal Argumentation","author":"H Li","year":"2012","unstructured":"Li, H., Oren, N., Norman, T.J.: Probabilistic argumentation frameworks. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 1\u201316. Springer, Heidelberg (2012)"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Meyer, A., Stockmeyer, L.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proceedings of FOCS 1972, pp. 125\u2013129. IEEE Press (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"22_CR28","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.: Computational Complexity, 2nd edn. Addison-Wesley, New York (1995). Reprinted with corrections","edition":"2"},{"issue":"2","key":"22_CR29","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"C Papadimitriou","year":"1984","unstructured":"Papadimitriou, C., Yannakakis, M.: The complexity of facets (and some facets of complexity). J. Comput. Syst. Sci. 28(2), 244\u2013259 (1984)","journal-title":"J. Comput. Syst. Sci."},{"volume-title":"Argumentation in Artificial Intelligence","year":"2009","key":"22_CR30","unstructured":"Rahwan, I., Simari, G. (eds.): Argumentation in Artificial Intelligence. Springer, New York (2009)"},{"issue":"1","key":"22_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.: The polynomial-time hierarchy. Theoret. Comput. Sci. 3(1), 1\u201322 (1976)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"22_CR32","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","volume":"51","author":"K Wagner","year":"1987","unstructured":"Wagner, K.: More complicated questions about maxima and minima, and some closures of NP. Theoret. Comput. Sci. 51(1\u20132), 53\u201380 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR33","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1613\/jair.3186","volume":"41","author":"L Xia","year":"2011","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners given partial orders. J. Artif. Intell. Res. 41, 25\u201367 (2011)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23114-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T12:52:14Z","timestamp":1691931134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}