A modern Object-oriented implementation of Constraint Handling Rules in Java.

CHR was created by Thom Frühwirth in 1991 and consists of constraints and rules that are applied to them. There are 3 types of rules:

• Propagation: Head ==> [Guard | ] Body.
• Simplification: Head <=> [Guard | ] Body.
• Simpagation: Head1 \ Head2 <=> [Guard | ] Body.

Head and body can each consist of several constraints. The Guard is the admission requirement for the constraints from the Head. The constraints from the body get added to the existing set of constraints. A Simplification removes the complete head. The Simpagation removes only Head2 and Propagation keeps the constraints of the Head in the original set. More information about CHR can be found in Wikipedia, in the Prolog documentation and in this introduction.

This project is an object-oriented implementation of CHR only in Java without extra compilation. That makes it possible to use Java objects in the CHR program. Some algorithms are really short or really fast when implemented in CHR, e.g. its possible to create a non-recursive greatest common divisor (GCD) algorithm that computes the GCD of a any quantity of numbers. Or you can use some CHR rules for an ai in a game, use the rules just to check if some special conditions are met for some objects, reason from data or analyse text or lexicographic tokens. With Java the CHR rules can not be just used for primitive data types but also for very complex objects and data.

An algorithm that applies Rule's to a set of Constraint's. Takes some Rules's as varargs.

Rule consist of guard and body, the number of constraints in the head(s) is specified in the constructor. The .guard() method gets a lambda with boolean as return type as parameter and the body() method gets a lambda without return type (void) as parameter. More information can be found in the Body or the Guard interface.

The head of the rule is defined

A generic class which holds a value that is specified via the constructor. The get() method returns the internally stored object.

Rules can be created by instantiating the right rule object and setting guard and body with lambda functions. Greatest Common Divisor example:

Rule rule1 = new Simplification(1 /* The number of constraints in the head */)   
        .guard(head -> (int) head[0].get() == 0) // head is an array with constraints  
        .body((head, newConstraints) -> {/* empty body in Simplification just deletes the head */});  
 
Rule rule2 = new Simpagation(1 /* n constraints in head1 */, 1 /* n constraints in head2 */ )   
        .guard((head1, head2) -> (int) h1[0].get() > 0 && (int) h1[0].get() <= (int) h2[0].get())
        .body((head1, head2, newConstraints) -> {   
            int n = (int) x1[0].get();   
            int m = (int) x2[0].get();   
            newConstraints.add(m % n);    
            // All constraints that should be added to the other constraints are added to this list.
        });

or:

Rule rule1 = new Simplification(Integer.class)   
        .guard(head -> (int) head[0].get() == 0) // head is an array with constraints 
        .body((head, newConstraints) -> {/* empty body in Simplification just deletes the head */});  
 
Rule rule2 = new Simpagation(1 /* n constraints in head1 */, Integer.class, Integer.class)   
        .guard((head1, head2) -> (int) h1[0].get() > 0 && (int) h1[0].get() <= (int) h2[0].get())
        .body((head1, head2, newConstraints) -> {   
            int n = (int) x1[0].get();   
            int m = (int) x2[0].get();   
            newConstraints.add(m % n);    
            // All constraints that should be added to the other constraints are added to this list.
        });

Now we can create a RuleApplicator with the rules:

RuleApplicator applicator = new SimpleRuleApplictaor(rule1, rule2);

Apply the rule to constraints. Calculating the greatest common divisor of some numbers:

RuleApplicator result = applicator.execute(42, 1337, 8080);
System.out.println(result);

applicator.execute(...) returns a List of constraints.

More examples can be found in the examples package and in the tests. The package webserver contains a https webserver implemented with CHR rules.

To use the library you can download the JavaCHR-.jar file and use it as library for your project. Here is how to use it for gradle and for IntelliJ.

• Union Types for the Head objects
• Hashing in Constraint Store
• RuleApplicator with Refined Operational Semantics