DC FieldValueLanguage
dc.contributor.authorTomović, Sinišaen
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorDoder, Draganen
dc.date.accessioned2020-02-18T20:06:26Z-
dc.date.available2020-02-18T20:06:26Z-
dc.date.issued2015-01-01en
dc.identifier.isbn978-3-319-20807-7en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/27-
dc.description.abstractWe introduce an epistemic logic with probabilistic common knowledge and infinitely many agents, and provide its strong completeness for the class of measurable structures.en
dc.publisherSpringer Link-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectInfinite number of agents | Probabilistic common knowledge | Probabilistic epistemic logic | Strong completenessen
dc.titleProbabilistic common knowledge among infinite number of agentsen
dc.typeConference Paperen
dc.relation.conference13th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2015; Compiègne; France; 15 July 2015 through 17 July 2015-
dc.identifier.doi10.1007/978-3-319-20807-7_45en
dc.identifier.scopus2-s2.0-84950317082en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage496-
dc.relation.lastpage505-
dc.relation.volume9161-
dc.description.rankM33-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Paper-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0002-1832-3348-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

7
checked on Jan 29, 2023

Page view(s)

29
checked on Jan 30, 2023

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.