A model-based theorem prover for epistemic graphs for argumentation. Epistemic graphs are a recent proposal for probabilistic argumentation that allows for modelling an agent’s degree of belief in an argument and how belief in one argument may influence the belief in other arguments. These beliefs are represented by probability distributions and how they affect each other is represented by logical constraints on these distributions. Within the full language of epistemic constraints, we distinguish a restricted class which offers computational benefits while still being powerful enough to allow for handling of many other argumentation formalisms and that can be used in applications that, for instance, rely on Likert scales. In this paper, we propose a model-based theorem prover for reasoning with the restricted epistemic language.

References in zbMATH (referenced in 1 article , 1 standard article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Hunter, Anthony; Polberg, Sylwia: A model-based theorem prover for epistemic graphs for argumentation (2019)