Computing ideal sceptical argumentation

DOI10.1016/J.ARTINT.2007.05.003zbMath1168.68564OpenAlexW1965296062MaRDI QIDQ1028947

Paolo Mancarella, Francesca Toni, Phan Minh Dung

Publication date: 9 July 2009

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

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

zbMATH Keywords

abstract argumentation assumption-based argumentation dispute ideal semantics proof procedure

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (73)

On Supported Inference and Extension Selection in Abstract Argumentation Frameworks ⋮ Looking-ahead in backtracking algorithms for abstract argumentation ⋮ Arguing about informant credibility in open multi-agent systems ⋮ Conflict-Tolerant Semantics for Argumentation Frameworks ⋮ Toward incremental computation of argumentation semantics: a decomposition-based approach ⋮ Labellings for assumption-based and abstract argumentation ⋮ Weighted argumentation for analysis of discussions in Twitter ⋮ Inference procedures and engine for probabilistic argumentation ⋮ Logical limits of abstract argumentation frameworks ⋮ Equivalence in logic-based argumentation ⋮ Forecasting with jury-based probabilistic argumentation ⋮ Improved answer-set programming encodings for abstract argumentation ⋮ Justifying answer sets using argumentation ⋮ Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ A general approach to extension-based semantics in abstract argumentation ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ An approach to abstract argumentation with recursive attack and support ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ A definition of sceptical semantics in the constellations approach ⋮ Collective argumentation with topological restrictions ⋮ Flexible dispute derivations with forward and backward arguments for assumption-based argumentation ⋮ Explanations of non-monotonic inference in admissibility-based abstract argumentation ⋮ Base argumentation as an abstraction of deductive argumentation ⋮ An argumentative dialogue system for COVID-19 vaccine information ⋮ Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations ⋮ Unnamed Item ⋮ Abstract argumentation and explanation applied to scientific debates ⋮ Instantiating abstract argumentation with classical logic arguments: postulates and properties ⋮ Dynamics of argumentation systems: a division-based method ⋮ A general framework for sound assumption-based argumentation dialogues ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ Postulates for logic-based argumentation systems ⋮ Preferences and Assumption-Based Argumentation for Conflict-Free Normative Agents ⋮ An extension-based approach to belief revision in abstract argumentation ⋮ On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Algorithms for decision problems in argument systems under preferred semantics ⋮ Revealed preference in argumentation: algorithms and applications ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets ⋮ Reasoning on the Web with Assumption-Based Argumentation ⋮ Argumentation frameworks as constraint satisfaction problems ⋮ Towards fixed-parameter tractable algorithms for abstract argumentation ⋮ Judgment Aggregation in Abstract Dialectical Frameworks ⋮ Open Problems in Abstract Argumentation ⋮ Complete extensions in argumentation coincide with 3-valued stable models in logic programming ⋮ Meta-argumentation modelling. I: Methodology and techniques ⋮ A logical account of formal argumentation ⋮ Evaluation of arguments in weighted bipolar graphs ⋮ Assumption-Based Argumentation for Selection and Composition of Services ⋮ Design and results of the second international competition on computational models of argumentation ⋮ Reasoning about Exceptions to Contracts ⋮ Partial Semantics of Argumentation ⋮ Argumentation in artificial intelligence ⋮ Handling controversial arguments ⋮ Ensuring reference independence and cautious monotony in abstract argumentation ⋮ A new approach for preference-based argumentation frameworks ⋮ A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks ⋮ The computational complexity of ideal semantics ⋮ A comprehensive study of argumentation frameworks with sets of attacking arguments ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Assumption-based argumentation for extended disjunctive logic programming ⋮ Graded labellings for abstract argumentation ⋮ Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence ⋮ Intertranslatability of Labeling-Based Argumentation Semantics ⋮ Argument graphs and assumption-based argumentation ⋮ Probabilistic qualification of attack in abstract argumentation

Cites Work

This page was built for publication: Computing ideal sceptical argumentation