Weighted argument systems: basic definitions, algorithms, and complexity results

DOI10.1016/j.artint.2010.09.005zbMath1216.68261OpenAlexW2160547131MaRDI QIDQ543610

Paul E. Dunne, Michael Wooldridge, Simon Parsons, Peter McBurney, Anthony Hunter

Publication date: 17 June 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.09.005

zbMATH Keywords

computational complexityargumentationhandling inconsistency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Related Items

Gödel semantics of fuzzy argumentation frameworks with consistency degrees ⋮ On Supported Inference and Extension Selection in Abstract Argumentation Frameworks ⋮ Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs ⋮ Complexity of nonemptiness in control argumentation frameworks ⋮ Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ Weighted argumentation for analysis of discussions in Twitter ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ Admissibility in Probabilistic Argumentation ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ Broadening Label-Based Argumentation Semantics with May-Must Scales ⋮ Dynamics of Fuzzy Argumentation Frameworks ⋮ CONCILIATORY REASONING, SELF-DEFEAT, AND ABSTRACT ARGUMENTATION ⋮ A novel weighted defence and its relaxation in abstract argumentation ⋮ A general approach to extension-based semantics in abstract argumentation ⋮ Value-based argumentation framework built from prioritized qualitative choice logic ⋮ A labeled argumentation framework ⋮ Taking into account ``who said what in abstract argumentation: complexity results ⋮ On incompleteness in abstract argumentation: complexity and expressiveness ⋮ Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments ⋮ Fuzzy labeling semantics for quantitative argumentation ⋮ Constrained Value-Based Argumentation Framework ⋮ Extension-based semantics for incomplete argumentation frameworks ⋮ Intrinsic argument strength in structured argumentation: a principled approach ⋮ A multi attack argumentation framework ⋮ Unnamed Item ⋮ Dynamics of argumentation systems: a division-based method ⋮ On the input/output behavior of argumentation frameworks ⋮ Editorial: Weighted logics for artificial intelligence -- an introductory discussion ⋮ Valued preference-based instantiation of argumentation frameworks with varied strength defeats ⋮ Postulates for logic-based argumentation systems ⋮ From fine-grained properties to broad principles for gradual argumentation: a principled spectrum ⋮ On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics ⋮ Introducing Equational Semantics for Argumentation Networks ⋮ An approach to characterize graded entailment of arguments through a label-based framework ⋮ Belief revision in structured probabilistic argumentation, model and application to cyber security ⋮ Proximity semantics for topic-based abstract argumentation ⋮ On the resolution-based family of abstract argumentation semantics and its grounded instance ⋮ Evaluation of arguments in weighted bipolar graphs ⋮ TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS ⋮ On the Gradual Acceptability of Arguments in Bipolar Weighted Argumentation Frameworks with Degrees of Trust ⋮ Evaluation of argument strength in attack graphs: foundations and semantics ⋮ Partial Semantics of Argumentation ⋮ Connecting fuzzy logic and argumentation frames via logical attack principles ⋮ A Relaxation of Internal Conflict and Defence in Weighted Argumentation Frameworks ⋮ Opposition Frameworks ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ On the graded acceptability of arguments in abstract and instantiated argumentation ⋮ A comprehensive study of argumentation frameworks with sets of attacking arguments ⋮ On three-valued acceptance conditions of abstract dialectical frameworks ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Graded labellings for abstract argumentation ⋮ Probabilistic qualification of attack in abstract argumentation

Uses Software

• AFRA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the resolution-based family of abstract argumentation semantics and its grounded instance
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Graph theoretical structures in logic programs and default theories
• Computing functions with parallel queries to NP
• Reasoning about preferences in argumentation frameworks
• Audiences in argumentation frameworks
• Computational properties of argument systems satisfying graph-theoretic constraints
• The computational complexity of ideal semantics
• Probabilistic Horn abduction and Bayesian networks
• Functions computable with nonadaptive queries to NP
• A reasoning model based on the production of acceptable arguments
• Inconsistency tolerance.
• Coherence in finite argument systems.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On precise and correct qualitative probabilistic inference
• Handbook of social choice and welfare. Vol. 1.
• From statistical knowledge bases to degrees of belief
• Computation in Extended Argumentation Frameworks
• Argument-based extended logic programming with defeasible priorities
• An Abstract Theory of Argumentation That Accommodates Defeasible Reasoning About Preferences
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
• Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Aggregation of Attack Relations: A Social-Choice Theoretical Analysis of Defeasibility Criteria
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Mechanizing Mathematical Reasoning

This page was built for publication: Weighted argument systems: basic definitions, algorithms, and complexity results