An Explicit World Model Based on Data-First Ontology: DaoQL Multimodal Storage Validation and Counterfactual Reasoning Evaluation

• URL: http://arxiv.org/abs/2607.17269v1
• Date: Sun, 19 Jul 2026 14:20:22 GMT
• Title: An Explicit World Model Based on Data-First Ontology: DaoQL Multimodal Storage Validation and Counterfactual Reasoning Evaluation
• Abstract summary: Large language models encode world models implicitly in neural weights, which exposes four structural risks in high-precision domains such as medicine and finance.<n>We formalize an explicit world model and show that, under rule independence, explicit models provide a sufficient condition for composable counterfactual decomposability.<n>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.
• Score: 1.9674271425998944
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• A Hybrid Vision-Language Architecture for Automated Defect Reasoning and Report Generation in Industrial Inspection [0.42970700836450487]
  This paper describes a decoupled, edge-deployable pipeline for wind turbine blade inspection.<n>The Eyes a Y26-x-obb oriented bounding-box localizes defects at dataset-native resolution.<n>The Bridge a deterministic, parameter-free encoding module maps each detected bounding box to grid-referenced tokens.
  arXiv  Detail & Related papers  (2026-05-26T04:27:38Z)
• Deterministic Event-Graph Substrates as World Models for Counterfactual Reasoning [0.0]
  We study a class of world models that represent agent state as an append-only log of typed RDF triples and answer counterfactual queries by forking the log.<n>Substrates are inspectable at the triple level, support exact counterfactuals, and transfer across domains without learned components.
  arXiv  Detail & Related papers  (2026-05-15T13:58:31Z)
• How Far Is Document Parsing from Solved? PureDocBench: A Source-TraceableBenchmark across Clean, Degraded, and Real-World Settings [56.70440596502351]
  The past year has seen over 20 open document parsing models, yet benchmarks almost exclusively on OmniDocBench.<n>We present PureDocBench, a benchmark thatrenders document images from HTML/CSS, covering 10 domains, 66 pages, and 1,475 pages.
  arXiv  Detail & Related papers  (2026-05-08T09:30:31Z)
• NANOZK: Layerwise Zero-Knowledge Proofs for Verifiable Large Language Model Inference [0.0]
  We present METHOD, a zero-knowledge proof system that makes LLM inference verifiable.<n>Our approach exploits the fact that transformer inference naturally decomposes into independent layer computations.<n>Compared to EZKL, METHOD achieves 70x smaller proofs and 5.7x faster proving time at d=128, while maintaining formal soundness guarantees.
  arXiv  Detail & Related papers  (2026-03-17T04:14:45Z)
• Text2GQL-Bench: A Text to Graph Query Language Benchmark [Experiment, Analysis & Benchmark] [16.678372445240957]
  Text-to-Graph-Query-Language (Text-to-GQL) systems act as a translator, converting natural language into executable graph queries.<n>Existing datasets are often limited in domain coverage, supported graph query languages, or evaluation scope.<n>We present Text2GQL-Bench, a unified Text-to-GQL benchmark designed to address these limitations.
  arXiv  Detail & Related papers  (2026-02-12T09:16:44Z)
• Structured Context Engineering for File-Native Agentic Systems: Evaluating Schema Accuracy, Format Effectiveness, and Multi-File Navigation at Scale [0.0]
  Large Language Model agents increasingly operate systems through programmatic interfaces.<n>Yet practitioners lack empirical guidance on how to structure the context these agents consume.<n>We study 9,649 experiments across 11 models, 4 formats, and schemas ranging from 10 to 10,000 tables.
  arXiv  Detail & Related papers  (2026-02-05T08:39:05Z)
• Encyclo-K: Evaluating LLMs with Dynamically Composed Knowledge Statements [78.87065404966002]
  Existing benchmarks predominantly curate questions at the question level.<n>We propose Encyclo-K, a statement-based benchmark that rethinks benchmark construction from the ground up.
  arXiv  Detail & Related papers  (2025-12-31T13:55:54Z)
• VeriSciQA: An Auto-Verified Dataset for Scientific Visual Question Answering [53.662676566188175]
  A key bottleneck lies in the lack of public, large-scale, high-quality Scientific Visual Question Answering (SVQA) datasets.<n>We propose a verification-centric Generate-then-Verify framework that first generates QA pairs with figure-associated textual context.<n>We instantiate this framework to curate VeriSciQA, a dataset of 20,351 QA pairs spanning 20 scientific domains and 12 figure types.
  arXiv  Detail & Related papers  (2025-11-25T04:14:52Z)
• Eigen-1: Adaptive Multi-Agent Refinement with Monitor-Based RAG for Scientific Reasoning [53.45095336430027]
  We develop a unified framework that combines implicit retrieval and structured collaboration.<n>On Humanity's Last Exam (HLE) Bio/Chem Gold, our framework achieves 48.3% accuracy.<n>Results on SuperGPQA and TRQA confirm robustness across domains.
  arXiv  Detail & Related papers  (2025-09-25T14:05:55Z)
• One Thousand and One Pairs: A "novel" challenge for long-context language models [56.60667988954638]
  NoCha is a dataset of 1,001 pairs of true and false claims about 67 fictional books. Our annotators confirm that the largest share of pairs in NoCha require global reasoning over the entire book to verify. On average, models perform much better on pairs that require only sentence-level retrieval vs. global reasoning.
  arXiv  Detail & Related papers  (2024-06-24T02:03:57Z)
• LMGQS: A Large-scale Dataset for Query-focused Summarization [77.6179359525065]
  We convert four generic summarization benchmarks into a new QFS benchmark dataset, LMGQS. We establish baselines with state-of-the-art summarization models. We achieve state-of-the-art zero-shot and supervised performance on multiple existing QFS benchmarks.
  arXiv  Detail & Related papers  (2023-05-22T14:53:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.