Reference : KE Tableaux for Public Announcement Logic |
Scientific congresses, symposiums and conference proceedings : Unpublished conference | |||
Engineering, computing & technology : Multidisciplinary, general & others | |||
http://hdl.handle.net/10993/16108 | |||
KE Tableaux for Public Announcement Logic | |
English | |
de Boer, Mathijs [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >] | |
6-Sep-2007 | |
12 | |
No | |
Formal Approaches to Multi-Agent Systems Workshop (FAMAS'007) | |
September 2007 | |
Durham | |
United Kingdom | |
[en] Public announcement logic ; epistemic logic ; KE ; semantic tableaux | |
[en] Public announcement logic (PAL) is a simple dynamic epistemic logic extending reasoning about knowledge of agents with a modal operator for simultaneous and transparent knowledge updates. This logic is no more expressive than epistemic logic (EL) without updates, but exhibits
compact representation of a number of complex epistemic situations. A labeled tableau proof system to reason with these updates directly is presented here. This system can analyse and present well-known epistemic puzzles like `muddy children' and `three wise men'. Using the KE tableau system as a basis, the modal and propositional characteristics of epistemic updates can be separated. | |
http://hdl.handle.net/10993/16108 |
File(s) associated to this reference | ||||||||||||||
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.