顽固
发表于 2025-3-23 13:05:22
Evan Schnidman,Norman Schofieldsent a protocol of three steps that achieves that goal. We verify the properties of that protocol by combinatorial and, mainly, logical (model checking) means. No such three-step protocol for cards was known. The method can be generalized. This will advance the characterization of card deals for which such exchanges of secrets are possible.
眼界
发表于 2025-3-23 16:47:25
Bowen Li,Shefford P. Baker,Ruigang Wangorithms known from the literature, our algorithm can be used for automated program synthesis for systems in which agents are required to be homogeneous (i.e., every agent has to follow the same strategy), which is a more restrictive setting.
耕种
发表于 2025-3-23 18:51:39
http://reply.papertrans.cn/24/2327/232627/232627_13.png
勉励
发表于 2025-3-23 23:13:47
http://reply.papertrans.cn/24/2327/232627/232627_14.png
Femish
发表于 2025-3-24 05:57:59
Transitivity and Propagation of Trust in Information Sources: An Analysis in Modal Logic, vigilance, cooperativity, validity and completeness. These definitions are formalized in Modal Logic and it is shown that even if trust, in that sense, is not transitive, we can find interesting sufficient conditions based on trust that guarantee that the truth of an information is propagated along a chain of information sources.
暂时别动
发表于 2025-3-24 07:58:12
Three Stepssent a protocol of three steps that achieves that goal. We verify the properties of that protocol by combinatorial and, mainly, logical (model checking) means. No such three-step protocol for cards was known. The method can be generalized. This will advance the characterization of card deals for which such exchanges of secrets are possible.
说笑
发表于 2025-3-24 10:44:39
http://reply.papertrans.cn/24/2327/232627/232627_17.png
为现场
发表于 2025-3-24 17:41:41
http://reply.papertrans.cn/24/2327/232627/232627_18.png
领带
发表于 2025-3-24 21:00:02
http://reply.papertrans.cn/24/2327/232627/232627_19.png
fidelity
发表于 2025-3-25 02:57:09
Olga Shvetsova,Katri K. Siebergnondeducibility. This work studies properties expressible through functional dependence. The main result is a complete and decidable logical system that describes interdependencies on a fixed hypergraph.