{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:25:26Z","timestamp":1760171126028},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030297640"},{"type":"electronic","value":"9783030297657"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-29765-7_7","type":"book-chapter","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T19:03:54Z","timestamp":1567537434000},"page":"74-86","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial-Time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation"],"prefix":"10.1007","author":[{"given":"Nico","family":"Potyka","sequence":"first","affiliation":[]},{"given":"Sylwia","family":"Polberg","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Hunter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,4]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"C Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n, C., G\u00e4rdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symbolic Logic 50(2), 510\u2013530 (1985)","journal-title":"J. Symbolic Logic"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-61581-3_3","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"L Amgoud","year":"2017","unstructured":"Amgoud, L., Ben-Naim, J.: Evaluation of arguments in weighted bipolar graphs. In: Antonucci, A., Cholvy, L., Papini, O. (eds.) ECSQARU 2017. LNCS (LNAI), vol. 10369, pp. 25\u201335. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61581-3_3"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1080\/19462166.2014.1001791","volume":"6","author":"P Baroni","year":"2015","unstructured":"Baroni, P., Romano, M., Toni, F., Aurisicchio, M., Bertanza, G.: Automatic evaluation of design alternatives with quantitative argumentation. Argument Comput. 6(1), 24\u201349 (2015)","journal-title":"Argument Comput."},{"issue":"7","key":"7_CR4","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.ijar.2013.03.001","volume":"54","author":"C Cayrol","year":"2013","unstructured":"Cayrol, C., Lagasquie-Schiex, M.C.: Bipolarity in argumentation graphs: towards a better understanding. Int. J. Approximate Reasoning 54(7), 876\u2013899 (2013)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"5","key":"7_CR5","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1017\/S0269888913000325","volume":"29","author":"A Cohen","year":"2014","unstructured":"Cohen, A., Gottifredi, S., Garc\u00eda, A.J., Simari, G.R.: A survey of different approaches to support in argumentation systems. Knowl. Eng. Rev. 29(5), 513\u2013550 (2014)","journal-title":"Knowl. Eng. Rev."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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 (LNAI), vol. 8720, pp. 134\u2013147. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11508-5_12"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM 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. 77(2), 321\u2013357 (1995)","journal-title":"Artif. Intell."},{"key":"7_CR8","unstructured":"Dung, P.M., Thang, P.M.: Towards (probabilistic) argumentation for jury-based dispute resolution. In: Proceedings of COMMA 2010. FAIA, vol. 216, pp. 171\u2013182. IOS Press (2010)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-33347-7_5","volume-title":"KI 2012: Advances in Artificial Intelligence","author":"M Finthammer","year":"2012","unstructured":"Finthammer, M., Beierle, C.: Using equivalences of worlds for aggregation semantics of relational conditionals. In: Glimm, B., Kr\u00fcger, A. (eds.) KI 2012. LNCS (LNAI), vol. 7526, pp. 49\u201360. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33347-7_5"},{"key":"7_CR10","unstructured":"Fischer, V.G., Schramm, M.: tabl-a tool for efficient compilation of probabilistic constraints. Technical report TUM-19636, Technische Universitaet Muenchen (1996)"},{"key":"7_CR11","unstructured":"Hadoux, E., Hunter, A., Polberg, S.: Strategic argumentation dialogues for persuasion: framework and experiments based on modelling the beliefs and concerns of the persuadee. Technical report. University College London (2019)"},{"key":"7_CR12","unstructured":"Hansson, S.: Logic of belief revision. In: The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, winter 2017 edn. (2017)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ijar.2012.08.003","volume":"54","author":"A Hunter","year":"2013","unstructured":"Hunter, A.: A probabilistic approach to modelling uncertain logical arguments. Int. J. Approximate Reasoning 54(1), 47\u201381 (2013)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.ijar.2013.09.002","volume":"55","author":"A Hunter","year":"2014","unstructured":"Hunter, A.: Probabilistic qualification of attack in abstract argumentation. Int. J. Approximate Reasoning 55(2), 607\u2013638 (2014)","journal-title":"Int. J. Approximate Reasoning"},{"key":"7_CR15","unstructured":"Hunter, A.: Modelling the persuadee in asymmetric argumentation dialogues for persuasion. In: Proceedings of IJCAI 2015, pp. 3055\u20133061. AAAI Press (2015)"},{"key":"7_CR16","unstructured":"Hunter, A.: Computational persuasion with applications in behaviour change. In: Proceedings of COMMA 2016. FAIA, vol. 287, pp. 5\u201318. IOS Press (2016)"},{"key":"7_CR17","unstructured":"Hunter, A., Polberg, S., Potyka, N.: Updating belief in arguments in epistemic graphs. In: Proceedings of KR 2018, pp. 138\u2013147. AAAI Press (2018)"},{"key":"7_CR18","unstructured":"Hunter, A., Polberg, S., Thimm, M.: Epistemic graphs for representing and reasoning with positive and negative influences of arguments. arXiv preprint arXiv:1802.07489v1 (2018)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-61581-3_5","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"A Hunter","year":"2017","unstructured":"Hunter, A., Potyka, N.: Updating probabilistic epistemic states in persuasion dialogues. In: Antonucci, A., Cholvy, L., Papini, O. (eds.) ECSQARU 2017. LNCS (LNAI), vol. 10369, pp. 46\u201356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61581-3_5"},{"key":"7_CR20","unstructured":"Hunter, A., Thimm, M.: On partial information and contradictions in probabilistic abstract argumentation. In: Proceedings of KR 2016, pp. 53\u201362. AAAI Press (2016)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44600-1","volume-title":"Conditionals in Nonmonotonic Reasoning and Belief Revision","year":"2001","unstructured":"Kern-Isberner, G. (ed.): Conditionals in Nonmonotonic Reasoning and Belief Revision. LNCS (LNAI), vol. 2087. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44600-1"},{"key":"7_CR22","unstructured":"Kern-Isberner, G.: Linking iterated belief change operations to nonmonotonic reasoning. In: Proceedings of KR 2008, pp. 166\u2013176. AAAI Press, Menlo Park (2008)"},{"issue":"1\u20132","key":"7_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.artint.2004.04.003","volume":"157","author":"G Kern-Isberner","year":"2004","unstructured":"Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artif. Intell. 157(1\u20132), 139\u2013202 (2004)","journal-title":"Artif. Intell."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Kido, H., Okamoto, K.: A Bayesian approach to argument-based reasoning for attack estimation. In: Proceedings of IJCAI 2017, pp. 249\u2013255. AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/36"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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 (LNAI), vol. 7132, pp. 1\u201316. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29184-5_1"},{"key":"7_CR26","unstructured":"Mossakowski, T., Neuhaus, F.: Modular semantics and characteristics for bipolar weighted argumentation graphs. arXiv preprint arXiv:1807.06685 (2018)"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-319-11558-0_42","volume-title":"Logics in Artificial Intelligence","author":"S Polberg","year":"2014","unstructured":"Polberg, S., Doder, D.: Probabilistic abstract dialectical frameworks. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 591\u2013599. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11558-0_42"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ijar.2017.11.009","volume":"93","author":"S Polberg","year":"2018","unstructured":"Polberg, S., Hunter, A.: Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches. Int. J. Approximate Reasoning 93, 487\u2013543 (2018)","journal-title":"Int. J. Approximate Reasoning"},{"key":"7_CR29","unstructured":"Polberg, S., Oren, N.: Revisiting support in abstract argumentation systems. In: Proceedings of COMMA 2014. FAIA, vol. 266, pp. 369\u2013376. IOS Press (2014)"},{"key":"7_CR30","unstructured":"Potyka, N.: Solving reasoning problems for probabilistic conditional logics with consistent and inconsistent information. Ph.D. thesis (2016)"},{"key":"7_CR31","unstructured":"Potyka, N.: Continuous dynamical systems for weighted bipolar argumentation. In: Proceedings of KR 2018, pp. 148\u2013157. AAAI Press (2018)"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Potyka, N.: A polynomial-time fragment of epistemic probabilistic argumentation (technical report). arXiv preprint arXiv:1807.06685 (2018)","DOI":"10.1016\/j.ijar.2019.10.005"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Potyka, N.: A polynomial-time fragment of epistemic probabilistic argumentation (extended abstract). In: Proceedings of AAMAS 2019. IFAAMAS (2019, to appear)","DOI":"10.1016\/j.ijar.2019.10.005"},{"issue":"4","key":"7_CR34","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.jal.2015.01.001","volume":"13","author":"N Potyka","year":"2015","unstructured":"Potyka, N., Beierle, C., Kern-Isberner, G.: A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics. J. Appl. Logic 13(4), 414\u2013440 (2015)","journal-title":"J. Appl. Logic"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Potyka, N., Polberg, S., Hunter, A.: Polynomial-time updates of epistemic states in a fragment of probabilistic epistemic argumentation (technical report). arXiv preprint arXiv:1906.05066 (2019)","DOI":"10.1007\/978-3-030-29765-7_7"},{"key":"7_CR36","unstructured":"Rago, A., Toni, F., Aurisicchio, M., Baroni, P.: Discontinuity-free decision support with quantitative argumentation debates. In: Proceedings of KR 2016, pp. 63\u201373. AAAI Press (2016)"},{"key":"7_CR37","unstructured":"Rienstra, T.: Towards a probabilistic Dung-style argumentation system. In: Proceedings of AT 2012, pp. 138\u2013152 (2012)"},{"key":"7_CR38","unstructured":"Rienstra, T., Thimm, M., Liao, B., van der Torre, L.: Probabilistic abstract argumentation based on SCC decomposability. In: Proceedings of KR 2018, pp. 168\u2013177. AAAI Press (2018)"},{"issue":"1","key":"7_CR39","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10472-018-9574-1","volume":"83","author":"R Riveret","year":"2018","unstructured":"Riveret, R., Baroni, P., Gao, Y., Governatori, G., Rotolo, A., Sartor, G.: A labelling framework for probabilistic argumentation. Ann. Math. Artif. Intell. 83(1), 21\u201371 (2018)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR40","unstructured":"Thimm, M.: A probabilistic semantics for abstract argumentation. In: Proceedings of ECAI 2012. FAIA, vol. 242, pp. 750\u2013755. IOS Press (2012)"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-75553-3_7","volume-title":"Theory and Applications of Formal Argumentation","author":"M Thimm","year":"2018","unstructured":"Thimm, M., Baroni, P., Giacomin, M., Vicig, P.: Probabilities on extensions in abstract argumentation. In: Black, E., Modgil, S., Oren, N. (eds.) TAFA 2017. LNCS (LNAI), vol. 10757, pp. 102\u2013119. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75553-3_7"},{"key":"7_CR42","unstructured":"Thimm, M., Cerutti, F., Rienstra, T.: Probabilistic graded semantics. In: Proceedings of COMMA 2018. FAIA, vol. 305, pp. 369\u2013380. IOS Press (2018)"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29765-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T07:56:07Z","timestamp":1575618967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29765-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030297640","9783030297657"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29765-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECSQARU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Symbolic and Quantitative Approaches with Uncertainty","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecsqaru2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mi.sanu.ac.rs\/~ecsqaru2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}