About the 1-outdegree rules testd in dILP

google / neural-logic-machines

Implementation for the Neural Logic Machines (NLM).

Apache License 2.0

281 stars 48 forks source link

Open JiangZhaoh opened 3 years ago

JiangZhaoh commented 3 years ago

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!