RT Book, Section
T1 Constraint logic programming with hereditary Harrop formulas
A1 Leach Albert, Javier
A1 Nieva Soto, Susana
A1 Rodríguez-Artalejo, Mario
A2 Maluszynski, Jan
AB Constraint 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 HH
PB MIT Press, Cambridge
SN 0-262-63180-6
YR 1997
FD 1997
LK https://hdl.handle.net/20.500.14352/60588
UL https://hdl.handle.net/20.500.14352/60588
NO Conference: 1997 International Logic Programming Symposium (ILPS 97) Location: Port Washngton, New York Date: Oct 13-16, 1997
NO Spanish National Project
NO Esprit BRA Working Group
DS Docta Complutense
RD 14 dic 2025