Labellings on DFup Sample Clauses

Labellings on DFup. ‌ We now introduce a complete labelling function on a dialogue framework DFup that eval- uates the dialogical status of a move; in Section 4.3.1 we show that this evaluation is sound and complete with reference to the argument framework AF instantiated from the contents of all the moves made during the dialogue, under the complete semantics. That is to say, an argument moved in the dialogue is judged to be winning in the dialogue un- der Dung’s complete semantics if and only if the claim of the corresponding argument is justified (under Xxxx’s complete semantics) in the AF instantiated from the contents of the moves of the dialogue. Notice that our labelling (and its purpose) is similar to Prakken’s labelling in [67], which he uses to draw conclusions regarding the acceptability of the dialogue’s topic (and therefore evaluate the status of the dialogue) by examining only the dialogue graph (which corresponds to our dialogue framework DFup). He then justifies his results by showing soundness and completeness in relation to the status of the arguments that can be constructed from the contents of the moves made in his dialogue, like we do in this thesis. In Sections 4.3.2, 4.3.3 and 4.3.4 we show the correspondence described above under the grounded, preferred and stable semantics, respectively. We define a complete labelling function on a dialogue framework DFup = ⟨Mup, Tup, Repup, Supup⟩ such that the label of a move mup ∈ Mup is IN if and only if (a) for every move mup that targets or replies to mup, mup is labelled OUT; and (b) if mup supports j i j i a move mup and there is a move mup targeting mup, then for every such move mup, mup