On the logic of argumentation theory

作者: Davide Grossi

DOI: 10.5555/1838206.1838264

关键词: CalculusS5Modal logicArtificial intelligenceBisimulationEquivalence (measure theory)Normal modal logicAccessibility relationProbabilistic argumentationComputer scienceMultimodal logicPhilosophy of logicArgumentation theoryDynamic logic (modal logic)

摘要: The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows import, for free, a wealth new notions (e.g., argument equivalence), techniques calculi, model-checking games, bisimulation games), and results completeness adequacy complexity model-checking) from argumentation.

参考文章(12)
E. Allen Emerson, Chin Laung Lei, EFFICIENT MODEL CHECKING IN FRAGMENTS OF THE PROPOSITIONAL MU-CALCULUS. logic in computer science. pp. 267- 278 ,(1986)
Valentin Goranko, Martin Otto, 5 Model theory of modal logic Handbook of Modal Logic. ,vol. 3, pp. 249- 329 ,(2007) , 10.1016/S1570-2464(07)80008-5
Henry Prakken, Gerard Vreeswijk, Logics for Defeasible Argumentation Springer, Dordrecht. pp. 219- 318 ,(2001) , 10.1007/978-94-017-0456-4_3
Lewis A. Kornhauser, An Ecomomic Perspective on Stare Decisis Chicago-Kent} Law Review. ,vol. 65, pp. 63- ,(1989)
Guido Boella, Joris Hulstijn, Leendert van der Torre, A Logic of Abstract Argumentation Lecture Notes in Computer Science. ,vol. 4049, pp. 29- 41 ,(2006) , 10.1007/11794578_2
Martin W. A. Caminada, Dov M. Gabbay, A Logical Account of Formal Argumentation Studia Logica. ,vol. 93, pp. 109- 145 ,(2009) , 10.1007/S11225-009-9218-X
Brian Albert Davey, Hilary Ann Priestley, Introduction to lattices and order ,(1990)
Martin Caminada, On the Issue of Reinstatement in Argumentation Logics in Artificial Intelligence. pp. 111- 123 ,(2006) , 10.1007/11853886_11
Erich Grädel, Martin Otto, On logics with two variables foundations of computer science. ,vol. 224, pp. 73- 113 ,(1999) , 10.1016/S0304-3975(98)00308-9