Page 227 - Artificial Intelligence for the Internet of Everything

208 Artificial Intelligence for the Internet of Everything

Fig. 11.6 Dialectical tree for target claim rent_receipt.

repair_is_done),
(repair_is_done -< rent_is_requsted)}, a proper defeater, and <C 2 ,
┐repair_is_done >, where C 2 ¼{(┐repair_is_done -< repair_is_requested)} is

a blocking defeater. Hence one of these lines is further split into two; C 1
has a blocking defeater that can be introduced in the line
<D 1 , ┐repair_is_done >, where D 1 ¼ <{(┐repair_is_done -< stay_unre-
paired)}.D 1 and C 2 have a blocking defeater, but they cannot be introduced
because they make the argumentation line unacceptable. Hence the state ren-
t_receipt cannot be reached, as the argument supporting the literal rent_receipt
is not warranted. The dialectical tree for A is shown in Fig. 11.6.
Having shown how to build a dialectic tree, we are now ready to outline
the algorithm for validation of the domain-specific claim for arguments
extracted from text:
1. Build a DT from input text;
2. Attach communicative actions to its edges to form CDT;
3. Extract subjects of communicative actions attached to CDT and add to
“Facts” section;
4. Extract the arguments for rhetoric relation contrast and communicative
actions of the class disagree and add to “Clauses Extracted FromText”
section;
5. Add a domain-specific section to DeLP; and
6. Having the DeLP formed, build a dialectical tree and assess the claim.
We use the Tweety (2016) system for DeLP implementation (Thimm, 2014).