Credulous and Skeptical Argument Games for Complete Semantics in
  Conflict Resolution based Argumentation
  Argumentation is one of the most popular approaches of defining
a~non-monotonic formalism and several argumentation based semantics were
proposed for defeasible logic programs. Recently, a new approach based on
notions of conflict resolutions was proposed, however with declarative
semantics only. This paper gives a more procedural counterpart by developing
skeptical and credulous argument games for complete semantics and soundness and
completeness theorems for both games are provided. After that, distribution of
defeasible logic program into several contexts is investigated and both
argument games are adapted for multi-context system.
