minimal disjunctions is an UD (under development) project where a disjunction of facts is computed to be the minimal disjunction that covers all achievers of a fact landmark (subset cover problem). This is an idea to use disjunctive landmarks in Pytrich.
minimal disjunctions is an UD (under development) project where a disjunction of facts is computed to be the minimal disjunction that covers all achievers of a fact landmark (subset cover problem). This is an idea to use disjunctive landmarks in Pytrich.