Theory & Algorithms · Computer Science & AI
Logic in Computer Science
The newest papers in Logic in Computer Science that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
168 papers, from 4 September 2026 to 5 November 2026: 168 arXiv preprints.
Get the few papers worth your time in Logic in Computer Science every morning.
Follow Logic in Computer Science and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 8
PetriBench: Benchmarking LLM Reasoning over Dynamic State Spaces
Characterizing LLM reasoning remains an open challenge, as many existing benchmarks isolate specific reasoning skills, rely on external knowledge, or are costly to extend.Large Language Models as Falsifiers for Cyber-Physical Systems
Falsification searches for counterexamples to formal specifications in cyber-physical systems (CPS).Exact semantic readout from compressed vector representations
We characterize when compressed vector representations admit exact linear or affine readouts of a finite lexicon's truth conditions: one fixed map per predicate, sending each entity vector to the…Symbolic Temporal Supervision of LLM Agents Using Contracts
Large language model (LLM) agents augmented by tools can automate complex, multi-step tasks, such as web navigation, code generation, and workflow orchestration, by acting on external systems…The AR Fairness Metamodel: A Structured Framework for Fairness Measures
This paper presents the AR fairness metamodel, a framework designed to represent, analyze, and compare different fairness scenarios.The Refutation Gap: Certifying Both Halves of an Optimality Claim
Synthesis pipelines increasingly claim not just that a program is correct, but that it is optimal.Finding Common Mistakes In Modelling With Mathematical Formalisms Using LLMs
Modelling with mathematical formalisms like logical formulas, mathematical equations, or regular expressions is an important yet challenging task for students of computer science and other STEM…The Classical Weisfeiler-Leman Algorithm Stabilizes in $O(n)$ Rounds
The classical Weisfeiler-Leman algorithm (also known as the $2$-dimensional Weisfeiler-Leman algorithm) is a simple combinatorial algorithm that was originally designed as a heuristic for the graph…Legislating World-Model-Based Planning with Legal Reasoning
As robotic systems grow more general, legal norms are needed to integrate them into society.The Future of Safety for SaMD
An artificial organ carries failure consequences on the scale of an aircraft or a reactor, but the software driving it is rarely held to the same standard.Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231
We give an exact algorithm counting the permutations that avoid a fixed pattern from the following family: the direct sum of an increasing pattern and the pattern 231.A Hybrid Dependency-Aware Framework for Task Decomposition and Dynamic Agent Generation in Oracle-to-PostgreSQL Migration
Large language model (LLM)-based database migration is often treated as direct code transformation, although enterprise Oracle systems contain heterogeneous SQL and PL/SQL artifacts with different…The Case for Automated Hyperspecialization: Evidence from SAT
The software status quo is to use one system to process many different kinds of inputs.IBBench-Light: A Paired Evaluation of Task-Conditioned Responses to External Directives
An external record may contain a procedure to apply or text to read, depending on the user's request.Neuron Activation-based Computation of Logical Explanations for Deep Neural Networks
Formal explainability of classifying neural networks (NNs) is an active area of research, providing explanations with provable guarantees of the classification within continuous regions of the input…Supermartingale Certificates for Parametric MDPs
We consider the problems of formal verification and synthesis in parametric Markov decision processes (MDPs) with general measurable state and action spaces.Positive Topology and Feasible Refinement: Forcing Matrices, Positivity, and Information
We develop a conceptual and operational account of Positive Topology starting from a basic relation between points or models and observable properties.Comparative Framework Analysis for Enterprise Generative AI Applications: Chatbot, Automation, and Oracle-to-PostgreSQL Migration
This study compares framework suitability across three classes of enterprise generative AI applications: a documentation-based development assistant, an email and inquiry automation system, and an…The Semantic Elevation Operator and the Closure of the Undecidable Class under Preservation
The undecidability of a program's static semantic properties is governed by Rice's theorem.Extending SMT Solving with Non-Ground Clause Learning
Quantifier instantiation is currently the main approach to non-ground SMT solving: solvers generate ground instances and solve the resulting ground SMT problems with CDCL(T)-style reasoning.