Constraint Logic Programming with Hereditary Harrop Formula

Details Constraint Logic Programming with Hereditary Harrop Formula Constraint Logic Programming with Hereditary Harrop Formula

2004-04-26

arxiv.org/abs/cs/0404053v1

Computer Science

Programming Languages

Appeared in Theory and Practice of Logic Programming, vol. 1, no. 4, 2001. Appeared in Theory and Practice of Logic Programmin

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Constraint Logic Programming with Hereditary Harrop Formula does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constraint Logic Programming with Hereditary Harrop Formula, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint Logic Programming with Hereditary Harrop Formula will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-630653