most citedGoing Beyond Approximation: Encoding Constraints for Explainable Multi-hop Inference via Differentiable Combinatorial Solvers

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.AI2022★ 1 cited

Going Beyond Approximation: Encoding Constraints for Explainable Multi-hop Inference via Differentiable Combinatorial Solvers

Mokanarangan Thayaparan, Marco Valentino, André Freitas

Integer Linear Programming (ILP) provides a viable mechanism to encode explicit and controllable assumptions about explainable multi-hop inference with natural language. However, a…