Infinite arguments and semantics of dialectical proof procedures-Reference-Cited by-同舟云学术

Infinite arguments and semantics of dialectical proof procedures

Published:2021-06-18 Issue: Volume: Page:1-37
ISSN:1946-2174
Container-title:Argument & Computation
language:
Short-container-title:AAC

Author:

Thang Phan Minh¹,Dung Phan Minh²,Pooksook Jiraporn³

Affiliation:

1. International College of Burapha University, Burapha University, Thailand. E-mail: thangpm@gmail.com

2. Department of ICT, Asian Institute of Technology, Thailand. E-mail: dung.phanminh@gmail.com

3. Department of Electrical and Computer Engineering, Naresuan University, Thailand. E-mail: jirapornpook@nu.ac.th

Abstract

We study the semantics of dialectical proof procedures. As dialectical proof procedures are in general sound but not complete wrt admissibility semantics, a natural question here is whether we could give a more precise semantical characterization of what they compute. Based on a new notion of infinite arguments representing (possibly infinite) loops, we introduce a stricter notion of admissibility, referred to as strict admissibility, and show that dialectical proof procedures are in general sound and complete wrt strict admissibility.

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Mathematics,Computer Science Applications,Linguistics and Language

Reference37 articles.

1. Logical argumentation by dynamic proof systems;Arieli;Theoretical Computer Science,2019

2. P. Baroni, F. Cerutti, M. Giacomin and G. Simari (eds), Proceedings of Conference on Computational Models of Arguments, IOS Press, 2010.

3. P. Besnard, S. Doutre and A. Hunter (eds), Proceedings of Conference on Computational Models of Arguments Computational Models of Arguments, IOS Press, 2008.

4. Multiset theory;Blizard;Notre Dame Journal of Formal Logic,1988

5. An abstract, argumentation-theoretic approach to default reasoning;Bondarenko;Artif. Intell.,1997