Leach Albert, JavierNieva Soto, SusanaRodríguez-Artalejo , MarioMaluszynski, Jan2023-06-202023-06-2019970-262-63180-6https://hdl.handle.net/20.500.14352/60588Conference: 1997 International Logic Programming Symposium (ILPS 97) Location: Port Washngton, New York Date: Oct 13-16, 1997Constraint logic programing (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 building disjunctions of computed answers, as well as a more declarative formulation of a known completeness theorem for HHbook parthttp://dl.acm.org/citation.http://dl.acm.org/citation.cfm?id=271419&CFID=149252991&CFTOKEN=67712323http://dl.acm.org/dl.cfm?CFID=149252991&CFTOKEN=67712323metadata only access004.43Constraint systemsHereditary Harrop formulasUniform proofsGoal solvingLenguajes de programación1203.23 Lenguajes de Programación