About the 1-outdegree rules testd in dILP

[JiangZhaoh]

Hi, I'm trying to reproduce your evaluation for dILP in supervised tasks. But I'm stucking in designing the rules for task 1-outdegree for dILP.

• For 1-outdegree, the rules can be: But how should we express it in dILP? which auxiliary predicates should we use to express the meaning: for all nodes c, which is unequal to b, and has no edge with node a?

I'll appreciate it if you can give me some suggestions!