Delegated updates in epistemic graphs for opponent modelling

DC FieldValueLanguage
dc.contributor.authorHunter, Anthony
dc.contributor.authorPolberg, Sylwia
dc.contributor.authorPotyka, Nico
dc.date.accessioned2021-12-23T16:13:11Z-
dc.date.available2021-12-23T16:13:11Z-
dc.date.issued2019
dc.identifier.issn0888613X
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/10445-
dc.description.abstractIn an epistemic graph, belief in arguments is represented by probability distributions. Furthermore, the influence that belief in arguments can have on the belief in other arguments is represented by constraints on the probability distributions. Different agents may choose different constraints to describe their reasoning, thus making epistemic graphs extremely flexible tools. A key application for epistemic graphs is modelling participants in persuasion dialogues, with the aim of modelling the change in beliefs as each move in the dialogue is made. This requires mechanisms for updating the model throughout the dialogue. In this paper, we introduce the class of delegated update methods, which harness existing, simpler update methods in order to produce more realistic outputs. In particular, we focus on hypothesized updates, which capture agent's reluctance or susceptibility to belief updates that can be caused by certain factors, such as time of the day, fatigue, dialogue length, and more. We provide a comprehensive range of options for modelling different kinds of agents and we explore a range of properties for categorising the options. (C) 2019 Elsevier Inc. All rights reserved.
dc.description.sponsorshipEPSRCUK Research & Innovation (UKRI)Engineering & Physical Sciences Research Council (EPSRC) [EP/N008294/1]; Sylwia Polberg and Anthony Hunter were supported by EPSRC Project EP/N008294/1 ``Framework for Computational Persuasion''.
dc.language.isoen
dc.publisherELSEVIER SCIENCE INC
dc.relation.ispartofINTERNATIONAL JOURNAL OF APPROXIMATE REASONING
dc.subjectBIPOLAR
dc.subjectComputer Science
dc.subjectComputer Science, Artificial Intelligence
dc.subjectEpistemic argumentation
dc.subjectEpistemic updates
dc.subjectLOGIC
dc.subjectPROBABILISTIC ARGUMENTATION
dc.subjectRANKING
dc.subjectREVISION
dc.subjectSEMANTICS
dc.titleDelegated updates in epistemic graphs for opponent modelling
dc.typejournal article
dc.identifier.doi10.1016/j.ijar.2019.07.006
dc.identifier.isiISI:000487166000012
dc.description.volume113
dc.description.startpage207
dc.description.endpage244
dc.contributor.orcid0000-0001-5602-7446
dc.identifier.eissn18734731
dc.publisher.placeSTE 800, 230 PARK AVE, NEW YORK, NY 10169 USA
dcterms.isPartOf.abbreviationInt. J. Approx. Reasoning
dcterms.oaStatusGreen Accepted, Green Submitted
Show simple item record

Google ScholarTM

Check

Altmetric