arXiv cs.LO Logic in Computer Science
@cslo-bot.bsky.social
Unofficial bot by @vele.bsky.social w/ http://github.com/so-okada/bXiv https://arxiv.org/list/cs.LO/new
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
Reposted by arXiv cs.LO Logic in Computer Science
Chunxi Ji, Adnan Darwiche: Circuit Representations of Random Forests with Applications to XAI https://arxiv.org/abs/2602.08362 https://arxiv.org/pdf/2602.08362 https://arxiv.org/html/2602.08362
February 10, 2026 at 6:30 AM
Chunxi Ji, Adnan Darwiche: Circuit Representations of Random Forests with Applications to XAI https://arxiv.org/abs/2602.08362 https://arxiv.org/pdf/2602.08362 https://arxiv.org/html/2602.08362
Reposted by arXiv cs.LO Logic in Computer Science
Madalina Erascu, Johannes Middeke: Automatic Generation of Polynomial Symmetry Breaking Constraints https://arxiv.org/abs/2602.08297 https://arxiv.org/pdf/2602.08297 https://arxiv.org/html/2602.08297
February 10, 2026 at 6:34 AM
Madalina Erascu, Johannes Middeke: Automatic Generation of Polynomial Symmetry Breaking Constraints https://arxiv.org/abs/2602.08297 https://arxiv.org/pdf/2602.08297 https://arxiv.org/html/2602.08297
Reposted by arXiv cs.LO Logic in Computer Science
Milan Rosko: A Fibonacci-Based G\"odel Numbering: $\Delta_0$ Semantics Without Exponentiation https://arxiv.org/abs/2509.10382 https://arxiv.org/pdf/2509.10382 https://arxiv.org/html/2509.10382
September 15, 2025 at 6:39 AM
Milan Rosko: A Fibonacci-Based G\"odel Numbering: $\Delta_0$ Semantics Without Exponentiation https://arxiv.org/abs/2509.10382 https://arxiv.org/pdf/2509.10382 https://arxiv.org/html/2509.10382
Sam Speight, Niels van der Weide: Impredicativity in Linear Dependent Type Theory https://arxiv.org/abs/2602.08846 https://arxiv.org/pdf/2602.08846 https://arxiv.org/html/2602.08846
February 10, 2026 at 6:32 AM
Sam Speight, Niels van der Weide: Impredicativity in Linear Dependent Type Theory https://arxiv.org/abs/2602.08846 https://arxiv.org/pdf/2602.08846 https://arxiv.org/html/2602.08846
Thanh Le, Hai Duong, ThanhVu Nguyen, Takeshi Matsumura: Verifying DNN-based Semantic Communication Against Generative Adversarial Noise https://arxiv.org/abs/2602.08801 https://arxiv.org/pdf/2602.08801 https://arxiv.org/html/2602.08801
February 10, 2026 at 6:32 AM
Thanh Le, Hai Duong, ThanhVu Nguyen, Takeshi Matsumura: Verifying DNN-based Semantic Communication Against Generative Adversarial Noise https://arxiv.org/abs/2602.08801 https://arxiv.org/pdf/2602.08801 https://arxiv.org/html/2602.08801
Stefan Szeider: PBLean: Pseudo-Boolean Proof Certificates for Lean 4 https://arxiv.org/abs/2602.08692 https://arxiv.org/pdf/2602.08692 https://arxiv.org/html/2602.08692
February 10, 2026 at 6:32 AM
Stefan Szeider: PBLean: Pseudo-Boolean Proof Certificates for Lean 4 https://arxiv.org/abs/2602.08692 https://arxiv.org/pdf/2602.08692 https://arxiv.org/html/2602.08692
Philipp R\"ummer: Craig Interpolation in Program Verification https://arxiv.org/abs/2602.08532 https://arxiv.org/pdf/2602.08532 https://arxiv.org/html/2602.08532
February 10, 2026 at 6:32 AM
Philipp R\"ummer: Craig Interpolation in Program Verification https://arxiv.org/abs/2602.08532 https://arxiv.org/pdf/2602.08532 https://arxiv.org/html/2602.08532
Duc Trung Kim Nguyen, Tuyen Van Kieu, Khanh Van To: SAT Encodings for Bandwidth Coloring: A Systematic Design Study https://arxiv.org/abs/2602.08423 https://arxiv.org/pdf/2602.08423 https://arxiv.org/html/2602.08423
February 10, 2026 at 6:32 AM
Duc Trung Kim Nguyen, Tuyen Van Kieu, Khanh Van To: SAT Encodings for Bandwidth Coloring: A Systematic Design Study https://arxiv.org/abs/2602.08423 https://arxiv.org/pdf/2602.08423 https://arxiv.org/html/2602.08423
Johan van Benthem: Definability and Interpolation in Philosophy https://arxiv.org/abs/2602.07907 https://arxiv.org/pdf/2602.07907 https://arxiv.org/html/2602.07907
February 10, 2026 at 6:32 AM
Johan van Benthem: Definability and Interpolation in Philosophy https://arxiv.org/abs/2602.07907 https://arxiv.org/pdf/2602.07907 https://arxiv.org/html/2602.07907
[2026-02-10 Tue (UTC), 6 new articles found for csLO Logic in Computer Science]
February 10, 2026 at 6:32 AM
[2026-02-10 Tue (UTC), 6 new articles found for csLO Logic in Computer Science]
Reposted by arXiv cs.LO Logic in Computer Science
Ehud Shapiro: Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI https://arxiv.org/abs/2602.06934 https://arxiv.org/pdf/2602.06934 https://arxiv.org/html/2602.06934
February 9, 2026 at 6:34 AM
Ehud Shapiro: Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI https://arxiv.org/abs/2602.06934 https://arxiv.org/pdf/2602.06934 https://arxiv.org/html/2602.06934
Reposted by arXiv cs.LO Logic in Computer Science
Noah Schwartz, Chandra Kanth Nagesh, Sriram Sankaranarayanan, Ramneet Kaur, Tuhin Sahai, Susmit Jha: Optimal Abstractions for Verifying Properties of Kolmogorov-Arnold Networks (KANs) https://arxiv.org/abs/2602.06737 https://arxiv.org/pdf/2602.06737 https://arxiv.org/html/2602.06737
February 9, 2026 at 6:34 AM
Noah Schwartz, Chandra Kanth Nagesh, Sriram Sankaranarayanan, Ramneet Kaur, Tuhin Sahai, Susmit Jha: Optimal Abstractions for Verifying Properties of Kolmogorov-Arnold Networks (KANs) https://arxiv.org/abs/2602.06737 https://arxiv.org/pdf/2602.06737 https://arxiv.org/html/2602.06737
Reposted by arXiv cs.LO Logic in Computer Science
Alexandre Cl\'ement: A Complete Equational Theory for Real-Clifford+CH Quantum Circuits https://arxiv.org/abs/2602.06644 https://arxiv.org/pdf/2602.06644 https://arxiv.org/html/2602.06644
February 9, 2026 at 6:50 AM
Alexandre Cl\'ement: A Complete Equational Theory for Real-Clifford+CH Quantum Circuits https://arxiv.org/abs/2602.06644 https://arxiv.org/pdf/2602.06644 https://arxiv.org/html/2602.06644
Reposted by arXiv cs.LO Logic in Computer Science
Liam O'Connor, Pilar Selene Linares Arevalo, Christine Rizkallah: Uniqueness is Separation https://arxiv.org/abs/2602.06386 https://arxiv.org/pdf/2602.06386 https://arxiv.org/html/2602.06386
February 9, 2026 at 6:34 AM
Liam O'Connor, Pilar Selene Linares Arevalo, Christine Rizkallah: Uniqueness is Separation https://arxiv.org/abs/2602.06386 https://arxiv.org/pdf/2602.06386 https://arxiv.org/html/2602.06386
Reposted by arXiv cs.LO Logic in Computer Science
Pierriccardo Olivieri, Fausto Lasca, Alessandro Gianola, Matteo Papini: Do It for HER: First-Order Temporal Logic Reward Specification in Reinforcement Learning (Extended Version) https://arxiv.org/abs/2602.06227 https://arxiv.org/pdf/2602.06227 https://arxiv.org/html/2602.06227
February 9, 2026 at 6:29 AM
Pierriccardo Olivieri, Fausto Lasca, Alessandro Gianola, Matteo Papini: Do It for HER: First-Order Temporal Logic Reward Specification in Reinforcement Learning (Extended Version) https://arxiv.org/abs/2602.06227 https://arxiv.org/pdf/2602.06227 https://arxiv.org/html/2602.06227
\'Eric Goubault, J\'er\'emy Ledent, Sergio Rajsbaum: Distributed Knowledge in Simplicial Models https://arxiv.org/abs/2602.06945 https://arxiv.org/pdf/2602.06945 https://arxiv.org/html/2602.06945
February 9, 2026 at 6:32 AM
\'Eric Goubault, J\'er\'emy Ledent, Sergio Rajsbaum: Distributed Knowledge in Simplicial Models https://arxiv.org/abs/2602.06945 https://arxiv.org/pdf/2602.06945 https://arxiv.org/html/2602.06945
Siddharth Namachivayam: Topological Semantics for Common Inductive Knowledge https://arxiv.org/abs/2602.06927 https://arxiv.org/pdf/2602.06927 https://arxiv.org/html/2602.06927
February 9, 2026 at 6:32 AM
Siddharth Namachivayam: Topological Semantics for Common Inductive Knowledge https://arxiv.org/abs/2602.06927 https://arxiv.org/pdf/2602.06927 https://arxiv.org/html/2602.06927
Alexandre Lucquin (LIPN), Luc Pellissier (LACL), Thomas Seiller (CNRS, LIPN, LIPN): Linear Realisability and Implicative Algebras https://arxiv.org/abs/2602.06576 https://arxiv.org/pdf/2602.06576 https://arxiv.org/html/2602.06576
February 9, 2026 at 6:32 AM
Alexandre Lucquin (LIPN), Luc Pellissier (LACL), Thomas Seiller (CNRS, LIPN, LIPN): Linear Realisability and Implicative Algebras https://arxiv.org/abs/2602.06576 https://arxiv.org/pdf/2602.06576 https://arxiv.org/html/2602.06576
Justus Becker, Anupam Das, Sonia Marin, Paaras Padhiar: The proof theory and semantics of second-order (intuitionistic) tense logic https://arxiv.org/abs/2602.06253 https://arxiv.org/pdf/2602.06253 https://arxiv.org/html/2602.06253
February 9, 2026 at 6:32 AM
Justus Becker, Anupam Das, Sonia Marin, Paaras Padhiar: The proof theory and semantics of second-order (intuitionistic) tense logic https://arxiv.org/abs/2602.06253 https://arxiv.org/pdf/2602.06253 https://arxiv.org/html/2602.06253
[2026-02-09 Mon (UTC), 4 new articles found for csLO Logic in Computer Science]
February 9, 2026 at 6:32 AM
[2026-02-09 Mon (UTC), 4 new articles found for csLO Logic in Computer Science]
Mohammad Abdulaziz, Thomas Ammer: A Formal Analysis of Capacity Scaling Algorithms for Minimum-Cost Flows https://arxiv.org/abs/2602.03701 https://arxiv.org/pdf/2602.03701 https://arxiv.org/html/2602.03701
February 4, 2026 at 7:26 AM
Mohammad Abdulaziz, Thomas Ammer: A Formal Analysis of Capacity Scaling Algorithms for Minimum-Cost Flows https://arxiv.org/abs/2602.03701 https://arxiv.org/pdf/2602.03701 https://arxiv.org/html/2602.03701
Damien Morard, Lucas Donati, Didier Buchs: Symbolic Model Checking using Intervals of Vectors https://arxiv.org/abs/2602.03565 https://arxiv.org/pdf/2602.03565 https://arxiv.org/html/2602.03565
February 4, 2026 at 7:26 AM
Damien Morard, Lucas Donati, Didier Buchs: Symbolic Model Checking using Intervals of Vectors https://arxiv.org/abs/2602.03565 https://arxiv.org/pdf/2602.03565 https://arxiv.org/html/2602.03565
Satoshi Kura: On Complete Categorical Semantics for Effect Handlers https://arxiv.org/abs/2602.03275 https://arxiv.org/pdf/2602.03275 https://arxiv.org/html/2602.03275
February 4, 2026 at 7:25 AM
Satoshi Kura: On Complete Categorical Semantics for Effect Handlers https://arxiv.org/abs/2602.03275 https://arxiv.org/pdf/2602.03275 https://arxiv.org/html/2602.03275
Nathan Guermond: Towards Weak Stratification for Logics of Definitions https://arxiv.org/abs/2602.03072 https://arxiv.org/pdf/2602.03072 https://arxiv.org/html/2602.03072
February 4, 2026 at 7:25 AM
Nathan Guermond: Towards Weak Stratification for Logics of Definitions https://arxiv.org/abs/2602.03072 https://arxiv.org/pdf/2602.03072 https://arxiv.org/html/2602.03072
Pablo Barenbaum, Eduardo Bonelli, Leopoldo Lerena: A Classical Linear $\lambda$-Calculus based on Contraposition https://arxiv.org/abs/2602.02822 https://arxiv.org/pdf/2602.02822 https://arxiv.org/html/2602.02822
February 4, 2026 at 7:25 AM
Pablo Barenbaum, Eduardo Bonelli, Leopoldo Lerena: A Classical Linear $\lambda$-Calculus based on Contraposition https://arxiv.org/abs/2602.02822 https://arxiv.org/pdf/2602.02822 https://arxiv.org/html/2602.02822