Probabilistic argumentation: an equational approach

DOI10.1007/S11787-015-0120-1MaRDI QIDQ497876zbMATH OpenOpenAlexWikidataFDO

Authors Dov Gabbay, Odinaldo Rodrigues

Publication date 25 September 2015

Published in Logica Universalis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.05501, http://orbilu.uni.lu/handle/10993/26042

zbMATH Keywords

probabilistic argumentationprobabilistic semanticsabstract argumentation theoryargumentation network

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Logic in artificial intelligence (68T27)

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 the initial system. In our case we translate argumentation into classical propositional logic and get probabilistic argumentation from the translation. Of course what we get depends on how we translate. In fact, in this paper we introduce probabilistic semantics to abstract argumentation theory based on the equational approach to argumentation networks. We then compare our semantics with existing proposals in the literature including the approaches by M. Thimm and by A. Hunter. Our methodology in general is discussed in the conclusion.

Recommendations

• Probabilities on extensions in abstract argumentation
• Probabilistic argumentation systems
• Abstract argumentation with Markov networks
• Change in abstract argumentation frameworks: adding an argument
• Probabilistic argumentation

Cites work

• scientific article; zbMATH DE number 5728686 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• A logical account of formal argumentation
• A numerical approach to the merging of argumentation networks
• A probabilistic approach to modelling uncertain logical arguments
• A probabilistic semantics for abstract argumentation
• The Uncertain Reasoner&#39;s Companion

Cited in

(12)

• Probabilistic argumentation
• Probabilistic argumentation systems: a new perspective on the dempster-shafer theory
• Dialectical Proof Procedures for Probabilistic Abstract Argumentation
• Revealed preference in argumentation: algorithms and applications
• Equilibrium states in numerical argumentation networks
• Syntactic reasoning with conditional probabilities in deductive argumentation
• A labelling framework for probabilistic argumentation
• Inference procedures and engine for probabilistic argumentation
• Probabilistic causal bipolar abstract argumentation: an approach based on credal networks
• scientific article; zbMATH DE number 6263433 (Why is no real title available?)
• Admissibility in Probabilistic Argumentation
• scientific article; zbMATH DE number 5586122 (Why is no real title available?)

This page was built for publication: Probabilistic argumentation: an equational approach

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