arXiv:2605. 04193v2 Announce Type: replace Abstract: Inductive Logic Programming (ILP) aims to learn interpretable first-order rules from data, but existing symbolic and neuro-symbolic approaches struggle to scale to noisy and probabilistic settings.
arXiv:2607. 20402v1 Announce Type: new Abstract: In many reasoning problems, the premises are not observed as discrete symbols, but must be inferred from high-dimensional inputs.
arXiv:2510. 19698v3 Announce Type: replace Abstract: Large Language Models (LLMs) can propose rules in natural language, sidestepping the need for a predefined predicate space in traditional rule learning.
arXiv:2510. 23379v2 Announce Type: replace-cross Abstract: We investigate a relatively under-explored class of hybrid neurosymbolic models that integrate symbolic learning with neural reasoning to construct data generators meeting formal correctness criteria.
arXiv:2605. 30456v2 Announce Type: replace Abstract: Many learning tasks in science and engineering are characterized by sparse datasets, which limits the effectiveness of purely data-driven approaches.
arXiv:2606. 03269v1 Announce Type: new Abstract: Visual Question Answering (VQA) is the task of answering questions about images, requiring the integration of multimodal input and reasoning.
arXiv:2604. 03245v2 Announce Type: replace-cross Abstract: The remarkable reasoning and code generation capabilities of large language models (LLMs) have recently motivated increasing interest in automating formal verification (FV), a process that ensures hardware correctness through mathematically precise assertions but remains highly labor-intensive, particularly through the translation of natural language into SystemVerilog Assertions (NL-to-SVA).
arXiv:2608. 08786v1 Announce Type: new Abstract: Large language models (LLMs) increasingly serve as data-driven reasoners, yet their chains-of-thought (CoT) can be unfaithful even when final answers are correct.
arXiv:2608. 11905v1 Announce Type: new Abstract: In many practical applications of generative AI systems, from tax rules to airline baggage allowance, responses to natural language queries must respect written policies or rules.
NeuroRule is a knowledge distillation framework that transforms high‑capacity neural networks into explainable rule‑sets. It adapts the EVOTER rule‑set evolution infrastructure to evolve propositional logic expressions that capture the neural network’s performance. The approach includes a conciseness objective to enhance explainability and demonstrates viability even without access to the original training data.
The paper introduces a neuro‑symbolic framework for scientific reasoning that separates symbolic validity and semantic groundedness. A deterministic symbolic verifier acts as a hard filter to guarantee syntactic and arithmetic correctness, while a Process Reward Model (PRM) is trained on verifier‑accepted steps to assess contextual grounding. The authors propose Counterfactual Symbolic Perturbation (CSP) to generate hard negative examples that pass the verifier but are logically flawed, enabling efficient PRM training and a verifier‑first constrained search at inference.
The paper introduces a Neuro‑Symbolic framework that integrates a Vision‑Language Model (VLM) for automatic induction of First‑Order Logic (FOL) rules with a Dynamic Logic Tensor Network (D‑LTN) for differentiable rule verification. In a closed iterative loop, the VLM proposes candidate rules (Think), the D‑LTN verifies them against visual embeddings (Verify), and failures guide the VLM to refine its hypotheses (Revise). Evaluated on the ViSudo‑PC benchmark across four visual domains, the system successfully induces Sudoku constraint rules from only three training examples and achieves AUC scores that match or surpass prior methods such as NeuPSL and LTN.
In many practical applications of generative AI systems, from tax rules to airline baggage allowance, responses to natural language queries must respect written policies or rules. We present a hybrid symbolic approach that expresses policies in formal logic and at inference time exploits the representation power of language models for fact extraction to ground predicates, and an answer set solver for reasoning such that responses are interpretable, auditable, and as we show, accurate and robust under input perturbations.