minmax.pl : Inequalities, min & max (ground terms)
Inequality (lss, grt, neq, geq, leq), minimum and maximum constraints on ground terms are simplified (support for labeling).

How to use:
The following constraints are handled:
A lss B A less than B
A grt B A greater than B
A neq B A not equal to B
A geq B A greater or equal to B
A leq B A less or equal to B
A ~= B A not identical B
min(A,B,C) C is the minimum of A and B
max(A,B,C) C is the maximum of A and B
labeling uses labeling with minimum and maximum

Program: Change the code, then submit!

Console: Enter query or select example from below, then submit and wait for answer!

 Select example query: (Clear query) min(1,2,C). min(3,Y,1). min(X,1,1). A lss B, A grt B. A leq B, A geq B. A leq B, B grt A. min(A,B,C), max(A,B,C). min(3,Y,Z), min(Y,Z,M). min(A,B,C), A leq B. max(A,B,C), A lss C. min(A,B,C), max(B,C,D), min(C,D,A). min(A,B,C), min(B,C,A), min(C,A,B). min(A,B,C), A neq B. min(A,B,C), A neq B, labeling.

WebCHR help - CHR Website - (c) Copyrights Martin Kaeser Uni Ulm 2007