Delegated updates in epistemic graphs for opponent modelling

DOI10.1016/J.IJAR.2019.07.006zbMATH Open1468.68213OpenAlexW2964926349MaRDI QIDQ2302776FDOQ2302776

Authors Anthony Hunter, Sylwia Polberg, Nico Potyka 

Publication date 26 February 2020

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL http://orca.cf.ac.uk/124531/1/epistemic_meta_final.pdf

zbMATH Keywords

probabilistic argumentationepistemic argumentationepistemic updates

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• Learning constraints for the epistemic graphs approach to argumentation
• Updating Epistemic Logic Programs
• A model for updates in a multi-agent setting
• Soft evidential update for probabilistic multiagent systems
• Polynomial-time updates of epistemic states in a fragment of probabilistic epistemic argumentation
• Dynamic epistemic logic in update logic
• Efficient reasoning in multiagent epistemic logics
• Updating probabilistic epistemic states in persuasion dialogues

Cites work

• scientific article; zbMATH DE number 3539473 (Why is no real title available?)
• scientific article; zbMATH DE number 2243383 (Why is no real title available?)
• A distance measure for bounding probabilistic belief change
• A logical account of formal argumentation
• A parametrized ranking-based semantics for persuasion
• A probabilistic approach to modelling uncertain logical arguments
• A probabilistic semantics for abstract argumentation
• A survey of non-prioritized belief revision
• Analysing inconsistent information using distance-based measures
• Belief in attacks in epistemic probabilistic argumentation
• Belief revision in structured probabilistic argumentation, model and application to cyber security
• Bipolarity in argumentation graphs: towards a better understanding
• Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
• Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
• Epistemic graphs for representing and reasoning with positive and negative influences of arguments
• Evaluation of arguments in weighted bipolar graphs
• I-divergence geometry of probability distributions and minimization problems
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the logic of theory change: Partial meet contraction and revision functions
• Probabilistic Belief Revision via Similarity of Worlds Modulo Evidence
• Probabilistic reasoning with abstract argumentation frameworks
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Understanding the abstract dialectical framework
• Updating probabilistic epistemic states in persuasion dialogues

Cited in

(4)

• Epistemic graphs for representing and reasoning with positive and negative influences of arguments
• A filtering-based general approach to learning rational constraints of epistemic graphs
• Updating probabilistic epistemic states in persuasion dialogues
• Learning constraints for the epistemic graphs approach to argumentation

This page was built for publication: Delegated updates in epistemic graphs for opponent modelling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302776)