I implemented this change and tested it on the suite optimal_with_ipc11(). I
added the scatterplots for number of landmarks and search time. Interestingly
enough there are in most cases less disjunctive landmarks over finite domain
variables found then over PDDL predicates.
The results for satsificing will follow...
This is a follow up to issue289.
There Malte wrote:
"After we fix this, I suggest that we also look at different ways of restricting
which disjunctive landmarks to allow rather than looking at predicate names.
Using predicate names always looked like a bit of a hack to me, since the search
component of the planner is otherwise based on the finite-domain representation
of the planner, which has no such thing. I'd like to see what happens if we look
at other criteria instead, e.g. only allowing disjunctive landmarks where all
facts refer to the same finite-domain variable."