Reactor is a small library written in Kotlin and Java, which implements the extended semantics of Constraints Processing System. Its main features are:
- native support for terms and unification
- observable logical variables
- fast lookup of matching constraint rule from constraint’s arguments
- Rete-like algorithm for finding potential matches
Unification is implemented according to a “near-constant time” algorithm1. Occurs check is done on terms being unified to avoid infinite terms.
A trie (a prefix tree) on flattened terms2 is used for indexing constraint rules by constraint symbol and arguments.
Search for matching constraint rules is implemented with a trie, with each node corresponding to a partially matched constraint rule. Each constraint activation or disposal event updates this trie. The leaves correspond to fully matched constraint rules.
Persistent structures used for implementing internal state, which are useful for tracking and restoring the state of constraints program.
Nested logical variables
Logical variables serving as constraint arguments trigger reactivation of such constraints on any change, such as value bound or parent changed. Might be a good idea to also trigger reactivation on changed variable contained in a term, which serves as a constraint argument.
Restoring the state of logical variables
One of the extensions supported by this implementation is the alternative body branches. The state of constraints store that is valid for the stack frame corresponding to triggering a constraint rule, before activating body constraints, can be restored, but the state of logical variables is unpredictable. This may lead to unexpected results.