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,

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.

This avoids coalg from segfaulting.

  - Add ENFORCES/ALLOWS to formula type
  - Add HCENFORCES/HCALLOWS to hcFormula_node type
  - Add EnforcesF/AllowsF to formulaType type
  - Add CoalitonLogic to the list of functors ("sorts")
  - Parse [{ }] and <{ }> terms
  - Do hashing of those
  - And decompose them and save list of agents as arrays

Note that it is not possible to split this commit into separate commits
such that the code in between these still compiles.

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

It contains the most current tarball created by the original author
Florian Widmann.