Approximating agreements in formal argumentation dialogues

DOI10.3233/AIC-190622MaRDI QIDQ5145459zbMATH OpenOpenAlexFDO

Authors 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

formal dialoguesgoal reasoninglogic programmingnonmonotonic reasoningstrategic argumentation

Mathematics Subject Classification ID

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

Recommendations

• Rough Sets and Current Trends in Computing
• Towards a general framework for dialogues that accommodate reasoning about preferences
• Formal Handling of Threats and Rewards in a Negotiation Dialogue
• A general framework for sound assumption-based argumentation dialogues
• Strategic dialogical argumentation using multi-criteria decision making with application to epistemic and emotional aspects of arguments

Cites work

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

Cited in

(1)

• Concept Lattices

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

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