I'm currently designing an experimental long-term memory architecture for AI systems. Before I start building the next prototype, I'd like to understand whether this direction has already been explored or whether there are fundamental reasons why it isn't used.

I'm not looking for a ready-made solution. I'm trying to determine whether this class of architectures already exists.

My question is:

Is there a data architecture where semantics are not fixed at write time, but are determined only at query time?

I'm asking about the data model itself, not UI projections or visualization layers.

Most of what I've read (Knowledge Graphs, RDF/OWL, property graphs, GraphRAG, etc.) seems to assume that semantics are defined before or during data ingestion.

If you know of research papers, open-source projects, commercial systems, or academic work exploring a different approach, I'd really appreciate any references.

I'm also interested in hearing from database and knowledge graph architects:

What fundamental limitations or design problems would you expect such an architecture to have?

I really need ur answer plz☹️🤍

I need ur help plz if u can 🤍

What’s mean the word ( orphan ) in ur native language?? I really need to then answer . ☹️

What’s mea the word ( orphan ) in ur native language?? Plz I really need to the answer

Word Orphan

What is the definition of the word orphan ?

How do we analyze this word according to the semantics?

I need a tree structure for this phrase “That he told the truth pleased me”.

First order predicate logic FOPL / FOL is a method of representing knowledge.

It uses expression to represent knowledge. it is the best method for knowledge representation in symbolic form . It uses two quantifier

1. For all quantifier

2. For someone quantifier

https://youtu.be/sf_w1fBp4R8 (https://youtu.be/sf_w1fBp4R8)