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 4
LLM-Assisted Bi-Approximate CHC Solving
Constrained Horn clause (CHC) solvers often struggle to discover deep counterexamples whose derivations may require extensive rule unfolding.SparseMax-dSTL: Sound Robustness with Horizon-Independent Gradient Allocation for Temporal Logic Trajectory Optimization
A gradient-based solver that enforces a Signal Temporal Logic (STL) specification uses a smooth approximation of its quantitative semantics, the robustness.LogicVal:A Logic-Formalized Benchmark for Constraint Satisfaction in Text-to-Image Generation
Text-to-Image (T2I) generative models have made significant progress in producing high-fidelity images from natural-language prompts.Geometric Graph Representations via Compact SAT Encodings
We present compact SAT encodings and certifying exact solvers for boxicity and cubicity.Learning Rational Strategies for Temporal Objectives in Multi-Agent Systems
We study rational synthesis for stochastic multi-agent systems with unknown dynamics, where each agent is equipped with its own probabilistic temporal objective specified using Probabilistic Linear…Refusal Is Not Robustness: Measuring Harmful Reachability in Autoregressive Language Models
LLM safety evaluations via jailbreaking typically index on attack success rate (ASR): whether a generated response violates safeguards.Beyond LLM Judge: Mechanical Verification for Agentic Autoformalization
We introduce a novel method for verifying Lean formalizations that goes beyond LLM-judged faithfulness.Anticipatory Commonsense with Moving Objects: An ASP-Based Framework for Predictive Reasoning with Interacting Trajectories
We present a general declarative framework for anticipatory reasoning about interactive motion in complex dynamic environments.Convex-Analytic View of Query Selection for Safety Verification of Markov Decision Processes
Safety verification of a Markov decision process (MDP) asks whether the probabilities of reaching several failure states jointly lie in a convex safe region under every scheduler.LeanPRM: Lean-Grounded Process Supervision for Natural Language Proof Verification
AI systems now write long and difficult mathematical proofs, and checking their step-by-step validity is becoming a bottleneck.Certifying Almost-Sure Reachability in Unknown MDPs
{\em Specification-Guided Reinforcement Learning (RL)} has largely concerned itself with \emph{learning} an optimal policy against a formal specification in an unknown {\em Markov Decision Process…Reset Early, Reset Often, Eliminate Models
Connection-tableau provers typically construct closed tableaux by backtracking search.QPTAS for Max Weight Independent Set in Graphs with Strongly Edge-Sublinear Separators
A hereditary graph class has strongly edge-sublinear separators if, for some constant $0 \leqslant b < 1$, every graph in the class with $m$ edges admits a balanced separator of size $\mathcal…SafeDSE: Joint Exploration of Safety Architecture Patterns, Mapping, and Scheduling for Dataflow Applications With Safety Arguments (Extended Version)
Embedded platforms increasingly host safety-related streaming functions next to less critical ones.Constant-Depth Rational-Weight GNNs and their Connection to Schanuel's Conjecture
A landmark result states that the expressive power of graph neural networks (GNNs) is bounded from above by the 1-dimensional Weisfeiler-Leman (1-WL) test.MENTOR: Procedural Shielding of Tool-Using LLM Agents
Tool-using LLM agents are increasingly used to automate workflows governed by procedural manuals, such as company rules for booking travel or procuring hardware.Do Theorem Provers Need Theorem-Proving Agents? mini-Lean-agent: A Coding-Agent Baseline for Lean
General-purpose coding agents use standard shell and file interactions, yet formal theorem-proving agents often rely on specialized, ad-hoc tooling.VeriPIE: Checkable Query Plans and Evidence-Guided Selection for Text-to-SQL
Financial Artificial Intelligence (AI) governance and model risk management (MRM) emphasize independent validation, transparency, and effective challenge of AI-generated computations.Sequent-Prover: Training Agents for Formal, Checkable SMT-based Reasoning
We introduce Sequent-Prover, a family of verifier-using language-model agents, and the post-training framework that produces them.FENAS: A Few-Shot Meta-Ensembling Framework for Efficient Neural Architecture Search with Synergized Zero-Cost Proxies
Efficient neural architecture search (NAS) requires accurate performance estimation under limited evaluation budgets.