@LiCSpreprintBot

Logic in Computer Science (cs.LO) Created by @venriched source: https://xitter.cf/t.co/bdiIknjayG

rss.arxiv.org/rss/cs.LO
Joined February 2024
  • Tweets7K
  • Following0
  • Followers98
Vinícius P. Chagas, Luiz H. T. Viana, Mac M. da S. Carlos, João P. V. Madeiro, Roberto C. Pedrosa, Thiago Alves Rocha, Carlos H. L. Cavalcante "Reliable XAI Explanations in Sudden Cardiac Death Prediction for Chagas Cardiomyopathy"arxiv.org/abs/2602.22288v1

Reliable XAI Explanations in Sudden Cardiac Death Prediction for...

Sudden cardiac death (SCD) is unpredictable, and its prediction in Chagas cardiomyopathy (CC) remains a significant challenge, especially in patients not classified as high risk. While AI and...

arxiv.org
1
1
155
Leo Lobski, Fabio Zanasi "Layered Monoidal Theories II: Fibrational Semantics"arxiv.org/abs/2602.22373v1

Layered Monoidal Theories II: Fibrational Semantics

Layered monoidal theories provide a categorical framework for studying scientific theories at different levels of abstraction, via string diagrammatic algebra. We introduce models for three...

arxiv.org
60
Robert Joseph George, Jennifer Cruden, Xiangru Zhong, Huan Zhang, Anima Anandkumar "TorchLean: Formalizing Neural Networks in Lean"arxiv.org/abs/2602.22631v1

TorchLean: Formalizing Neural Networks in Lean

Neural networks are increasingly deployed in safety- and mission-critical pipelines, yet many verification and analysis results are produced outside the programming environment that defines and...

arxiv.org
1
5
250
Noah Abou El Wafa, André Platzer "Complete Robust Hybrid Systems Reachability"arxiv.org/abs/2602.22853v1

Complete Robust Hybrid Systems Reachability

This paper introduces robust differential dynamic logic (a fragment of differential dynamic logic) to specify and reason about robust hybrid systems. Practically meaningful syntactic restrictions...

arxiv.org
62
Ramchandra Phawade, Tephilla Prince, S Sheerazuddin "Verification of Unbounded Client-Server Systems with Distinguishable Clients"arxiv.org/abs/2602.23054v1

Verification of Unbounded Client-Server Systems with...

Client-server systems are a computing paradigm in concurrent and distributed systems. We deal with unbounded client-server systems (UCS) where all clients are of the same type, interact with a...

arxiv.org
40
Rinta Yamada "Effectful Toposes and Their Lawvere-Tierney Topologies"arxiv.org/abs/2602.23086v1

Effectful Toposes and Their Lawvere-Tierney Topologies

This paper introduces effectful toposes as an extension of the effective topos and investigates their structure relative to Lawvere-Tierney topologies. First, we formulate effectful toposes by...

arxiv.org
56
Weijie Lu, Jingyu Ke, Hongfei Fu, Zhouyue Sun, Yi Zhou, Guoqiang Li, Haokun Li "Array-Carrying Symbolic Execution for Function Contract Generation"arxiv.org/abs/2602.23216v1

Array-Carrying Symbolic Execution for Function Contract Generation

Function contract generation is a classical problem in program analysis that targets the automated analysis of functions in a program with multiple procedures. The problem is fundamental in...

arxiv.org
59
Giacomo Bonanno "The logic of KM belief update is contained in the logic of AGM belief revision"arxiv.org/abs/2602.23302v1

The logic of KM belief update is contained in the logic of AGM...

For each axiom of KM belief update we provide a corresponding axiom in a modal logic containing three modal operators: a unimodal belief operator $B$, a bimodal conditional operator $>$ and the...

arxiv.org
26
[2026-02-26, 8 new articles found for cs_LO Logic in Computer Sciencs]
24
[2026-02-25, 6 new articles found for cs_LO Logic in Computer Sciencs]
34
[2026-02-24, 2 new articles found for cs_LO Logic in Computer Sciencs]
28
[2026-02-23, 20 new articles found for cs_LO Logic in Computer Sciencs]
37
Sergey Goncharov, Marco Peressotti, Stelios Tsampas, Henning Urbat, Stefano Volpe "Towards a Higher-Order Bialgebraic Denotational Semantics"arxiv.org/abs/2602.18295v1

Towards a Higher-Order Bialgebraic Denotational Semantics

The bialgebraic abstract GSOS framework by Turi and Plotkin provides an elegant categorical approach to modelling the operational and denotational semantics of programming and process languages....

arxiv.org
1
59
more replies
ng compositionality of bisimilarity. However, a categorical understanding of bialgebraic denotational semantics according to Turi and Plotkin's original vision has so far been missing in the higher-order setting. In the present paper, we develop a theory of adequate den...[3/6]
1
18
otational semantics in higher-order abstract GSOS. The denotational models are parametric in an appropriately chosen semantic domain in the form of a locally final coalgebra for a behaviour bifunctor, whose construction is fully decoupled from the syntax of the language...[4/6]
25
Miika Hannula, Teymur Ismikhanov, Jonni Virtema "Dichotomy for Axiomatising Inclusion Dependencies on K-Databases"arxiv.org/abs/2602.18390v1

Dichotomy for Axiomatising Inclusion Dependencies on K-Databases

A relation consisting of tuples annotated by an element of a monoid K is called a K-relation. A K-database is a collection of K-relations. In this paper, we study entailment of inclusion...

arxiv.org
1
50
more replies
blem. In addition, we establish that the so-called balance axiom is further required, if one stipulates that the joint weights of each K-relation of a K-database need to be the same; this generalises the notion of a K-relation being a distribution. In conjunction with t...[4/5]
1
18
he balance axiom, weak symmetry axiom boils down to symmetry. [5/5]
18
Load more