Converting FD front-end "mutex groups" into FSTRIPS functions

[miquelramirez]

We have been discussing the possibility of acquiring more succinct representations of the IPC benchmarks by re-using FD's powerful invariant inference components. The basic idea is that for every mutex group M that FD uncovers (set of ground predicates), we define automatically the tuple < f{M}, t{M}, M> where f_{M} is a function, t{M} is a type, and M become a set of constant objects of type t{M}.

TODO

[ ] Work out the TODO list

[miquelramirez]

@gfrances can you assign this task to me? tyvm

[gfrances]

Of course I can! :-)

[gfrances]

BTW, this would be really interesting and match perfectly with the other work we've been discussing on width-based algorithms, which I'm starting to work on right now....

[miquelramirez]

tuve +1