Deterministic Domain Graphs: A Category of Graphs with Closed-World Semantics
This work introduces Deterministic Domain Graphs (DDGs), a category of graphs defined by closed-world semantics and deterministic construction. The paper formalizes the defining properties of DDGs, contrasts them with existing graph categories, and discusses their applicability and limitations. This version is released as a preprint to establish priority and enable early feedback. A substantially revised version is expected to be submitted to a peer-reviewed journal.
Authors
- Hussain Hammad
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-01-26
- DOI
- https://doi.org/10.5281/zenodo.18373053
- Primary Topic
- Model-Driven Software Engineering Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00