This space is for the collaborative development and improvement of specifications for Referent Tracking (RT).

Hybrid System Hypothesis: If we could always (and inexpensively) query with filtering on the instant of our graphdb relations, could we store the D-tuple collection in a relational database? (The foreign key could be an annotation.) Would that simplify graph representations of RT? RT is all about who's, but the what's and the when's may be functional subsystems anyway. I am probably suggesting that the audit system can be separate from the state (which may seem a bad approach to "integrated" or "native" paradigms), but here, with the caveat that the state can be "natively" reproduced for every addressable instant. Integration can happen in the user interface (with a persistent column that says "Why?" of course). It's the meta-facts that insist on reification. -Roger

Forms and metadata are suspected of being tabular (dense). -Roger

We have the following ongoing RT projects:

Improvement of metadata templates
Graph database representation
Develop denotational bonds
Realist configurations
RT UIs

The following papers are recommended reading:

Recent space activity

Space contributors

No contributors found for: authors on selected page(s)

Browser not supported