Overall
The overall quality of the paper is good, hence in the first round of reviewing I am giving a 3 score. However, there are some issues need to be further discussed to improve the overall soundness.
Q3, Q4 and partially Q7 are questions that I think are important, and providing more explanation on these topics would be very beneficial and I will raise my score accordingly if they are discussed. Other questions are interesting but not that important / directly relevant to the topic, hence the authors are not required to answer them all.
Question
Q1. Clarification: What is the precise boundary between the predefined symbolic language and the learned rule system?
Could the authors explicitly distinguish the predefined symbolic vocabulary, the learnable program structure, and the fixed logical inference semantics?
In particular, how are the number of universal meta-rules, the variable budget, maximum body size, multiplicity, and the number and arities of auxiliary predicates selected for each benchmark?
Are these settings determined through a uniform procedure independent of the final evaluation, or do they rely on prior knowledge about the structure of the target solution?
Although Section 4.1 describes the specification of auxiliary predicates and their arities, it would be useful to understand how much structural prior information is introduced through these capacity choices in the actual experiments.
This clarification is important for interpreting the scope of automatic rule discovery and the claim of reduced dependence on expert-defined rule templates.
Q2. Clarification: How do the CWA/OWA assumptions correspond to the data semantics and learning objective?
Section 4.2.2 distinguishes CWA and OWA modes primarily through whether background predicates are permitted in rule heads.
Could the authors clarify which parts of the background knowledge are assumed complete and which may be missing?
In particular, how are negative target examples constructed under the OWA setting, and how does the evaluation avoid treating unknown facts as false when the underlying knowledge is incomplete?
Does the proposed OWA mode primarily allow the model to infer additional background facts through learned rules, or does it introduce other mechanisms for handling incomplete knowledge?
Clarifying this distinction would help establish that the evaluation protocol is consistent with the intended semantics of incomplete background knowledge.
Q3. Evidence/Ablation: Why is embedding-based parameterization preferable to directly learning the distribution parameters?
Have the authors considered a baseline that retains the same atom candidates, variable budget, body-size constraints, symbolic executor, and sampling budget, but directly learns categorical and Bernoulli logits instead of using the proposed embedding-based scores?
Such a comparison would help separate the benefits of the expressive action space from those of the embedding factorization.
If the main advantages arise from parameter sharing, capacity control, or improved optimization geometry, it would be valuable to provide evidence supporting these mechanisms.
Additionally, the atom-scoring branch contains a linear projection followed by an inner product:
(Wca)⊤ν=ca⊤(W⊤ν),
where (ca) denotes the concatenated embeddings.
This suggests that, considered in isolation, the projection and query vector can be combined into an effective parameter vector.
How should the role of this factorization be interpreted, particularly in light of the sensitivity to atom embedding dimensions?
Q4. Clarification/Evidence: What motivates the specific parameter separation and independence assumptions?
Could the authors distinguish between parameter-separation decisions that are necessary to preserve symbolic expressivity and those introduced primarily for modeling convenience or optimization?
For instance, allowing different occurrences of the same predicate to have different argument assignments appears important for representing general rules. However, this requirement does not uniquely determine the proposed embedding and parameter-sharing scheme.
More broadly, what motivates the independence assumptions among argument assignments, among different meta-rules, and between atom and variable choices?
Since program correctness often requires coordinated assignments across multiple argument positions, how does the proposed factorization facilitate the discovery of such joint structures?
Are there empirical observations indicating that shared embeddings improve coordination, or that failures are associated with difficulties in learning the required joint binding patterns?
Q5. Clarification: How does the proposed training procedure correspond to standard REINFORCE, and what objective is actually optimized?
My understanding is that the distribution over atom and variable assignments can be interpreted as a structured policy, a complete sampled program as an action, symbolic forward chaining as the evaluator, and balanced accuracy as the reward.
Under this interpretation, the framework resembles a structured one-step policy-gradient problem rather than an RL system that selects new actions at each iteration of forward chaining.
Could the authors clarify this correspondence and identify which components constitute the main methodological differences from standard score-function estimation?
Furthermore, does the implementation strictly follow the estimator in Equation 7, or are additional techniques employed, such as reward baselines, reward normalization, gradient clipping, or other variance-reduction mechanisms?
Section 4.5 mentions an entropy regularization coefficient (λ), whereas Equation 6 presents only the expected reward. Could the authors specify the complete objective actually used during training, including the entropy term, its scope, and any scheduling strategy?
It would also be helpful to explain how the atom and variable sample sizes (Na) and (Nv) are selected.
These details are particularly important for interpreting the exploration behaviour and reproducing the optimization results.
Q6. Evidence/Ablation: What are the principal sources of optimization difficulty as the symbolic search space grows?
As the number of argument positions, candidate logical variables, body atoms, rule slots, and auxiliary predicates increases, which factors dominate the optimization difficulty?
Potential explanations include a decreasing probability of sampling useful programs, difficulties in assigning credit to individual stochastic choices, increased gradient variance, and higher symbolic execution costs.
It would be particularly informative to provide a small number of targeted diagnostics, such as the fraction of sampled programs that derive useful target facts, reward and entropy trajectories, or success rates under matched computation budgets.
Comparisons with simple random search or a more direct REINFORCE baseline over the same action space, where feasible, could further clarify whether performance improvements arise primarily from the representation of the search space or from the proposed learning strategy.
Importantly, I would not assume that optimization difficulty necessarily increases monotonically with the number of logical variables. The dependence structure of the reward and the degree of coordination required among local choices may be equally important.
A more systematic account of these factors could help explain the different sensitivity patterns observed in Appendix D.
It would also be useful to distinguish variability in final performance across random seeds from the variance of the gradient estimator at a fixed parameter setting.
Q7. Clarification/Evidence: What convergence behaviour is observed, and how does the method handle multiple compatible explanations?
Section 4.3 suggests that the learned distributions are expected to collapse to, or approximate, deterministic distributions.
What empirical evidence supports this behaviour?
In particular, could the authors distinguish between numerical convergence of model parameters, concentration of the sampling distribution, and stability of the final extracted program?
If multiple distinct rule systems explain the same training examples, what behaviour is expected from HRN?
Is the objective simply to discover any rule system that satisfies the observations, or is there an intended notion of recovering a particular underlying explanation?
Across different random seeds, do the learned programs mainly differ through semantically equivalent variable renamings, or can they yield genuinely different predictions on unseen examples?
Have the authors observed cases in which the sampling distribution remains diffuse while the extracted program is stable, or cases in which expected sampled-program performance differs substantially from extracted-program performance?
Q8. Clarification: How is forward chaining implemented, and which program representation is used in the final evaluation?
Does the implementation execute forward chaining until no additional facts can be derived, as described by the fixed-point formulation in Section 3.2, or does it impose a finite deduction-depth limit?
If a depth limit is used, how is it selected, and is it consistent across training and evaluation?
It would also be helpful to distinguish the number of optimization iterations, the number of Monte Carlo samples, and the number of forward-chaining rounds, since these correspond to different computational costs.
Finally, do the reported benchmark results evaluate the single deterministic program extracted according to Section 4.4, individual sampled programs, or an aggregation of predictions from multiple sampled programs?
This distinction is important because the training objective evaluates expected performance over a distribution of programs, whereas the final intended output is an interpretable symbolic rule system.
Clarifying the evaluation target would establish more directly which empirical results support the quality of the final extracted programs.
Q9. Writing
The overall writing quality is good and human like. However, Section 4.2 is a bit confusing as multiple notations are introduced at once. The presentation could be benefited from adding visualizations in the appendix to more clearly show the corresponding relationships between notations and the objects, so as the formulations.
Another useful addition would be an explicit distinction between what is specified and what is learned. The predicate vocabulary, predicate arities, number of rule slots, maximum number of body atoms, variable budget, multiplicity, and number and arities of auxiliary predicates are specified in advance. In contrast, the concrete atom selections, variable assignments, and continuous parameters are learned.
This distinction is important for interpreting the generality of the proposed method: HRN learns concrete rule systems within a predefined symbolic language rather than learning logical semantics themselves.