E-Prints Complutense

Constraint logic programming with hereditary Harrop formulas

Impacto

Descargas

Último año



Leach Albert, Javier y Nieva Soto, Susana y Rodríguez-Artalejo , Mario (1997) Constraint logic programming with hereditary Harrop formulas. In Logic programming. Proceedings of the international symposium (ILPS’97). MIT Press, Cambridge, Port Washington, New York, pp. 307-321. ISBN 0-262-63180-6

URL Oficial: http://dl.acm.org/citation.http://dl.acm.org/citation.cfm?id=271419&CFID=149252991&CFTOKEN=67712323




Resumen

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


Tipo de documento:Sección de libro
Información Adicional:

Conference: 1997 International Logic Programming Symposium (ILPS 97) Location: Port Washngton, New York Date: Oct 13-16, 1997

Palabras clave:Constraint systems; Hereditary Harrop formulas; Uniform proofs; Goal solving
Materias:Ciencias > Informática > Lenguajes de programación
Código ID:17267
Depositado:29 Nov 2012 10:30
Última Modificación:29 Nov 2012 10:30

Descargas en el último año

Sólo personal del repositorio: página de control del artículo