Proof Theory for Distributed Knowledge

作者: Raul Hakli , Sara Negri

DOI: 10.1007/978-3-540-88833-8_6

关键词:

摘要: The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. A proposition within a group G if follows from the totality what individual members know. There are known axiomatizations logics operator, but apparently no cut-free system such has yet been presented. Gentzen-style contraction-free sequent calculus propositional given, and cut-elimination theorem proved. Examples reasoning about that use given.

参考文章(21)
W. Van der Hoek, J. J. Meyer, A Complete Epistemic Logic for Multiple Agents Springer, Boston, MA. pp. 35- 68 ,(1997) , 10.1007/978-1-4613-1139-3_2
Wiebe van der Hoek, John-Jules Ch. Meyer, Epistemic logic for AI and computer science ,(1995)
Wiebe van der Hoek, Logical foundations of agent-based computing european agent systems summer school. pp. 50- 73 ,(2001) , 10.1007/3-540-47745-4_3
Jan von Plato, Aarne Ranta, Sara Negri, Structural proof theory ,(2001)
Chiara Ghidini, Luciano Serafini, A Context-Based Logic for Distributed Knowledge Representation and Reasoning Contexts. pp. 159- 172 ,(1999) , 10.1007/3-540-48315-2_13
Wiebe van der Hoek, Bernd van Linder, John-Jules Meyer, Group knowledge is not always distributed (neither is it always implicit) Mathematical Social Sciences. ,vol. 38, pp. 215- 240 ,(1999) , 10.1016/S0165-4896(99)00013-X
Laurence Cholvy, Christophe Garion, Answering Queries Addressed to Several Databases According to a Majority Merging Approach intelligent information systems. ,vol. 22, pp. 175- 201 ,(2004) , 10.1023/B:JIIS.0000012469.11873.BB
Sara Negri, Proof Analysis in Modal Logic Journal of Philosophical Logic. ,vol. 34, pp. 507- 544 ,(2005) , 10.1007/S10992-005-2267-3