An approach to characterize graded entailment of arguments through a label-based framework

DOI10.1016/J.IJAR.2016.12.016MaRDI QIDQ511660zbMATH OpenOpenAlexFDO

Authors Maximiliano C. D. Budán, Gerardo Simari, Guillermo R. Simari, Ignacio D. Viglizzo

Publication date 22 February 2017

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

Full work available at URL https://arxiv.org/abs/1903.01865

zbMATH Keywords

uncertain reasoningargumentation systemsfuzzy valuations range

Mathematics Subject Classification ID

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

Abstract: Argumentation theory is a powerful paradigm that formalizes a type of commonsense reasoning that aims to simulate the human ability to resolve a specific problem in an intelligent manner. A classical argumentation process takes into account only the properties related to the intrinsic logical soundness of an argument in order to determine its acceptability status. However, these properties are not always the only ones that matter to establish the argument's acceptability---there exist other qualities, such as strength, weight, social votes, trust degree, relevance level, and certainty degree, among others.

Recommendations

• A labeled argumentation framework
• An AIF-based labeled argumentation framework
• Labeled Bipolar Argumentation Frameworks
• On the graded acceptability of arguments in abstract and instantiated argumentation
• Probabilistic reasoning with abstract argumentation frameworks

Cites work

• scientific article; zbMATH DE number 3174816 (Why is no real title available?)
• scientific article; zbMATH DE number 3763899 (Why is no real title available?)
• scientific article; zbMATH DE number 3779281 (Why is no real title available?)
• scientific article; zbMATH DE number 3480512 (Why is no real title available?)
• scientific article; zbMATH DE number 1213313 (Why is no real title available?)
• scientific article; zbMATH DE number 510780 (Why is no real title available?)
• scientific article; zbMATH DE number 1999060 (Why is no real title available?)
• scientific article; zbMATH DE number 1531964 (Why is no real title available?)
• scientific article; zbMATH DE number 932649 (Why is no real title available?)
• scientific article; zbMATH DE number 2243383 (Why is no real title available?)
• scientific article; zbMATH DE number 3194149 (Why is no real title available?)
• A CLASS OF FUZZY MEASURES BASED ON TRIANGULAR NORMS A general framework for the combination of uncertain information
• A labeled argumentation framework
• A logic programming framework for possibilistic argumentation: Formalization and logical properties
• A logic-based theory of deductive arguments
• A new polynomial-time algorithm for linear programming
• A numerical approach to the merging of argumentation networks
• A probabilistic approach to modelling uncertain logical arguments
• A probabilistic semantics for abstract argumentation
• A quantitative approach to belief revision in structured probabilistic argumentation
• A review of fuzzy set aggregation connectives
• Argument-based applications to knowledge engineering
• Argument-based extended logic programming with defeasible priorities
• Belief revision in structured probabilistic argumentation, model and application to cyber security
• ENTROPY AND SPECIFICITY IN A MATHEMATICAL THEORY OF EVIDENCE
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
• Fuzzy Argumentation for Trust
• Fuzzy argumentation system for decision support
• Fuzzy sets
• Introducing the Logic and Law Corner
• Many valued topology and its applications
• Modeling time and valuation in structured argumentation frameworks
• Modelling argument accrual with possibilistic uncertainty in a logic programming setting
• On logical specifications of the Argument Interchange Format
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the complexity of probabilistic abstract argumentation frameworks
• Polynomial algorithms in linear programming
• Preference-based argumentation: arguments supporting multiple values
• Probabilistic argumentation systems
• Robust semantics for argumentation frameworks
• SOFSEM 2004: Theory and Practice of Computer Science
• Solving semantic problems with odd-length cycles in argumentation
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Towards a unified theory of imprecise probability
• Weighted argument systems: basic definitions, algorithms, and complexity results

Cited in

(8)

• On labelling statements in multi-labeling argumentation
• Graded labellings for abstract argumentation
• Fuzzy labeling semantics for quantitative argumentation
• Modelling inference in argumentation through labelled deduction: formalization and logical properties
• On the study of acceptability in weighted argumentation frameworks through four-state labelling semantics
• Connecting fuzzy logic and argumentation frames via logical attack principles
• An AIF-based labeled argumentation framework
• Proximity semantics for topic-based abstract argumentation

This page was built for publication: An approach to characterize graded entailment of arguments through a label-based framework

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