|
Título:
|
Constraint Logic Programming with Hereditary Harrop formulas
|
|
Autores:
|
Leach Albert, Javier ;
Nieva Soto, Susana ;
Rodríguez-Artalejo, Mario
|
|
Tipo de documento:
|
texto impreso
|
|
Editorial:
|
Cambridge Univ Press, 2001-07
|
|
Dimensiones:
|
application/pdf
|
|
Nota general:
|
info:eu-repo/semantics/restrictedAccess
|
|
Idiomas:
|
|
|
Palabras clave:
|
Estado = Publicado
,
Materia = Ciencias: Informática: Lenguajes de programación
,
Tipo = Artículo
|
|
Resumen:
|
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.
|
|
En línea:
|
https://eprints.ucm.es/id/eprint/17171/1/Nieva04.pdf
|
