For the case of two (or more) diamond formulas who all mention the full
agent list, no rule was created, because the former CL algorithm only
created rules for proper subsets of the agent list. This adds the
missing rule and lets cool correctly answer the following query:

    $ ./coalg.native sat CL --agents '1' <<< '(~[{1}] p) & ~[{1}] ~p'
    unsatisfiable

The actual box of PML (in GMLMIP) is: less probable than. The Diamond
is: At least Probable than.

So now you have ¬[p] C = <p> C.

Introduce a new generic data type lazylist, e.g. used for lazy rule
enumerations.

Propagation of satisfiability and unsatisfiability does not cover
disjunctions and I don't get how propagation works, so I won't touch it
yet. So this reverts the only partially implemented Disjunctive
ruleEnumerations,

Insert a formula into a bitset without checking for a contradiction. The
former addBS performed a contradiction-check using MiscSolver.arrayNeg
which is a array of size 0 due to not being initialized.

For some reasons this bug only could be triggered when building with
oasis and not with the old Makefile, though arrayNeg being of size 0 in
both cases.

This fixes #12.

It's, because the repo lacks it.

This should simplify writing the actual rule for GML.

The actual for GML is still missing.

It really is empty, while bsetMake creates a bset only containing True.

The rule creator for MultiModalKD does not do anything but calling the
one of MultiModalK.