acceptodds
Under review as a conference paper at ICLR 2027

Differentiable Inductive Logic Programming with Unbound Logic

Abstract

Differentiable inductive logic programming is an emerging area where logical rules are learned by differentiable models. The fundamental principle behind existing methods is relaxing forward chaining, a symbolic deduction procedure, into a continuous space. However, these methods rely on bound truth values and/or selective fuzzy logic operators, which suffer from gradient vanishing or imbalanced gradient flow. To this end, we propose using unbound logic, where truth values are further relaxed into unbound real numbers and fuzzy logic operators are non-selective, which theoretically alleviates the local gradient issues. Experiments show that our method achieves superior performance on inductive logic programming tasks. In addition, we explore combining neural perception networks with our fully differentiable logical models, resulting in an end-to-end differentiable model that achieves comparable performance with non-end-to-end visual ILP methods.

Primary area:
neurosymbolic & hybrid AI systems (physics-informed, logic & formal reasoning, etc.)
Keywords:
Inductive Logic Programming, Unbound Logic, Neuro-Symbolic AI

Reviews

Among:
Shape:
1234this paper, Top 30%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.67 over 3 reviews, above 70% of the others.
Reviewer_ugLsOpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

The paper brings shifted Łukasiewicz unbound logic, a recent logic from the mathematical fuzzy logic community whose truth values range over all of R, into differentiable ILP. The first contribution is LuHorn. LuHorn forward chaining scores conjunction, rule aggregation, step aggregation and existential quantification all as sums, and uses a hard min-based gate to decide whether a ground rule fires. Theorem 4.1, proved in Appendix A, shows that the Boolean projection of this procedure recovers the classical least Herbrand model. The second contribution is DiffLu. It replaces each rule with a nonnegative weight vector over a fixed set of first-order features, folds the gate into those weights, iterates the summed update, and trains with a clipped hinge-like loss on the fixed-point valuations. Symbolic rules are recovered afterwards with a ratio-based top-K cutoff. The third contribution is vDiffLu, which puts slot attention and a bilinear fact converter in front of DiffLu and trains everything end to end with no object-level annotations. On the 17 ∂ILP benchmark tasks, DiffLu reaches a mean success rate of 84.1 against 77.6 for HRI. On Kandinsky and CLEVR-Hans3, vDiffLu averages 87.64 and 95.22, compared with 93.72 and 97.38 for αILP, which uses pretrained perception.

Critical strengths
  1. A clean correctness result for a real-valued forward-chaining procedure. Appendix A splits rule applicability, the min gate, from value propagation, the additive payload, and proves through Lemmas A.3 to A.5 and Proposition A.6 that the Boolean projection catches up with classical TP within two updates and converges to LM(P). I went through the induction, the delayed-activation counterexample on p. 17, lines 876 to 882, and the termination argument, and found no gaps. This matters because it shows unbound Łukasiewicz conjunction can be reconciled with Horn semantics, which a reader from the fuzzy logic side would otherwise doubt, given that additive conjunction does not preserve falsity, p. 15, lines 756 to 762.

  2. End-to-end visual ILP with no intermediate annotations, at competitive accuracy on CLEVR-Hans3. vDiffLu trains slot attention from scratch together with the rule learner, p. 7, lines 357 to 359, and comes within about 2 points of αILP on average, 95.22 against 97.38, while using about 5 percent of αILP's memory according to p. 9, line 469. Removing the need for object-level supervision is the main practical barrier for αILP and NEUMANN, so a credible result here would matter to the neuro-symbolic vision community.

Critical weaknesses
  1. The mechanism the paper claims is never isolated, and the theory does not cover the trained model. The abstract and introduction motivate everything with local gradient pathologies: vanishing gradients for product operators and selective routing for Gödel and Łukasiewicz, p. 1, lines 045 to 050. The only support offered is the analytic gradient column of Table 1, p. 2. Gradient 1 for a sum is true by construction and says nothing about whether training improves. The paper itself concedes on p. 20, lines 1043 to 1045, that global gradient issues are left open, but even the local claim is untested. There is no ablation that keeps the DiffLu architecture, features and loss fixed and swaps the sum aggregators for max or product, no gradient norm diagnostics, and no comparison of training curves. On top of that, Theorem 4.1 applies to Eq. 5 with its hard gate, while DiffLu in Eq. 7 states that "The gates in Eq. 5 are absorbed into the learnable weights", p. 6, line 319. The authors concede on p. 20, lines 1047 to 1051, that the relaxation "may be not well-formed". Without the gate, each head is a nonnegative linear combination of feature valuations summed over every grounding of the existential variables. That makes it a counting threshold function, not a conjunction, and the paper never explains how it avoids being swamped by the many false groundings at value -1 or how valuations stay bounded over recursive steps. As things stand, the contributions are a correct theorem about a procedure nobody trains and an empirical model whose benefits are not traced to the claimed cause.

  2. The empirical advantages are narrower than the abstract claims, and the visual comparison is not reliable. Table 2 on p. 8: DiffLu averages 84.1, ∂ILP 83.7 and LRI 81.2. I recomputed all six averages from the per-task entries and they match. The "6.5 percentage points" headline on p. 8, line 428, and p. 9, lines 478 to 479, only holds once ∂ILP and LRI are excluded as "not directly comparable". Against ∂ILP, the margin is 0.4 points over 17 tasks with "at least 10 random seeds", p. 8, line 423. DiffLu scores 0 on Cyclic and Len, where ∂ILP scores 100 and 92.5, and gains mainly on Adjacent, EvenSucc, Buzz and Fizz, by 49.5, 51.5, 55 and 30 points. That is a trade, not the dominance that "superior performance" in the abstract, line 018, suggests. DiffLu also drops auxiliary predicates and uses longer bodies, p. 4, footnote 3, and p. 20, lines 1057 to 1061, so the comparison with ∂ILP and HRI mixes language bias with the operator choice. The MSE criterion on p. 8, lines 424 to 427, follows the ∂ILP convention and is applied to the clipped continuous valuations, so Table 2 says nothing about whether the extracted symbolic programs are correct, and no learned rules are shown. DiffLu's hyperparameters, meaning V, R, the number of steps and τ, are never reported, even though p. 3, lines 130 to 131, says they are tuned per task. In Table 3, p. 9, the rerun NEUMANN numbers are at or near chance on red triangle and two pairs, 54.68 and 51.21, and have a standard deviation of 24.69 on closeby. That suggests a failed reproduction, which weakens any claim to be comparable to NEUMANN. αILP shows a standard deviation of 0.00 on every Kandinsky task. vDiffLu trails αILP by 37 points on twopairs. On CLEVR-Hans3, vDiffLu is run as "three binary classification problems", p. 9, line 457, while the CNN baseline does "3-way classification", p. 19, line 1017, so at least that comparison mixes two task formats. The confounder-free test split is skipped, p. 9, lines 458 to 459, so results come from validation data that carry the same confounders as training. CLEVR-Hans3 exists precisely to test that split, and for a model whose slots and predicates have no supervised meaning, p. 21, lines 1082 to 1084, high validation accuracy could easily come from shortcuts. On related work, Logical Neural Networks, which use weighted Łukasiewicz operators, dNL-ILP by Payani and Fekri 2019, Neural Logic Machines, Logic Tensor Networks, DRUM and TensorLog are all missing, and Payani and Fekri appear only through their 2020 reinforcement learning paper, as are end-to-end perception-plus-logic systems such as DeepProbLog and Scallop. These belong in the paper, since sum-based path aggregation and Łukasiewicz-style differentiable rules both have precedent there.

Questions for authors
  1. Can you add a controlled ablation: the same DiffLu features, loss, initialization and seeds, with sum replaced by max for S, R and ∃, and with product or Łukasiewicz conjunction, on all 17 tasks? Please include gradient norm statistics per layer and step. A clear gap would go a long way toward supporting the paper's thesis.
  2. Is success in Table 2 computed by running classical forward chaining on the extracted symbolic program, or on the continuous DiffLu valuations? If it is the latter, what are the success rates for the extracted programs, and can you list the learned rules for Fizz, Buzz and EvenSucc?
  3. Please report V, R, the number of forward steps, τ, the optimizer and the tuning budget for each task, and explain how valuations are kept from blowing up under summed recursive aggregation without the gate.
  4. The NEUMANN reruns are near chance on two Kandinsky tasks. How do your αILP and NEUMANN reruns compare with the results published in Shindo et al. 2023 and 2024, and which Kandinsky split does Table 3 report? Would you also evaluate on the CLEVR-Hans3 test split and in the same 3-way setting as the CNN baseline?
  5. On p. 9, line 469, the memory figure is about 5 percent of αILP. Can you give a measured table of peak memory and wall clock for each method?
Reviewer_fiS1OpenReview ↗
Rating
3
Confidence
1
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

A differentiable method is proposed to improve upon the performance of a series of inductive logic programming benchmarks.

Critical strengths

I am not an expert in Inductive Logic Programming, and so I had some difficulty following parts of this paper. Nevertheless, I found the paper to be well written and thorough, and the work itself seemed correct. My sense is that this is an important application of ML that will have increasing importance, as the neuro-symbolic approach evolves.

Critical weaknesses

None.

Questions for authors
  1. Table 2 refers to Sec. 2.1, for an explanation as to why certain of the methods are no directly comparable. Reading back through Sec. 2.1, it seems that there are a variety of such reasons. It would be beneficial if some columns could be added to this table to indicate the categories of such approaches (i.e. ablation-style). Also, the units that are being reported should appear on the Table caption.

  2. Table 3 also does not indicate the quantity being reported in the caption. Its not clear why multiple entries are bolded per column - does this indicate that they are so similar as to be essentially the same? If so, this is a non-standard approach at presenting results, which usually shows the second-best result underlined.

  3. Also in Table 3, there is no thorough explanation as to why vDiffLu performs relatively poorly on the "two pairs" category.

Reviewer_bVeMOpenReview ↗
Rating
3(+1)
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

The paper addresses local gradient pathologies in differentiable inductive logic programming: product-based fuzzy operators cause vanishing gradients, while min/max-based operators are selective and route gradients through a single input. The proposal is to build differentiable ILP on Łukasiewicz unbound logic, where truth values range over the entire real line and conjunction, disjunction, and existential quantification are all plain summation.

Contributions: (1) LuHorn, an adaptation of Lu to Horn logic programming: a forward-chaining-like procedure in which rule applicability is a hard gate and the value propagated to the head is an additive payload (sum of body valuations). (2) DiffLu, a differentiable ILP model: the gates are removed (absorbed into learnable weights), and each intensional predicate is defined by R rules whose bodies are weighted sums over a feature set of all first-order atoms with at most V variables. Training uses a clipped, hinge-like loss; symbolic rules are extracted post hoc by a dynamic Top-K weight-magnitude heuristic. (3) vDiffLu, an end-to-end visual ILP model: slot attention plus a learned fact converter feeding DiffLu, trained from image-level labels only, without the intermediate symbolic annotations required by αILP and NEUMANN.

Critical strengths
  1. The decomposition in LuHorn seems elegant: the gate exactly recovers classical Horn rule applicability, while the additive payload keeps the backward pass non-selective and non-vanishing. It identifies a minimal modification of classical forward chaining that makes the deduction graph trainable without giving up the Boolean semantics: a principled alternative to t-norm relaxations, which the literature agrees are the trainability bottleneck of differentiable ILP.

  2. End-to-end visual ILP without intermediate annotations. Removing the supervised-perception stage eliminates a supervision bottleneck that has limited visual ILP, and the unbounded real-valued interface between network outputs and logic valuations is a natural design. The CLEVR-Hans3 average obtained with image-level labels only, at a fraction of the memory, indicates the direction is viable. If the attribution of these gains were tightened (see weaknesses), this would be a good, practically relevant result.

Critical weaknesses
  1. The claim that unbound, non-selective operators improve trainability is never tested, and the reported gains are confounded with hypothesis-space size. No experiment isolates the operator choice: there is no operator-swap ablation and no measurement of gradient statistics versus chaining depth or body length. Meanwhile, the largest single gain (in Fizz) is attributed by the authors to DiffLu's ability to learn many-body-atom rules, i.e. an expressivity effect relative to ∂ILP 2-body-atom restriction, not a gradient effect. As presented, the evidence supports "a larger hypothesis space with a saturating loss trains well" not "unbound logic fixes gradient pathologies".

  2. The evaluation lacks the baseline needed to establish the some claims. (a) in the Visual ILP experiment, the same slot-attention + fact-converter stack trained end-to-end with a plain classification head and no logic layer is absent, so vDiffLu's advantage over two-stage pipelines cannot be attributed to the differentiable logic rather than simply to end-to-end training of perception. (b) in symbolic ILP experiments: there are no noise-robustness experiments and the extracted programs seems not validated (it is not shown that they entail E+ and not E− under classical forward chaining), which reduces an ILP result to valuation fitting.

Questions for authors
  1. For how many forward-chaining steps T Eq. 7 is unrolled during training and how T was selected?

  2. Restricted to <= 2 body atoms , how much of the +6.5-point average advantage over HRI remains?

  3. What K was used per dataset, and how do surplus slots (background/duplicates) behave as logical constants? Is the twopairs failure related to unreliable object binding without perception pretraining?

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.