Abstract argumentation systems

摘要: In this paper, we develop a theory of abstract argumentation systems. An system is collection “defeasible proofs”, called arguments, that partially ordered by relation expressing the difference in conclusive force. The prefix “abstract” indicates concerned neither with specification underlying language, nor development subtheory explains partial order. unstructured without logical connectives such as negation, makes arguments not (pairwise) inconsistent, but (groupwise) incompatible. Incompatibility and force cause defeat among arguments. aim to find out which eventually emerge undefeated. These are considered be Several results established. main result precisely those limit so-called complete sequence.