投票
发表于 2025-3-26 22:43:06
http://reply.papertrans.cn/24/2327/232627/232627_31.png
勉强
发表于 2025-3-27 04:52:12
http://reply.papertrans.cn/24/2327/232627/232627_32.png
战胜
发表于 2025-3-27 06:31:58
A Modal Framework for Relating Belief and Signed Informationom a dynamic point of view as an agent receives information it adapts its belief state about signed information. Splitting the notions of beliefs and signed statement is useful for handling the underlying trust issue: an agent believes some statement because it may justify the statement’s origin and its reliability.
变色龙
发表于 2025-3-27 13:11:09
Reasoning about Joint Action and Coalitional Ability in ,, with Intersectioncomplete axiomatisation of the corresponding models, as well as a characterisation of key complexity problems. We also prove a representation theorem identifying the effectivity functions corresponding to injective games.
摘要记录
发表于 2025-3-27 16:17:22
http://reply.papertrans.cn/24/2327/232627/232627_35.png
Gastric
发表于 2025-3-27 18:20:54
978-3-642-22358-7Springer-Verlag GmbH Berlin Heidelberg 2011
Axillary
发表于 2025-3-27 22:24:15
Physiology and Metabalism of Boron in Plantsputer science in general and in multi-agent systems in particular. We then describe the setting of our work, situating it within the broad area of work on trust. Next we provide an overview of two lines of work we are currently pursuing — using argumentation to reason about which individuals to trus
escalate
发表于 2025-3-28 05:38:27
Gonzalo Caballero,Xosé Carlos Ariasefinition is inspired from Cognitive Science and it is seen as a truster’s belief in some trustee’s properties which are called: sincerity, competence, vigilance, cooperativity, validity and completeness. These definitions are formalized in Modal Logic and it is shown that even if trust, in that sen
PET-scan
发表于 2025-3-28 09:41:31
http://reply.papertrans.cn/24/2327/232627/232627_39.png
极大的痛苦
发表于 2025-3-28 10:49:16
Evan Schnidman,Norman Schofield show that there does not exist a protocol of two steps for the four-card players to inform each other safely of their hands of cards, and we then present a protocol of three steps that achieves that goal. We verify the properties of that protocol by combinatorial and, mainly, logical (model checkin