Parsing: Decomposition Schema Semantic Checks

recardona commented 8 years ago

After parsing, there are several semantic checks I need to perform:

[x] A decomposition's action functor (the identifier next to the :decomposition tag) must reference an :composite: t action in the domain.
[x] Every step specified in the decomposition body must correspond to an actual action in the domain.
[x] Every step specified in the decomposition body must be semantically correct w.r.t. its domain definition (correct number of arguments, of the correct type)
[x] The orderings specified in the decomposition body must be consistent (no step ordered after another may be ordered before the same step, and this extends through the transitive closure of orderings)
[x] The decomposition schema's parameters and bindings must agree with the abstract step it applies to.

Every link/ordering specified in the decomposition body must adhere to the following:

[x] The ids for steps must match those defined in the :steps tag.
[x] The causal establisher must be an effect of the source, and a precondition of the sink (including the dummy start and end steps)
[x] There must exist a causal path from each of the dummy initial step's effects to a precondition of the dummy goal step.

recardona commented 8 years ago

Commit https://github.com/recardona/Decompositional-VHPOP/commit/223b11aa05d55b3452287e40c02104e4e0e954d5 added ordering consistency checking to the parsing code

recardona commented 8 years ago

I realized that the semantic check I implemented was only partially complete - the true criteria is that there must exist a causal path from each of the dummy initial step's effects to a precondition of the goal step.

recardona commented 8 years ago

Commit https://github.com/recardona/Recurve/commit/c973cd81bf88f3e19ad09040d2452ec2ad37996f added the check for Young, Pollack, and Moore's legality criteria

recardona / RecurveCPP

Parsing: Decomposition Schema Semantic Checks #4