ArXiv

Formal result: Under rule independence, deterministic evaluation, and fixed…

Authors
Zhanbo Li, Shifeng Wu, Xiangjin Meng...
Categories
cs.AI, cs.DB
arXiv
https://arxiv.org/abs/2607.17269v1
PDF
https://arxiv.org/pdf/2607.17269v1

Brief

An explicit world model (data-first ontology) and the DaoQL multimodal store treat LLMs as reasoning engines while moving deterministic knowledge into a verified, in-process database. The authors formalize guarantees (composable counterfactual decomposability under rule independence, deterministic evaluation, fixed conflict resolution), present embedded-system benchmarks (sub-ms vector/graph queries), and show large gains in counterfactual decomposability when combined with GPT-4o. Full text and code are linked in the submission.

Why it matters

Formal result: Under rule independence, deterministic evaluation, and fixed conflict resolution, explicit world models (data-first ontology) provide a sufficient condition for composable counterfactual decomposability; implicit LLM-implicit models lack atomic read/delta semantics and offer no comparable architectural guarantee.

Key details

  • System implementation and microbenchmarks: DaoQL integrates graph, column, vector, and full-text engines in-process and reports graph BFS = 1.20 ms, HNSW = 83.1 µs, and a Fluent hybrid query = 105.8 µs on an embedded same-machine setup; LDBC SNB SF1 shows 34/34 query coverage with interactive queries mostly sub-ms–ms but only 1.8 QPS overall due to long-tail BI/IC queries.
  • Counterfactual evaluation: In a five-domain experiment (n = 1250), DaoQL+GPT-4o achieved 94% composable counterfactual decomposability—49 percentage points higher than GPT-4o alone; ANN-Benchmarks reached Recall@10 ≥ 99% at thousand-level QPS after a bridge-edge protection fix. KVCache nodes, expert hot updates, and DaoQL-Agent remain future work.
Source evidence

Abstract

Large language models encode world models implicitly in neural weights, which exposes four structural risks in high-precision domains such as medicine and finance: hallucination, frozen knowledge, poor explainability, and poor modifiability. This paper proposes data-first ontology: LLMs are treated as reasoning and language engines, while deterministic knowledge is moved into an explicit multimodal database, DaoQL. We formalize an explicit world model and show that, under rule independence, deterministic evaluation, and fixed conflict resolution, explicit models provide a sufficient condition for composable counterfactual decomposability; implicit models lack atomic read/delta semantics and therefore provide no comparable architectural guarantee. The implemented system focuses on DaoQL's verified storage layer and explicit Eval path, integrating graph, column, vector, and full-text engines within one process. KVCache graph nodes, expert hot updates, and the DaoQL-Agent runtime remain future work. On an embedded same-machine setup, DaoQL reports graph BFS at 1.20 ms, HNSW at 83.1 us, and a Fluent hybrid query at 105.8 us; these results indicate engineering potential but must be interpreted with deployment-shape differences from client-server systems. Exploratory measurements on LDBC SNB SF1 and ANN-Benchmarks further show 34/34 query coverage with interactive-class queries mostly in the sub-millisecond to millisecond range, but only 1.8 QPS overall due to long-tail BI/IC queries; ANN-Benchmarks reaches Recall@10 >= 99% at thousand-level QPS after a bridge-edge protection fix. In a five-domain counterfactual experiment (n = 1250), DaoQL+GPT-4o achieves 94% composable counterfactual decomposability, 49 percentage points above GPT-4o alone. The paper explicitly separates provable structure, preliminary empirical evidence, and architectural roadmap claims.

Comment: 20 pages, 2 figures. Code: https://github.com/zhanbolee/DaoQL-Edu