The OpenCog (hyper-)graph database and graph rewriting system
-
Updated
Oct 28, 2025 - C++
The OpenCog (hyper-)graph database and graph rewriting system
C++/Wolfram Language package for exploring set and graph rewriting systems
[NO LONGER MAINTAINED, SUPERSEDED BY https://github.com/trueagi-io/chaining]. Unified Rule Engine. Graph rewriting system for the AtomSpace. Used as reasoning engine for OpenCog.
Purely local graph rewrite system for the SKI combinator calculus, in chemlambda style.
🧩 Design-Information-Modeling for Kit-of-Parts 🏘️
Molecular computers with interaction combinators like graph rewrite systems
Project hapax
Zip slip smash (zss) is Zipper logic revisited
Ocaml library for Grew (graph rewriting for NLP)
simple labelled graph rewriting for .NET
landing page for all chemlambda related projects
(WIP) An incomplete, Tamerlane-like graph-rewriting language
Recursive meta-graph game engine. Fork reality, merge timelines, get perfect determinism. Built on category theory, powered by graph rewriting.
A small test for grammar rewriting for procedural content generation.
A lightweight and multi-threaded Interaction Combinators implementation in Rust
BiGGer is a transformation tool and library that translates bigraphical models and rules to GrGen.NET-compatible files. It enables bigraph rewriting using GrGen.NET.
Add a description, image, and links to the graph-rewriting topic page so that developers can more easily learn about it.
To associate your repository with the graph-rewriting topic, visit your repo's landing page and select "manage topics."