The work shows a hardware realization of ternary logic by encoding domain-scoped assertions in memristive junctions and demonstrates it via simulation of an ICD-11 respiratory disease classification chip.
Domain-constrained knowledge representation: A modal framework
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
abstract
Knowledge graphs store large numbers of relations efficiently, but they remain weak at representing a quieter difficulty: the meaning of a concept often shifts with the domain in which it is used. A triple such as Apple, instance-of, Company may be acceptable in one setting while being misleading or unusable in another. In most current systems, domain information is attached as metadata, qualifiers, or graph-level organization. These mechanisms help with filtering and provenance, but they usually do not alter the formal status of the assertion itself. This paper argues that domain should be treated as part of knowledge representation rather than as supplementary annotation. It introduces the Domain-Contextualized Concept Graph (DCG), a framework in which domain is written into the relation and interpreted as a modal world constraint. In the DCG form (C, R at D, C'), the marker at D identifies the world in which the relation holds. Formally, the relation is interpreted through a domain-indexed necessity operator, so that truth, inference, and conflict checking are all scoped to the relevant world. This move has three consequences: ambiguous concepts can be disambiguated at the point of representation; invalid assertions can be challenged against their domain; cross-domain relations can be connected through explicit predicates. The paper develops this claim through a Kripke-style semantics, a compact predicate system, a Prolog implementation, and mappings to RDF, OWL, and relational databases. The contribution is a representational reinterpretation of domain itself. The central claim is that many practical failures in knowledge systems begin when domain is treated as external to the assertion. DCG addresses that by giving domain a structural and computable role inside the representation.
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Embedding domains structurally in predicate arity creates representation-computation unity where data performs domain-scoped inference automatically via closure, inheritance, and cycle detection.
DALM is a proposed language model architecture that enforces algebraic constraints via a three-phase process over domain lattices to prevent cross-domain knowledge contamination during generation.
A five-layer computable graph architecture makes domain an explicit first-class parameter, yielding domain-scoped pruning, substrate-agnostic operations, and transparent inference with reliability conditions C1-C4.
citing papers explorer
-
Ternary Memristive Logic: Hardware for Reasoning Realized via Domain Algebra
The work shows a hardware realization of ternary logic by encoding domain-scoped assertions in memristive junctions and demonstrates it via simulation of an ICD-11 respiratory disease classification chip.
-
Reasoning as Data: Representation-Computation Unity and Its Implementation in a Domain-Algebraic Inference Engine
Embedding domains structurally in predicate arity creates representation-computation unity where data performs domain-scoped inference automatically via closure, inheritance, and cycle detection.
-
DALM: A Domain-Algebraic Language Model via Three-Phase Structured Generation
DALM is a proposed language model architecture that enforces algebraic constraints via a three-phase process over domain lattices to prevent cross-domain knowledge contamination during generation.
-
Domain-Contextualized Inference: A Computable Graph Architecture for Explicit-Domain Reasoning
A five-layer computable graph architecture makes domain an explicit first-class parameter, yielding domain-scoped pruning, substrate-agnostic operations, and transparent inference with reliability conditions C1-C4.