標題: Titlebook: Dynamic Logic. New Trends and Applications; Third International Manuel A. Martins,Igor Sedlár Conference proceedings 2020 Springer Nature [打印本頁] 作者: 作業(yè) 時間: 2025-3-21 18:56
書目名稱Dynamic Logic. New Trends and Applications影響因子(影響力)
書目名稱Dynamic Logic. New Trends and Applications影響因子(影響力)學科排名
書目名稱Dynamic Logic. New Trends and Applications網(wǎng)絡公開度
書目名稱Dynamic Logic. New Trends and Applications網(wǎng)絡公開度學科排名
書目名稱Dynamic Logic. New Trends and Applications被引頻次
書目名稱Dynamic Logic. New Trends and Applications被引頻次學科排名
書目名稱Dynamic Logic. New Trends and Applications年度引用
書目名稱Dynamic Logic. New Trends and Applications年度引用學科排名
書目名稱Dynamic Logic. New Trends and Applications讀者反饋
書目名稱Dynamic Logic. New Trends and Applications讀者反饋學科排名
作者: Mumble 時間: 2025-3-21 21:08
Thinking About Causation: A Causal Language with Epistemic Operators,he notion of a causal model [., ., ., .] with a representation of the epistemic state of an agent. On the side of the object language, we add operators to express knowledge and the act of observing new information. We provide a sound and complete axiomatization of the logic, and discuss the relation作者: flimsy 時間: 2025-3-22 03:20 作者: 同時發(fā)生 時間: 2025-3-22 08:32
Dealing with Unreliable Agents in Dynamic Gossip,ntly make peer-to-peer calls so that ultimately everyone knows all secrets. In Dynamic Gossip, agents share phone numbers in addition to secrets, which allows the network to grow at run-time..Most gossip protocols assume that all agents are reliable, but this is not given for many practical applicat作者: 古董 時間: 2025-3-22 09:17 作者: 死亡 時間: 2025-3-22 13:35
Parameterized Complexity of Dynamic Belief Updates,ns on an initial epistemic model. It can also be considered as a plan verification problem in epistemic planning. The problem is known to be PSPACE-hard. To better understand the source of complexity of the problem, previous research has investigated the complexity of 128 parameterized versions of t作者: 死亡 時間: 2025-3-22 21:06 作者: 以煙熏消毒 時間: 2025-3-23 00:12 作者: heckle 時間: 2025-3-23 01:38 作者: Parallel 時間: 2025-3-23 07:59
Complexity of Commutative Infinitary Action Logic,ility problem is .-complete. Thus, we obtain a commutative version of .-completeness for non-commutative infinitary action logic by Buszkowski and Palka (2007). The proof of the upper bound is more or less the same as Palka’s argument. For the lower bound, we encode non-terminating behaviour of two-作者: 圓柱 時間: 2025-3-23 13:11 作者: 死亡率 時間: 2025-3-23 14:39
Ecumenical Modal Logic,d, recently Prawitz and others have been discussing the so called ecumenical Systems, where connectives from these logics can co-exist in peace. In Prawitz’ system, the classical logician and the intuitionistic logician would share the universal quantifier, conjunction, negation, and the constant fo作者: 保存 時間: 2025-3-23 18:39 作者: 失望未來 時間: 2025-3-24 01:55 作者: 嬉耍 時間: 2025-3-24 06:15
Bounded Multi-agent Reasoning: Actualizing Distributed Knowledge,e, . (DK) is often taken to reflect the potential knowledge of a group: what agents . know if they had unbounded means of communication and deductive ability. However, this does not specify whether/how this potential can be actualized, especially since real people are not unbounded reasoners. Inspir作者: rods366 時間: 2025-3-24 09:37
Simpler Completeness Proofs for Modal Logics with Intersection,nowledge, propositional dynamic logic with intersection, and description logics with concept intersection. Completeness proofs for such logics tend to be complicated, in particular on model classes such as S5 used, e.g., in standard epistemic logic, mainly due to the undefinability of intersection o作者: 盡忠 時間: 2025-3-24 14:45 作者: Alveolar-Bone 時間: 2025-3-24 18:48 作者: climax 時間: 2025-3-24 21:54 作者: 表示向前 時間: 2025-3-24 23:21
Alan V. Stewart,Nicholas W. Ellisonnot initiate communication are harder to identify than agents that do. This has paradoxical consequences for measures against unreliability, for example to combat the spread of fake news in social networks.作者: avarice 時間: 2025-3-25 06:43
M. B. Ratnaparkhe,R. J. Singh,J. J. Doylein the processes of unraveling and folding. We illustrate the technique by showing completeness of the normal modal logics K, D, T, B, S4 and S5 extended with intersection modalities. Furthermore, these treelike canonical models are compatible with Fischer-Ladner-style closures, and we combine the m作者: 指耕作 時間: 2025-3-25 08:15 作者: 法律的瑕疵 時間: 2025-3-25 15:05
H. D. Upadhyaya,Shivali Sharma,S. L. Dwivediraic treatment of default logics concludes with an algebraic completeness result. To our knowledge, our approach is novel, and it lays the groundwork for studying default logics from a dynamic logic perspective.作者: 征兵 時間: 2025-3-25 18:54
John A. Bryant,Stephen G. Hughesd as bounded morphisms. This alternative semantics leads us to a semantic completeness proof of the axiomatization for the original semantics, which does not require a reduction strategy based on recursion axioms.作者: Lyme-disease 時間: 2025-3-25 20:46 作者: Lethargic 時間: 2025-3-26 03:47 作者: irreducible 時間: 2025-3-26 06:18
Parameterized Complexity of Dynamic Belief Updates,us research left a few combinations as open problems. In this paper, we solve most of the remaining open problems by proving all of them to be fixed-parameter intractable. Only two parameter combinations are still left as open problem for future research.作者: Verify 時間: 2025-3-26 09:58
Default Modal Systems as Algebraic Updates,raic treatment of default logics concludes with an algebraic completeness result. To our knowledge, our approach is novel, and it lays the groundwork for studying default logics from a dynamic logic perspective.作者: 泄露 時間: 2025-3-26 16:28
Constructive Dynamic Logic of Relation Changers,d as bounded morphisms. This alternative semantics leads us to a semantic completeness proof of the axiomatization for the original semantics, which does not require a reduction strategy based on recursion axioms.作者: BUCK 時間: 2025-3-26 17:35 作者: 學術討論會 時間: 2025-3-26 22:47
Public Announcement Logic in HOL,l embedding of normal modal logics—is that evaluation domains are modeled explicitly and treated as additional parameter in the encodings of the constituents of the embedded target logic, while they were previously implicitly shared between meta logic and target logic.作者: Wordlist 時間: 2025-3-27 01:50 作者: Laconic 時間: 2025-3-27 06:06 作者: amputation 時間: 2025-3-27 11:08
0302-9743 tober 2020. Due to COVID-19 the workshop has been held online. .The 17 full papers presented together with 6 short papers were carefully reviewed and selected from 31 submissions...The theoretical relevance and practical potential of dynamic logic is a topic of interest in a number of scientific ven作者: TERRA 時間: 2025-3-27 14:53
H. D. Upadhyaya,Shivali Sharma,S. L. Dwivedif either. Here, we present a model based on a lattice of Kripke models, induced by atom subset inclusion, in which uncertainty and unawareness are separate. We show the models to be equivalent by defining transformations between them which preserve formula satisfaction, and obtain completeness through our and HMS’ results.作者: 拾落穗 時間: 2025-3-27 19:55 作者: ANTE 時間: 2025-3-27 23:40 作者: capsule 時間: 2025-3-28 03:45 作者: 修剪過的樹籬 時間: 2025-3-28 09:14 作者: 預感 時間: 2025-3-28 13:11
Expressivity of Some Versions of APAL, FSAPAL and SCAPAL; and another version quantifying over all announcements implied by or implying a given formula: IPAL. We then determine the relative expressivity of these logics and APAL. The IPAL quantifier promises to provide a novel perspective on substructural implication as dynamic consequence.作者: Supplement 時間: 2025-3-28 16:14
Allison M. Gurung,Edwin C. K. Pangecludes to study this kind of update. We provide a logical analysis of updates without this assumption. It leads us to identify a graph structure for events based on their relative dependence of occurence and to introduce a generic product update. The DEL product update is a specific instance of this generic product update.作者: 同步信息 時間: 2025-3-28 19:46 作者: musicologist 時間: 2025-3-29 00:32 作者: Medicaid 時間: 2025-3-29 04:34
M. B. Ratnaparkhe,R. J. Singh,J. J. Doylen the study of the dynamics of knowledge and belief. We combine these two directions by interpreting such modalities in social networks. We study the resulting logic, and provide a sound and strongly complete (infinitary) axiomatisation.作者: 虛度 時間: 2025-3-29 09:33 作者: AMBI 時間: 2025-3-29 15:12
Ecumenical Modal Logic,r the absurd, but they would each have their own existential quantifier, disjunction, and implication, with different meanings. Prawitz’ main idea is that these different meanings are given by a semantical framework that can be accepted by both parties. In this work we extend Prawitz’ ecumenical idea to alethic .-modalities.作者: arthroscopy 時間: 2025-3-29 18:04
Bounded Multi-agent Reasoning: Actualizing Distributed Knowledge,ed by experiments on group reasoning, we identify two dimensions of actualizing DK: communication and inference. We build a dynamic framework with effortful actions accounting for both, combining . and ., and we provide a method for extracting a sound and complete axiomatization.作者: 難解 時間: 2025-3-29 19:54
Arbitrary Propositional Network Announcement Logic,n the study of the dynamics of knowledge and belief. We combine these two directions by interpreting such modalities in social networks. We study the resulting logic, and provide a sound and strongly complete (infinitary) axiomatisation.作者: 爵士樂 時間: 2025-3-30 01:07 作者: aerial 時間: 2025-3-30 04:33
Allison M. Gurung,Edwin C. K. Pang update accounts for the way we update our knowledge and beliefs about situations when events occur. However, DEL does not account for the way we update our knowledge and beliefs about events when other events occur. Indeed, events are assumed to occur instantaneously in DEL and this idealization pr作者: Interim 時間: 2025-3-30 12:17
W. M. Williams,M. L. Williamson,D. Realhe notion of a causal model [., ., ., .] with a representation of the epistemic state of an agent. On the side of the object language, we add operators to express knowledge and the act of observing new information. We provide a sound and complete axiomatization of the logic, and discuss the relation作者: Infraction 時間: 2025-3-30 14:33 作者: NATTY 時間: 2025-3-30 19:17 作者: cumber 時間: 2025-3-30 23:57
M. B. Ratnaparkhe,R. J. Singh,J. J. Doyleon confirmed by a reliable source. We propose a finer analysis of how belief can be based on information, where the confirmation comes from multiple possibly conflicting sources and is of a probabilistic nature. We use Belnap-Dunn logic and its probabilistic extensions to account for potentially con作者: malapropism 時間: 2025-3-31 04:01
H. D. Upadhyaya,Shivali Sharma,S. L. Dwivedins on an initial epistemic model. It can also be considered as a plan verification problem in epistemic planning. The problem is known to be PSPACE-hard. To better understand the source of complexity of the problem, previous research has investigated the complexity of 128 parameterized versions of t作者: 不安 時間: 2025-3-31 08:32
H. D. Upadhyaya,Shivali Sharma,S. L. Dwivedi or Propositional Logic). Traditionally, default logics have been defined and dealt with via syntactic consequence relations. Here, we introduce a family of default logics defined over modal logics. First, we present these default logics syntactically. Then, we elaborate on an algebraic counterpart.作者: lacrimal-gland 時間: 2025-3-31 10:10
Dorin Gupta,Rebecca Ford,Paul W. J. Taylort two rather different versions of APAL wherein this quantification is restricted to formulas only containing a subset of all propositional variables: FSAPAL and SCAPAL; and another version quantifying over all announcements implied by or implying a given formula: IPAL. We then determine the relativ作者: Ischemia 時間: 2025-3-31 14:52 作者: Admire 時間: 2025-3-31 17:32 作者: 加劇 時間: 2025-3-31 21:40
John A. Bryant,Stephen G. Hughesn agent’s awareness is not a primitive but is directly computed from the agent’s belief base. We prove soundness and completeness of the logic relative to the belief base semantics. Furthermore, we provide a polynomial embedding of the logic of propositional awareness into it.作者: 歡樂中國 時間: 2025-4-1 05:27
Allison M. Gurung,Edwin C. K. Pangd, recently Prawitz and others have been discussing the so called ecumenical Systems, where connectives from these logics can co-exist in peace. In Prawitz’ system, the classical logician and the intuitionistic logician would share the universal quantifier, conjunction, negation, and the constant fo作者: Pulmonary-Veins 時間: 2025-4-1 06:04
M. B. Ratnaparkhe,R. J. Singh,J. J. Doyleepistemic logic. It was shown elsewhere that the logical laws governing the modalities of knowing and entertaining from standard inquisitive epistemic logic generalize smoothly to substructural logics. In this paper we show that the situation is different with the reduction axioms that in the standa作者: 舉止粗野的人 時間: 2025-4-1 12:25 作者: 小故事 時間: 2025-4-1 15:28
John A. Bryant,Stephen G. Hughese, . (DK) is often taken to reflect the potential knowledge of a group: what agents . know if they had unbounded means of communication and deductive ability. However, this does not specify whether/how this potential can be actualized, especially since real people are not unbounded reasoners. Inspir作者: 戰(zhàn)役 時間: 2025-4-1 20:42
M. B. Ratnaparkhe,R. J. Singh,J. J. Doylenowledge, propositional dynamic logic with intersection, and description logics with concept intersection. Completeness proofs for such logics tend to be complicated, in particular on model classes such as S5 used, e.g., in standard epistemic logic, mainly due to the undefinability of intersection o
