A boilerplate/proof-of-concept for a Rete Algorithm implementation in Elixir
-
Updated
Aug 26, 2023 - Elixir
A boilerplate/proof-of-concept for a Rete Algorithm implementation in Elixir
Simple RETE algorithm implementation
Rules Engine written in TypeScript implementing the Rete algorithm
GenPark AI Agent Skill - First-Order Logic (FOL) resolution theorem prover applying Most General Unification (MGU) and refutation proof trees.
GenPark AI Agent Skill - DPLL (Davis-Putnam-Logemann-Loveland) Boolean satisfiability solver with unit clause propagation and pure literal elimination for agent policy verification.
GenPark AI Agent Skill - DPLL (Davis-Putnam-Logemann-Loveland) Boolean satisfiability solver with unit clause propagation and pure literal elimination for agent policy verification.
GenPark AI Agent Skill - First-Order Logic (FOL) resolution theorem prover applying Most General Unification (MGU) and refutation proof trees.
GenPark AI Agent Skill - Constraint Satisfaction Problem (CSP) solver implementing Arc Consistency AC-3 and Minimum Remaining Values (MRV) backtracking search.
GenPark AI Agent Skill - High-speed forward chaining expert system implementing the Rete pattern matching algorithm across working memory facts.
GenPark AI Agent Skill - Constraint Satisfaction Problem (CSP) solver implementing Arc Consistency AC-3 and Minimum Remaining Values (MRV) backtracking search.
GenPark AI Agent Skill - High-speed forward chaining expert system implementing the Rete pattern matching algorithm across working memory facts.
GenPark AI Agent Skill - Linear Temporal Logic (LTL) symbolic model checker verifying safety (G), liveness (F), and response (G(p -> Fq)) across finite state transition graphs.
GenPark AI Agent Skill - Linear Temporal Logic (LTL) symbolic model checker verifying safety (G), liveness (F), and response (G(p -> Fq)) across finite state transition graphs.
Forward Chaining Rules compiler. RETE algorithm widely extended. Fastest implementation made in C++. Node side memories optimized with BTrees to ease matching
Lisa is a production rule system for Common Lisp, whose purpose is to provide a foundation for the development of "intelligent" applications. Lisa employs a modern CLOS implementation of Rete and is based on CLIPS and Jess.
Rule-based expert system (CLIPS + FastAPI) for off-grid renewable energy assessment in rural communities.
A curated list of forward- and backward-chaining rule engines, BRMS platforms, rule DSLs, and language-specific libraries.
⚡ Integrate type-safe TanStack Query with Eden Treaty for Elysia. Streamline data fetching while ensuring type safety and ease of use.
The Ops5 programming language for production systems
To associate your repository with the rete-algorithm topic, visit your repo's landing page and select "manage topics."