论文信息 - Modal Provability Foundations for Argumentation Networks

Modal Provability Foundations for Argumentation Networks

Given an argumentation network we associate with it a modal formula representing the ‘logical content’ of the network. We show a one-to-one correspondence between all possible complete Caminada labellings of the network and all possible models of the formula.

Dov M. Gabbay | D. Gabbay

[1] Dov M. Gabbay,et al. Investigations in modal and tense logics with applications to problems in philosophy and linguistics , 1976 .

[2] Dov M. Gabbay,et al. Analysis and Synthesis of Logics , 2008 .

[3] R. Solovay. Provability interpretations of modal logic , 1976 .

[4] Teodor C. Przymusinski. The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[5] Martin Wigbertus Antonius Caminada. A Gentle Introduction to Argumentation Semantics , 2008 .

[6] Dov M. Gabbay,et al. Temporal Dynamics of Support and Attack Networks: From Argumentation to Zoology , 2005, Mechanizing Mathematical Reasoning.

[7] Phan Minh Dung,et al. On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[8] Dov M. Gabbay,et al. Modal Provability Foundations for Negation by Failure , 1991, ELP.

[9] G. Boolos. The logic of provability , 1993 .

[10] Phan Minh Dung,et al. An Argumentation-Theoretic Foundations for Logic Programming , 1995, J. Log. Program..