The phrase "argumentation framework" is correct and usable in written English.
It can be used in contexts related to logic, reasoning, or discussions about how arguments are structured and evaluated.
Example: "In our analysis, we will utilize an argumentation framework to assess the validity of the claims presented."
Alternatives: "argument structure" or "reasoning framework".
Due to the dynamics of underlying theories, argument construction is not a monotonic process, which is different from the existing argumentation framework where arguments are constructed incrementally.
This gives rise to a directed graph, the abstract argumentation framework, where arguments are nodes and arrows represent the attack relation.
In this work we try to overcome this substantial process by providing a method to compute accepted arguments from an argumentation framework.
A Dung argumentation framework is instantiated by arguments and a binary conflict based attack relation, defined by some underlying logical theory.
The status of arguments in the unaffected sub-framework remains unchanged, while the status of the affected arguments is computed in a special argumentation framework (called a conditioned argumentation framework, or briefly CAF) that is composed of an affected part and a conditioning part.
In this argumentation framework, the semantics of acceptance plays a fundamental role in the argument evaluation process.
Thus, our dialogues can be seen as a distributed mechanism for successfully determining acceptability of claims (with respect to the semantics considered), while constructing argumentation frameworks and arguments for these claims.
To address this problem we introduce a semi-structured formalism for argumentation, called LAF-ensembles, capturing a set of essential features of structured arguments and define a class of set based argumentation frameworks appropriate to support a semantic assessment of arguments for LAF-ensembles.
We introduce the formalization of argumentation frameworks in terms of CSPs, where the arguments of the given framework represent the variables of the CSP with domains of 0 and 1.
In fact, abstract argumentation frameworks are just directed graphs where vertices play the role of arguments and edges indicate a certain conflict between the two connected arguments.
We analyse the computational complexity of the recently proposed ideal semantics within both abstract argumentation frameworks (afs) and assumption-based argumentation frameworks (abfs).
