Constraint Logic Programming with Hereditary Harrop formulas



Downloads per month over past year

Leach Albert, Javier and Nieva Soto, Susana and Rodríguez-Artalejo, Mario (2001) Constraint Logic Programming with Hereditary Harrop formulas. Theory and Practice of Logic Programming, 1 (4). pp. 409-445. ISSN 1471-0684

[thumbnail of Nieva04.pdf] PDF
Restringido a Repository staff only


Official URL:


Constraint Logic Programming (CLP) and Hereditary Harrop formulas (HH) are two well known ways to enhance the expressivity of Horn clauses. In this paper, we present a novel combination of these two approaches. We show how to enrich the syntax and proof theory of HH with the help of a given constraint system, in such a way that the key property of HH as a logic programming language (namely, the existence of uniform proofs) is preserved. We also present a procedure for goal solving, showing its soundness and completeness for computing answer constraints. As a consequence of this result, we obtain a new strong completeness theorem for CLP that avoids the need to build disjunctions of computed answers, as well as a more abstract formulation of a known completeness theorem for HH.

Item Type:Article
Additional Information:

This is a substantially revised and extended version of an earlier paper (Leach, Nieva and Rodrguez-Artalejo, 1997). The authors have been partially supported by the Spanish National Project TIC 98-0445-C03-02 TREND and the Esprit BRA Working Group EP-22457 CCLII.

Uncontrolled Keywords:Constraint systems, Hereditary Harrop formulas, Uniform proofs, Goal solving
Subjects:Sciences > Computer science > Programming languages (Electronic computers)
ID Code:17171
Deposited On:22 Nov 2012 10:23
Last Modified:27 Jul 2018 10:02

Origin of downloads

Repository Staff Only: item control page