|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Probabilistic common knowledge among infinite number of agents||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||9161||First page:||496||Last page:||505||Conference:||13th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2015; Compiègne; France; 15 July 2015 through 17 July 2015||Issue Date:||1-Jan-2015||Rank:||M33||ISBN:||978-3-319-20807-7||ISSN:||0302-9743||DOI:||10.1007/978-3-319-20807-7_45||Abstract:||
We introduce an epistemic logic with probabilistic common knowledge and infinitely many agents, and provide its strong completeness for the class of measurable structures.
|Keywords:||Infinite number of agents | Probabilistic common knowledge | Probabilistic epistemic logic | Strong completeness||Publisher:||Springer Link|
Show full item record
checked on Mar 22, 2023
checked on Mar 23, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.