作者: Gerard A. W. Vreeswijk
DOI:
关键词:
摘要: This paper presents a query-answering algorithm to compute minimal lines of defence around an individual argument. The returns all such sets together with indication whether the is grounded or admissible. For every argument encountered in search process further indicates that IN, OUT, UNDEC (undecided) according semantics. presentation followed by correctness proof and complexity analysis other than worst cases. already functional visualization tools.