DUCE
发表于 2025-3-30 08:33:48
http://reply.papertrans.cn/59/5881/588082/588082_51.png
Interstellar
发表于 2025-3-30 14:56:40
http://reply.papertrans.cn/59/5881/588082/588082_52.png
Benign
发表于 2025-3-30 18:41:26
http://reply.papertrans.cn/59/5881/588082/588082_53.png
一大块
发表于 2025-3-30 22:17:19
http://reply.papertrans.cn/59/5881/588082/588082_54.png
PAD416
发表于 2025-3-31 03:57:56
A General Family of Preferential Belief Removal Operatorsn . However it is not always reasonable to assume completeness of the underlying ordering. In this paper we generalise the structure of to allow incomparabilities between worlds. We axiomatise the resulting class of belief removal functions, and show that it includes an important family of removal functions based on ..
吹牛者
发表于 2025-3-31 05:27:53
Dynamic Testimonial Logiciefs about the . of other agents, we add “authority graphs” to DTL models to capture agents’ . in other agents’ testimony. For DTL’s dynamic testimony operator, we give complete reduction axioms. Finally, we describe an application of DTL in modeling ..
Fraudulent
发表于 2025-3-31 12:06:03
From the Logical Point of View: The Chain Store Paradox Revisitedties take only the values 1 and 0, requiring a non-Bayesian account of belief revision. In this paper, we propose a situation-theoretic diagnosis and solution to the paradox, based on the conception of Austinian propositions relativized to particular situations, as developed by Barwise and Etchemendy.
gout109
发表于 2025-3-31 17:02:28
http://reply.papertrans.cn/59/5881/588082/588082_58.png
荣幸
发表于 2025-3-31 19:20:05
Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences All Togetherudy in . the epistemic and rationality conditions of some classical solution concepts like Nash equilibrium and iterated strict dominance. In the last part of the paper we combine . with Dynamic Epistemic Logic (DEL) in order to model epistemic game dynamics.
哄骗
发表于 2025-3-31 22:25:27
An Epistemic Logic for Planning with Trialsseem well suited to formalize the reasoning in such contexts. We study a simple such logic for one planning agent making bounded plans, for which we give a complete axiomatization and prove decidability. We discuss preliminary results for extensions to multi-agent plans as well as unbounded plans.