Probabilistic Argumentation. An Equational Approach
D. M. Gabbay, O. Rodrigues

TL;DR
This paper introduces a probabilistic semantics for abstract argumentation theory using an equational approach, translating argumentation networks into propositional logic to incorporate probabilistic features.
Contribution
It presents a novel probabilistic semantics for argumentation networks through translation into propositional logic, improving upon brute-force methods.
Findings
Probabilistic semantics are formalized for argumentation networks.
Comparison with existing approaches shows advantages of the translation method.
The equational approach provides a flexible framework for probabilistic argumentation.
Abstract
There is a generic way to add any new feature to a system. It involves 1) identifying the basic units which build up the system and 2) introducing the new feature to each of these basic units. In the case where the system is argumentation and the feature is probabilistic we have the following. The basic units are: a. the nature of the arguments involved; b. the membership relation in the set S of arguments; c. the attack relation; and d. the choice of extensions. Generically to add a new aspect (probabilistic, or fuzzy, or temporal, etc) to an argumentation network <S,R> can be done by adding this feature to each component a-d. This is a brute-force method and may yield a non-intuitive or meaningful result. A better way is to meaningfully translate the object system into another target system which does have the aspect required and then let the target system endow the aspect on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Agent Systems and Negotiation · Logic, Reasoning, and Knowledge · Semantic Web and Ontologies
