Possible Controllability of Control Argumentation Frameworks -- Extended\n Version

2020/09/10 by Jean-Guy Mailly, Mailly, Jean-Guy
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.2009.04903

openalex publication_date 2020/09/10 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28

Abstract

The recent Control Argumentation Framework (CAF) is a generalization of\nDung's Argumentation Framework which handles argumentation dynamics under\nuncertainty; especially it can be used to model the behavior of an agent which\ncan anticipate future changes in the environment. Here we provide new insights\non this model by defining the notion of possible controllability of a CAF. We\nstudy the complexity of this new form of reasoning for the four classical\nsemantics, and we provide a logical encoding for reasoning with this framework.\n

Citations

• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Related

• A Note on Rich Incomplete Argumentation Frameworks
• Modelling Control Arguments via Cooperation Logic in Unforeseen Scenarios
• Stability in Abstract Argumentation
• Argumentation as a General Framework for Uncertain Reasoning
• Abstract Argumentation / Persuasion / Dynamics