Approximating agreements in formal argumentation dialogues1

DOI10.3233/AIC-190622zbMath1464.68368OpenAlexW2969078785MaRDI QIDQ5145459

Juan Carlos Nieves

Publication date: 20 January 2021

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-190622

zbMATH Keywords

nonmonotonic reasoninglogic programmingstrategic argumentationgoal reasoningformal dialogues

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• A general framework for sound assumption-based argumentation dialogues
• Semantic-based construction of arguments: an answer set programming approach
• Computational properties of argument systems satisfying graph-theoretic constraints
• Reaching agreements through argumentation: a logical model and implementation
• An abstract, argumentation-theoretic approach to default reasoning
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• The role of self-attacking arguments in characterizations of equivalence notions
• Argument-based extended logic programming with defeasible priorities
• Coherence and Flexibility in Dialogue Games for Argumentation
• The well-founded semantics for general logic programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Properties and Complexity of Some Formal Inter-agent Dialogues
• Transformation-based bottom-up computation of the well-founded model
• Defeasible logic programming: an argumentative approach
• A general theory of confluent rewriting systems for logic programming and its applications

This page was built for publication: Approximating agreements in formal argumentation dialogues1