A Differentiable Integer Linear Programming Solver for Explanation-Based Natural Language Inference
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 30 references that are in the map. First posted on arXiv 3 Apr 2024.
Builds on
23 of 30 references.
References · 23
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2016ConceptNet 5.5: An Open Multilingual Graph of General Knowledgecited by 1,067
- 2020UnifiedQA: Crossing Format Boundaries With a Single QA Systemcited by 476
- 2019Differentiable Convex Optimization Layerscited by 465
- 2020Transformers as Soft Reasoners over Languagecited by 270
- 2019Differentiation of Blackbox Combinatorial Solverscited by 226
- 2018WorldTree: A Corpus of Explanation Graphs for Elementary Science Questions supporting Multi-Hop Inferencecited by 60
- 2019Quick and (not so) Dirty: Unsupervised Selection of Justification Sentences for Multi-hop Question Answeringcited by 59
- 2020PRover: Proof Generation for Interpretable Reasoning over Rulescited by 53
11 more
- 2021CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraintscited by 49
- 2020A Survey on Explainability in Machine Reading Comprehensioncited by 33
- 2017Answering Complex Questions Using Open Information Extractioncited by 25
- 2021Hybrid Autoregressive Inference for Scalable Multi-hop Explanation Regenerationcited by 17
- 2018Exploiting Explicit Paths for Multi-hop Reading Comprehensioncited by 16
- 2021multiPRover: Generating Multiple Proofs for Improved Interpretability in Rule Reasoningcited by 15
- 2019Question Answering as Global Reasoning over Semantic Abstractionscited by 14
- 2016Question Answering via Integer Programming over Semi-Structured Knowledgecited by 13
- 2018Learning to Attend On Essential Terms: An Enhanced Retriever-Reader Model for Open-domain Question Answeringcited by 12
- 2018KG^2: Learning to Reason Science Exam Questions with Contextual Knowledge Graph Embeddingscited by 7
- 2021Diff-Explainer: Differentiable Convex Optimization for Explainable Multi-hop Inferencecited by 7
Built on by
Citing papers per year: 2025: 1.
1 paper.