v0.1.0

Announcing rule-engine v0.1.0! 🎉

I am thrilled to announce the first official release of rule-engine, a lightweight and extensible Python library for defining and evaluating propositional logic rules.

This library provides a simple yet powerful alternative to complex tools like BDDs or SAT solvers, making it a great choice for developers looking to build simple, transparent, and efficient rule-based applications. It is a direct implementation of the concepts from State Algebra, offering an intuitive algebraic approach to logical inference.

Key Features in This Release:

• Intuitive Rule Definition: Write complex logical rules as simple strings (e.g., "(sky_is_grey && humidity_is_high) => it_will_rain").

• Powerful Compilation: An intelligent compile() method transforms your entire rule set into a single, optimised "knowledge base."

• High-Performance Core: The engine is backed by highly optimised data structures and algorithms, including heuristic-based compilation and efficient state reduction routines.

• Fast Inference: Perform predictions against the compiled knowledge base with new evidence to get instant results.

• Comprehensive Support: The project includes a full test suite, usage examples, and documentation to get you started.

This release marks a solid foundation for the library. I welcome you to explore the code, try out the examples, and share your feedback.

Thank you for your interest and support!