- From: Manu Sporny <msporny@digitalbazaar.com>
- Date: Fri, 20 Feb 2026 16:20:25 -0500
- To: Daniel Ramos <capitain_jack@yahoo.com>
- Cc: public-cogai <public-cogai@w3.org>, public-kg-construct@w3.org, public-webmachinelearning@lists.w3.org, public-aikr@lists.w3.org, semantic-web@w3.org, w3c-wai-ig@w3.org, public-immersive-web@w3.org, public-json-ld-wg@w3.org
On Fri, Feb 20, 2026 at 4:10 PM Daniel Ramos <capitain_jack@yahoo.com> wrote: > **Interoperability and Compression**: PM-KR complements RDF/JSON-LD by providing procedural execution semantics and compression through symlink-style composition. > ### 🤖 For AI & Machine Learning Communities > - **Compression without information loss**: Symlink-style composition reduces duplication while preserving semantic fidelity Current work that is happening in that general space: https://w3c.github.io/cbor-ld/#abstract https://lists.w3.org/Archives/Public/public-json-ld-wg/2020Jul/att-0004/Introduction_to_CBOR-LD.pdf We'd love to see a more generalized solution to build the compression tables (your focus). > ### 🕸️ For Knowledge Graph Communities > **Graph Compression and Execution**: PM-KR complements property graph and RDF graph approaches by introducing procedural canonicalization—storing graph patterns as reusable procedures rather than duplicating structure. Related, but not the same: https://www.w3.org/TR/rdf-canon/ This work could benefit from different, efficient c14n mechanisms where we could digitally sign over "transcluded graphs" built from procedural c14n. Might be useful for very large and repetitive W3C Verifiable Credentials. Exciting work, wish I had the bandwidth to more directly participate -- will be cheering from the sidelines. :) -- manu -- Manu Sporny - https://www.linkedin.com/in/manusporny/ Founder/CEO - Digital Bazaar, Inc. https://www.digitalbazaar.com/
Received on Friday, 20 February 2026 21:21:06 UTC