The paper introduces Symbolic Separation, a method that grounds deep learning agents in knowledge graphs to improve reliability in operational data analytics. By restricting agent actions to an ontology-constrained Virtual Knowledge Graph with deterministic pre-execution validation, the approach transforms complex queries into validated graph traversals rather than relying on LLM-inferred joins. In experiments on 49.9 TB of supercomputer telemetry, the Neurosymbolic Deep Analyst achieved an 86% task‑success rate, eliminated silent data‑integrity errors, and reduced token costs by 2.4× compared to a non‑symbolic baseline.
arXiv:2607. 14149v1 Announce Type: new Abstract: Although large language models (LLMs) have set benchmarks for zero-shot reasoning, their deployment remains cost-prohibitive and environmentally taxing.
arXiv:2608. 13662v1 Announce Type: new Abstract: Coding agents have become the primary means of generating new code in many software projects, and the resulting velocity of changes makes keeping track of the reasons behind those changes challenging.
arXiv:2608. 15834v1 Announce Type: new Abstract: Tool-calling LLM agents navigate unfamiliar codebases with a handful of generic primitives for listing, reading and searching files (ls, cat, grep).
arXiv:2608. 07700v1 Announce Type: new Abstract: Translating a natural-language question into a SPARQL query that can be executed against a large knowledge graph requires resolving lexical ambiguity, grounding surface terms in the target ontology, and producing graph patterns that are both syntactically valid and semantically faithful.
The paper introduces WFM, a Wiki Foundation Model designed to support complex agentic reasoning by combining dense document contexts with markdown-based topological linkages. It formalizes a Wiki Graph schema that preserves explicit topologies while embedding continuous semantics, and employs a query‑conditioned attentive aggregation for efficient message passing. The authors also propose an NCCL‑based protocol to reduce distributed system overhead, achieving a 10.5× training speedup and strong performance on long‑term memory and multi‑hop reasoning benchmarks.
arXiv:2605.14259v3 Announce Type: replace Abstract: Applying Large Language Models (LLMs) to heterogeneous enterprise systems is hindered by hallucinations and failures in multi-hop, n-ary reasoning....
arXiv:2605. 26874v2 Announce Type: replace-cross Abstract: LLM-based agents for industrial asset operations show limited accuracy when reasoning over flat document stores.
arXiv:2608. 15389v1 Announce Type: new Abstract: LLM-based Text-to-SQL progress is reported across heterogeneous benchmarks, backbones, and inference protocols, making cross-system comparison fragile.
arXiv:2606. 16603v1 Announce Type: cross Abstract: LLM-based agents have demonstrated strong capabilities in data-intensive analytical tasks, yet their outputs are rarely verifiable: a reliance on linear text trajectories makes their reasoning difficult to audit.
arXiv:2609.05774v1 Announce Type: new Abstract: Recent multi-agent LLM systems increasingly rely on graph-structured communication to coordinate specialized agents. We revisit multi-agent orchestrati...
The paper introduces the DevRev NL2SQL benchmark, featuring 900 execution‑verified queries that test natural‑language‑to‑SQL systems on nested, graph‑like enterprise schemas, and proposes the Semantic Depth Score (SDS) as a rubric for analytical reasoning depth. It also presents a cost‑aware, single‑generation agentic architecture that includes schema selection, metadata retrieval, and error‑repair components tailored to these complex schemas. On the DevRev benchmark, the system achieves 91.7% answer correctness, outperforming the next‑best baseline by 54.6 percentage points, and remains competitive on the Spider 2.0 Snowflake dataset.
arXiv:2608.30250v1 Announce Type: new Abstract: This paper addresses the problem of translating natural-language routing rules written by business administrators into executable workflow graphs for e...