松驰
发表于 2025-3-23 13:23:22
A Separation Logic with Histories of Epistemic Actions as Resourcesw depend on what was true in the past, before certain actions were executed? We show that the multiplicative connectives can be eliminated from a logical language with also epistemic and action model modalities, if the horizon of epistemic actions is bounded.
Conduit
发表于 2025-3-23 15:03:05
Towards an Induction Principle for Nested Data Types towards a solution to this problem, we introduce . for nested data types. Using the nested data type . as a guiding example, we show how to derive its dependently typed fold and induction principle. We also discuss the relationship between dependently typed folds and the more traditional higher-order folds.
grenade
发表于 2025-3-23 21:34:31
A Principled Approach to Expectation Maximisation and Latent Dirichlet Allocation Using Jeffrey’s Ups update rule gives a decrease of Kullback-Leibler divergence. Its logic is error correction. It is shown that this same rule and divergence decrease logic is at the heart of EM and LDA, ensuring that successive iterations are decreasingly wrong.
GRACE
发表于 2025-3-24 00:06:42
Conference proceedings 2023 24 full papers (21 contributed, 3 invited) included in this book were carefully reviewed and selected from 46 submissions. The book also contains the abstracts for the 7 invited talks and 4 tutorials presented at WoLLIC 2023. The WoLLIC conference series aims at fostering interdisciplinary research in pure and applied logic..
Allowance
发表于 2025-3-24 05:03:51
978-3-031-39783-7The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
Contend
发表于 2025-3-24 08:59:17
http://reply.papertrans.cn/59/5881/588053/588053_16.png
Pantry
发表于 2025-3-24 11:10:25
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588053.jpg
preservative
发表于 2025-3-24 17:59:01
http://reply.papertrans.cn/59/5881/588053/588053_18.png
cataract
发表于 2025-3-24 20:31:36
http://reply.papertrans.cn/59/5881/588053/588053_19.png
engagement
发表于 2025-3-25 03:07:08
Effective SkolemizationWe define a new relatively simple Skolemization method called atomic Skolemization which allows for a non-elementarily bounded speed-up of cut-free .-proofs and resolution proofs w.r.t. the standard Skolemization and Andrews Skolemization.