A MIP Backend for the IDP System
San Pham, Jo Devriendt, Maurice Bruynooghe, Patrick De Causmaecker

TL;DR
This paper investigates the use of a MIP solver as a backend for the IDP knowledge base system, comparing its performance to the traditional CP solver to determine when MIP is advantageous.
Contribution
It introduces CPLEX as a MIP backend for IDP and provides experimental analysis comparing its effectiveness to the existing CP backend.
Findings
MIP backend performs better in certain problem instances.
The paper identifies scenarios where MIP is preferable over CP.
Experimental results highlight the strengths and limitations of each backend.
Abstract
The IDP knowledge base system currently uses MiniSAT(ID) as its backend Constraint Programming (CP) solver. A few similar systems have used a Mixed Integer Programming (MIP) solver as backend. However, so far little is known about when the MIP solver is preferable. This paper explores this question. It describes the use of CPLEX as a backend for IDP and reports on experiments comparing both backends.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Semantic Web and Ontologies · Logic, Reasoning, and Knowledge
