2018/09/15 by Joaquín Arias, Arias, Joaquín, Manuel Carro +1
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL)
paper · pdf · doi:10.48550/arxiv.1809.05771
openalex publication_date 2018/09/15 · openalex created_date 2022/08/03 · openalex updated_date 2026/07/28
Logic programming with tabling and constraints (TCLP, tabled constraint logic\nprogramming) has been shown to be more expressive and in some cases more\nefficient than LP, CLP or LP + tabling. Previous designs of TCLP systems did\nnot fully use entailment to determine call / answer subsumption and did not\nprovide a simple and well-documented interface to facilitate the integration of\nconstraint solvers in existing tabling systems. We study the role of projection\nand entailment in the termination, soundness and completeness of TCLP systems,\nand present the design and an experimental evaluation of Mod TCLP, a framework\nthat eases the integration of additional constraint solvers. Mod TCLP views\nconstraint solvers as clients of the tabling system, which is generic w.r.t.\nthe solver and only requires a clear interface from the latter. We validate our\ndesign by integrating four constraint solvers: a previously existing constraint\nsolver for difference constraints, written in C; the standard versions of\nHolzbaur's CLP(Q) and CLP(R), written in Prolog; and a new constraint solver\nfor equations over finite lattices. We evaluate the performance of our\nframework in several benchmarks using the aforementioned constraint solvers.\nMod TCLP is developed in Ciao Prolog, a robust, mature, next-generation Prolog\nsystem. Under consideration in Theory and Practice of Logic Programming (TPLP).\n