awesome-repositories.com
Blog
MCP
awesome-repositories.com

Discover the best open-source repositories with AI-powered search.

ExploreCurated searchesOpen-source alternativesSelf-hosted softwareBlogSitemap
ProjectMCP serverAboutHow we rankPress
LegalPrivacyTerms
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com

Inference engine

Ranking updated Jul 4, 2026

For an open source engine for model inference, the strongest matches are hyperjumptech/grule-rule-engine (This is a rule engine implementation in Go, which), oracle-samples/clara-rules (Clara Rules is a forward-chaining rule engine in ClojureScript) and jruizgit/rules (This repository appears to host rule engine implementations topics). mxgmn/markovjunior and ysymyth/react round out the shortlist. Each is ranked by relevance to your query, popularity and recent activity.

Explore the best open-source inference engines. Compare top-rated implementations by activity and features to find the best fit for your project.

Inference engine

Find the best repos with AI.We'll search the best matching repositories with AI.
  • hyperjumptech/grule-rule-enginehyperjumptech avatar

    hyperjumptech/grule-rule-engine

    2,505View on GitHub↗

    Grule is a business rule engine for Go that decouples complex decision-making logic from core application code. It provides a framework for defining, versioning, and executing business rules through a domain-specific language, allowing logic to be managed independently of the underlying software implementation. The engine distinguishes itself by utilizing a formal grammar-based parser and a Rete-inspired pattern matching algorithm to evaluate logic against data facts efficiently. It supports dynamic system modeling by enabling runtime updates to policies and providing thread-safe knowledge ba

    This is a rule engine implementation in Go, which directly matches the search for inference logic and rule-based systems, but it does not specify support for Rete, forward/backward chaining, or other detailed features mentioned.

    GoRete Algorithm Implementations
    View on GitHub↗2,505
  • oracle-samples/clara-rulesoracle-samples avatar

    oracle-samples/clara-rules

    1,231View on GitHub↗

    Clara Rules is a declarative logic programming library and business rules management system designed for Clojure and Java applications. It functions as a forward-chaining inference engine that evaluates business logic by matching data patterns against defined rules, allowing developers to derive new information and trigger automated actions based on the current state of a fact set. The engine utilizes a directed acyclic graph for pattern matching, which enables efficient evaluation across complex rule sets. It incorporates a truth maintenance system that tracks dependencies between facts and

    Clara Rules is a forward-chaining rule engine in Clojure(Script), making it a genuine rule-based inference engine for automated reasoning, though it does not explicitly advertise backward chaining or the Rete algorithm in its brief description.

    ClojureRete Algorithm Implementations
    View on GitHub↗1,231
  • jruizgit/rulesjruizgit avatar

    jruizgit/rules

    1,293View on GitHub↗

    This project is a business rules and complex event processing engine designed to manage logical decision-making and stateful workflows. It functions as a computational framework that evaluates incoming data streams and facts against conditional logic to derive new conclusions and trigger automated actions. The engine distinguishes itself through a combination of forward-chaining inference and deterministic state machine orchestration. It uses salience-based conflict resolution to prioritize rule execution and supports persistent contextual state tracking to manage long-running business proces

    This repository appears to host rule engine implementations (topics include "rete", "business-rules", and "durable-rules"), so it directly provides the inference logic and production rule support needed for automated reasoning.

    JavaScriptBusiness Rule EnginesBusiness Process OrchestrationComplex Event Processing Engines
    View on GitHub↗1,293
  • mxgmn/markovjuniormxgmn avatar

    mxgmn/MarkovJunior

    8,133View on GitHub↗

    MarkovJunior is a probabilistic programming language and constraint propagation engine designed to generate sequences based on probabilistic rules. It utilizes a pattern matching rewrite system and a probabilistic inference tool to manage state and ensure that generated runs reach defined goal states. The system distinguishes itself through the use of wave-based superposition to track possible value assignments and prune impossible states. It employs a pattern matching rewrite system to transform specific sequences of values within multi-dimensional grids into new states. The framework suppo

    MarkovJunior is a probabilistic programming language and constraint propagation engine for grid-based generation, not a traditional rule-based inference engine with forward/backward chaining or Rete algorithms. It uses pattern-matching rewrite rules for procedural synthesis rather than deductive reasoning over a knowledge base, so it sits in a neighbouring category.

    C#Goal-Directed
    View on GitHub↗8,133
  • ysymyth/reactysymyth avatar

    ysymyth/ReAct

    4,011View on GitHub↗

    ReAct is an agentic workflow template and prompting framework for large language models. It implements a logic pattern that integrates chain-of-thought reasoning with external tool execution to solve complex, multi-step tasks. The framework uses an interleaved reasoning and acting logic, forcing the model to document its internal thought process before executing an action. This cycle of planning and acting allows the system to interact with external APIs or databases and inject real-world data back into the model context to refine reasoning paths. The project covers autonomous task execution

    ReAct is an LLM prompting framework for agentic reasoning, not a rule-based inference engine with forward/backward chaining or Rete algorithms, so it does not fit the traditional rule-engine category.

    Jupyter NotebookReasoning-Action Loops
    View on GitHub↗4,011
  • norvig/paip-lispnorvig avatar

    norvig/paip-lisp

    7,465View on GitHub↗

    This project is a comprehensive Lisp AI implementation library that provides reference implementations for various artificial intelligence paradigms and symbolic algorithms. It functions as a multi-purpose toolkit containing a logic programming engine, a natural language processing suite, and a symbolic mathematics toolkit. The library is distinguished by its diverse architectural frameworks, including a Prolog-style execution engine that uses unification and goal-driven backtracking, and a system for simulating human decision-making through expert system shells and certainty factors. It also

    This repo is a Lisp library of AI implementations from the PAIP book, including a Prolog-style logic engine and expert system shells, but it is a reference collection of examples rather than a dedicated rule engine with explicit Rete algorithm and forward chaining.

    Common LispBackward Chaining EnginesProduction RulesExpert System Shells
    View on GitHub↗7,465

Related searches

  • Type inference utilities
  • an open source game engine architecture
  • Workflow orchestration engine
  • AI assistant framework
  • Machine learning models
  • an open source workflow execution engine
  • Reference architecture examples
  • LLM inference and serving