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 5
Representation Theorems for Actual Powers over Two-Agent General Concurrent Game Frames
One of the most well-known connections between logic and games is Pauly's representation theorem: the induced powers of individuals and coalitions in concurrent game frames correspond, in a precise…Vision-Predictor-Action: Towards Efficient Embodied AI via Neuro-Symbolic JEPA Predictors
Vision-Language-Action (VLA) models commonly generate robot actions token by token through Large Language Model (LLM) decoders, causing inference latency to grow with action sequence length and…TL;QR: Querying Temporal Discursive Patterns in Textual Corpora
Many questions about large textual corpora concern patterns that unfold over time, such as a political group whose stance on a topic drifts from support to criticism over several years of debates.How Should a Camera-First AI Agent Work?
Camera-first agents must act on the visual world as it unfolds.SqueezeBench: Saturation-Resilient Evaluation of Mathematical Capability
AI systems are making rapid progress in mathematics, but this progress is hard to measure.SafeInferCom: Safe Inference-Time Compute via Verifier-Guided Mid-Generation Intervention for Robotic Task Planning
Large Reasoning Language Models (LRLMs) enable multi-step reasoning for robotic task planning, but continued reasoning can overwrite valid intermediate plans or leave constraint violations…Complexity of Grounded Semantics and Preferred Semantics in Finitary Argumentation Frameworks
Abstract argumentation frameworks (AFs) introduced by Dung provide a formal foundation for non-monotonic reasoning in artificial intelligence.Learning to Plan by Looking Back: Hindsight Hierarchies for Training Reasoning Models
We introduce a self-improvement loop for reasoning models based on the following observation: Even when the difficulty of a problem exceeds the model's current solving abilities, an additionally…Universal Construction and Exact Self-Reproduction in Ternary McCulloch-Pitts Networks
A fixed network of McCulloch-Pitts threshold units with weights in {-1,0,1} can hold other threshold networks in its state and run them: the state is a ring of banks of records, each record a unit…Leakage-Resistant Evaluation of AI-Generated Database Specifications in Specification-Driven Migration
This paper presents a leakage-resistant framework and benchmark (LRFB) for measuring evaluators of AI-generated Oracle PL/SQL specifications.Relocating Nonlinearity: How a Downstream Learner Reshapes What Genetic Programming Must Evolve
Genetic programming was conceived as a way of evolving solutions: the program is the answer, and fitness is the error of its own output.Cost-Efficient Theorem Proving via Agent Orchestration in Program Verification
Program verification establishes software correctness through machine-checkable proofs constructed in theorem provers.Hierarchical Security Monitoring for Edge-IoT: A Formal Methods Approach
Cyber resiliency in edge-IoT deployments is fundamentally an economic problem: detection must keep critical processes operating under attack, but defender resources (compute, bandwidth, operator…Mathematical Proof Assistants for Teaching Logic: The LogiKEy Methodology
We report on an approach to teaching logic to mixed groups of computer science, mathematics, and philosophy students, based on the logico-pluralistic LogiKEy methodology, used for more than a decade…Multi-Aspect Runtime Verification for Simulation-Based V&V of LLM-Enabled Autonomous Agents
LLM-based agents are entering decision-support roles in defence staff work, where the obligations they must respect are already written down and binding, and where retraining is not available as a…SpecGuard: Proving a Task Is Broken Before the Agent Cheats
As autonomous coding agents get increasingly deployed, the risk that accidental or adversarially injected misspecifications in tasks lead to dangerous agent behavior is critical to address.Impact of Data Augmentation on Confidence Calibration in Melanoma Classification
Accurately quantifying the predictive uncertainty or improving model calibration plays an important role in medical image classification, in particular in melanoma diagnosis, where accurate…Minimal Witness Reinforcement Learning
``What are the irreducible conditions that are sufficient to produce an outcome?'' is one of the most common questions that recur across computation and science.Rule-Based Languages for Neurosymbolic AI
Logic programming is increasingly used as the symbolic component of neurosymbolic AI systems.AIProver: Agentic Auto-Formalization of Mathematical Research via Certificate-Driven Evolving Harness
Proof auto-formalization translates natural-language (NL) theorems and proofs into a formal language (FL) such as Lean, enabling mechanical verification.