Hybrid Symbolic-Neural Routing
Per query, route between a symbolic path (rule engine, knowledge graph) and a neural path (LLM), using the LLM for interpretation and the symbolic layer for exact constraints.
Problem
LLMs are bad at exact constraint satisfaction at scale — they confabulate edge cases, lose track of conjunctions, and silently round numbers. Rule engines are bad at interpretation — they cannot handle free text. Yet most real workloads need both. A single path forces one of two losses: confabulated rule violations from the LLM path, or brittle template-only coverage from the symbolic path. Recent practitioner write-ups (Japanese Qiita, Anthropic-style architecture posts) and the Nov 2025 arXiv preprint 'Bridging Symbolic Control and Neural Reasoning in LLM Agents' converge on per-query routing as the resolution: estimate complexity, decide where the query belongs, and only blend the two when neither pure path suffices.
Solution
Build three first-class components: (a) a symbolic path holding the rules, ontologies, and constraint solvers; (b) a neural path holding the LLM with retrieval, tools, and synthesis; (c) a router that estimates per-query complexity and resource needs and dispatches. For genuinely hybrid queries, the LLM proposes a plan that the symbolic layer validates and executes — the LLM never asserts the answer alone. Track router accuracy as a first-class metric; treat boundary drift as a regression.
When to use
- Workloads that mix hard-rule queries (tax, dosage, eligibility, schema) with free-text/interpretive queries.
- Domains where a single wrong rule-application is unacceptable and the rules can be represented symbolically.
- Cost regimes where the symbolic path is materially cheaper per query than the LLM path.
- Settings where a knowledge graph or rule base already exists and is maintained.
Open the full interactive page →
Diagram, neighbourhood map, code examples, related patterns and full provenance.