Description[edit | edit source]
Combination Algorithm Writer (CAW) finds combinations of rules, not dictionary algorithms (CAWP) or self-referring or referring to created predicates (CAWMP). Rules are command names and number of inputs and number of outputs. CAW and CAWP are deprecated and the current version is CAWMP.
Odd Results[edit | edit source]
CAW produces odd results that are repeating decomposing and building steps when not in either given either decomposing or building rules.
Optional Bounds[edit | edit source]
Because CAW produces the first simplest solution to a specification, additional bounds must be configured to arrive at a solution with a certain number of variables and a certain number of commands.