Logical limits of abstract argumentation frameworks
From MaRDI portal
Publication:4583317
DOI10.1080/11663081.2013.830381zbMath1400.68201OpenAlexW1979409532MaRDI QIDQ4583317
Leila Amgoud, Philippe Besnard
Publication date: 28 August 2018
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/11663081.2013.830381
Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items
Dialogue Games for Argumentation Frameworks with Necessities ⋮ Similarity measures based on compiled arguments ⋮ An argumentation system for defeasible reasoning ⋮ When is argumentation deductive? ⋮ A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness ⋮ Simple contrapositive assumption-based argumentation frameworks ⋮ A postulate-driven study of logical argumentation ⋮ Base argumentation as an abstraction of deductive argumentation ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ A Comparative Study of Some Central Notions of ASPIC+ and DeLP ⋮ A review of the relations between logical argumentation and reasoning with maximal consistency ⋮ Evaluation of argument strength in attack graphs: foundations and semantics ⋮ Simple contrapositive assumption-based argumentation. II: Reasoning with preferences ⋮ Complexity of abstract argumentation under a claim-centric view
Cites Work
- Postulates for logic-based argumentation systems
- Instantiating abstract argumentation with classical logic arguments: postulates and properties
- Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. I: The flat case
- Using arguments for making and explaining decisions
- A mathematical treatment of defeasible reasoning and its implementation.
- On the evaluation of argumentation formalisms
- Computing ideal sceptical argumentation
- Argument based machine learning
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Inferring from inconsistency in preference-based argumentation frameworks
- On inference from inconsistent premisses
- Argument-based extended logic programming with defeasible priorities
- On the Issue of Reinstatement in Argumentation
- Properties and Complexity of Some Formal Inter-agent Dialogues
- Argumentation Semantics for Defeasible Logic
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
