English

A Differentiable Integer Linear Programming Solver for Explanation-Based Natural Language Inference

Computation and Language 2024-04-04 v1 Artificial Intelligence Machine Learning

Abstract

Integer Linear Programming (ILP) has been proposed as a formalism for encoding precise structural and semantic constraints for Natural Language Inference (NLI). However, traditional ILP frameworks are non-differentiable, posing critical challenges for the integration of continuous language representations based on deep learning. In this paper, we introduce a novel approach, named Diff-Comb Explainer, a neuro-symbolic architecture for explanation-based NLI based on Differentiable BlackBox Combinatorial Solvers (DBCS). Differently from existing neuro-symbolic solvers, Diff-Comb Explainer does not necessitate a continuous relaxation of the semantic constraints, enabling a direct, more precise, and efficient incorporation of neural representations into the ILP formulation. Our experiments demonstrate that Diff-Comb Explainer achieves superior performance when compared to conventional ILP solvers, neuro-symbolic black-box solvers, and Transformer-based encoders. Moreover, a deeper analysis reveals that Diff-Comb Explainer can significantly improve the precision, consistency, and faithfulness of the constructed explanations, opening new opportunities for research on neuro-symbolic architectures for explainable and transparent NLI in complex domains.

Keywords

Cite

@article{arxiv.2404.02625,
  title  = {A Differentiable Integer Linear Programming Solver for Explanation-Based Natural Language Inference},
  author = {Mokanarangan Thayaparan and Marco Valentino and André Freitas},
  journal= {arXiv preprint arXiv:2404.02625},
  year   = {2024}
}

Comments

Accepted to LREC-COLING 2024 - Camera Ready. arXiv admin note: substantial text overlap with arXiv:2208.03339

R2 v1 2026-06-28T15:42:51.480Z