Applied & Human-Centered · Computer Science & AI
Symbolic Computation
The newest papers in Symbolic Computation that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
38 papers, from 10 September 2026 to 5 November 2026: 38 arXiv preprints.
Get the few papers worth your time in Symbolic Computation every morning.
Follow Symbolic Computation 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 2
From Plausible Hierarchies to Useful Taxonomies: Evaluating Agentic Harnesses on Customer Feedback
Taxonomies are the symbolic representations through which AI systems organize evidence, aggregate patterns, and answer questions over large document collections.Towards the Automatic Synthesis of Interpretable Chess Tactics
State-of-the-art reinforcement learning agents are capable of outperforming human experts at games like chess, Go and StarCraft II.LeanPlan: Optimal Planning with LLM-Generated Heuristics and Admissibility Proofs
Frontier large language models (LLMs) can generate heuristic functions that guide search to achieve state-of-the-art performance in satisficing planning, where any plan is acceptable.Synthesizing Physics Formulae with Transformers
Finding a compact formula that fits a set of input-output pairs and predicts outputs on unseen inputs is a fundamental problem in science.Semi-automated Verification of Symbolic Invariants In Extended Symmetric Nets
Structural analysis is central to Petri Net (PN) research, complementing state-space methods while avoiding their combinatorial issues.SRHarness: A Harness for Agentic Symbolic Regression
Recent agentic symbolic regression approaches increasingly rely on large language models to analyze data, select scientific operations, and refine hypotheses over long search trajectories.MechBench: Can AI Scientific Agents Discover Mechanisms Beyond Phenomenal Laws?
Scientific discovery requires not only recovering mathematical laws that describe observable behavior, but also identifying the mechanisms that generate them.LieDiscover: Adaptive Symbolic Library Construction for Explicit Open-form Symmetry Discovery
Discovering underlying symmetries from data has emerged as a crucial challenge in scientific discovery.A 51-Addition Alternative-Basis Kernel for Rank-23 $3\times3$ Matrix Multiplication
We give a rank-23 algorithm for $3\times3$ matrix multiplication using 51 additions and subtractions in alternative bases.Order-Invariant Answers, Order-Sensitive Representations in Mathematical Reasoning
Reordering a set of mathematical rules without changing its meaning should preserve the correct answer, but must a model's internal representations stay invariant too?Proceedings Tenth Symposium on Working Formal Methods
The 10th Working Formal Methods Symposium (FROM 2026) was held in Timişoara, Romania on September 15-17, 2026.Policy-as-Skill: Governed LLM Decision Support with Evidence, Deterministic Control, and Audit
Organizations increasingly use LLMs for policy, compliance, risk, and operational decision support, requiring evidence validation, review routing, version control, and auditability.Linguistic Features for Interpretable Textual Entailment
Despite the success of neural models in natural language processing, their black-box nature limits interpretability and conceals the linguistic phenomena underlying their predictions.LogicTrack: Auditing Reasoning Trajectories of Large Language Models with Formal Logic Solvers
Chain-of-Thought (CoT) reasoning has been shown to improve the performance of large language models (LLMs), yet existing optimization methods largely rely on outcome-based feedback, leaving the…A Structural Proof of the Lower Bound 21 for $3\times3$ Matrix Multiplication over $\mathbb F_2$
We prove that the tensor rank of $3\times3$ matrix multiplication over $\mathbb F_2$ is at least $21$.Probably correct row echelon form in the F4 algorithm
The computation of row echelon form is one of the main bottlenecks in the F4 algorithm.Generative Interpretability via Scalable Neuro-Symbolic Models
As the use of Large Language Models moves from chatbots into agentic systems, where outputs become actions with irreversible consequences on reality, the existing paradigm on AI Interpretability…Diversity of EML-type operators
The discovery of the EML operator, sufficient to evaluate the standard explicit purely transcendental elementary functions, has led to considerable interest and discussion across multiple scientific…