Compiling Arguments in an Argumentation Framework into Three-valued Logical Expressions
In this paper, we propose a new method for computing general allocators directly from completeness conditions. A general allocator is an abstraction of all complete labelings for an argumentation framework. Any complete labeling is obtained from a general allocator by assigning logical constants to variables. We proved the existence of the general allocators in our previous work. However, the construction requires us to enumerate all complete labelings for the framework, which makes the computation prohibitively slow. The method proposed in this paper enables us to compute general allocators without enumerating complete labelings. It also provides the solutions of local allocation that yield semantics for subsets of the framework. We demonstrate two applications of general allocators, stability, and a new concept for frameworks, termed arity. Moreover, the method, including local allocation, is applicable to broad extensions of frameworks, such as argumentation frameworks with set-attacks, bipolar argumentation frameworks, and abstract dialectical frameworks.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Technical report of "Empirical Study on Human Evaluation of Complex Argumentation Frameworks"
In abstract argumentation, multiple argumentation semantics have been proposed that allow to select sets of jointly acceptable arguments from a given argumentation framework, i.e. based only on the attack relation betwee…
Abstract ArgumentationRelationCollective Argumentation: The Case of Aggregating Support-Relations of Bipolar Argumentation Frameworks
In many real-life situations that involve exchanges of arguments, individuals may differ on their assessment of which supports between the arguments are in fact justified, i.e., they put forward different support-relatio…
An Extension-based Approach for Computing and Verifying Preferences in Abstract Argumentation
We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets…
Abstract ArgumentationSemi-Abstract Value-Based Argumentation Framework
In his seminal paper, Phan Minh Dung (1995) proposed abstract argumentation framework, which models argumentation using directed graphs where structureless arguments are the nodes and attacks among the arguments are the …
Abstract ArgumentationA Unifying Framework for Learning Argumentation Semantics
Argumentation is a very active research field of Artificial Intelligence concerned with the representation and evaluation of arguments used in dialogues between humans and/or artificial agents. Acceptability semantics of…
Inductive logic programming