Description, Implementation, and Evaluation of a Generic Design for Tabled CLP
Joaqu\'in Arias, Manuel Carro

TL;DR
This paper presents Mod TCLP, a flexible framework for integrating various constraint solvers into tabling constraint logic programming, improving expressiveness, termination, and efficiency.
Contribution
It introduces a generic design that simplifies solver integration, utilizes entailment for call/answer subsumption, and demonstrates effectiveness through multiple solver integrations.
Findings
Mod TCLP enhances TCLP system flexibility and performance.
Successful integration of four diverse constraint solvers.
Framework improves termination, soundness, and completeness of TCLP.
Abstract
Logic programming with tabling and constraints (TCLP, tabled constraint logic programming) has been shown to be more expressive and in some cases more efficient than LP, CLP or LP + tabling. Previous designs of TCLP systems did not fully use entailment to determine call / answer subsumption and did not provide a simple and well-documented interface to facilitate the integration of constraint solvers in existing tabling systems. We study the role of projection and entailment in the termination, soundness and completeness of TCLP systems, and present the design and an experimental evaluation of Mod TCLP, a framework that eases the integration of additional constraint solvers. Mod TCLP views constraint solvers as clients of the tabling system, which is generic w.r.t. the solver and only requires a clear interface from the latter. We validate our design by integrating four constraint…
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
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Formal Methods in Verification
