Complutense University Library

Constraint Logic Programming with Hereditary Harrop formulas

Leach Albert, Javier and Nieva Soto, Susana and Rodríguez-Artalejo , Mario (2001) Constraint Logic Programming with Hereditary Harrop formulas. Theory and Practice of Logic Programming , 1 (4). pp. 409-445. ISSN 1471-0684

[img] PDF
Restricted to Repository staff only until 31 December 2020.

858kB

Official URL: http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=78817

View download statistics for this eprint

==>>> Export to other formats

Abstract

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.


Item Type:Article
Additional Information:

This is a substantially revised and extended version of an earlier paper (Leach, Nieva and Rodrguez-Artalejo, 1997). The authors have been partially supported by the Spanish National Project TIC 98-0445-C03-02 TREND and the Esprit BRA Working Group EP-22457 CCLII.

Uncontrolled Keywords:Constraint systems, Hereditary Harrop formulas, Uniform proofs, Goal solving
Subjects:Sciences > Computer science > Programming languages (Electronic computers)
ID Code:17171
References:

Andreka, H. and Nemeti, I. (1978) The generalized completeness of Horn Predicate Logic as a programming language. Acta Cybernetica, 4, 3-10.

Clark, K. L. (1978) Negation as failure. In: Gallaire, H. and Minker, J. (eds.), Logic and Databases, pp. 293-322. Plenum Press, New York. CLP with Hereditary Harrop formulas 445

Comon, H., Haberstrau, M. and Jouannaud, J. P. (1994) Cycle-syntacticness, and shallow theories. Information & Computation, 111, 154-191.

Cohen, J. (1990) Constraint Logic Programming languages. Comm. ACM, 35(7), 52-68.

Comon, H. (1993) Complete axiomatizations of some quotient term algebras. Theor. Comput. Sci. 118, 167-191.

Darlington, J. and Guo, Y. (1994) Constraint Logic Programming in the Sequent Calculus. In: Pfenning, F. (ed.), LPAR'94. LNAI 822, pp. 200-213. Springer-Verlag.

Dershowitz, N. and Manna, Z. (1979) Proving termination with multiset ordering. Comm. ACM, 22(8), 465-476.

Hodas, J. S. (1994) Logic Programming in Intuitionistic Linear Logic: Theory, Design and Implementation. PhD Thesis, University of Pennsylvania.

Jaar, J. and Lassez, J. L. (1987) Constraint Logic Programming. Proc. 14th ACM Symposium on Principles of Programming Languages, pp. 111-119.

Jaar, J. and Michaylov, S. (1987) Methodology and implementation of CLP systems. In: Lassez, J. L. (ed.), ICLP'87, pp. 196-218. MIT Press.

Jaar, J. and Maher, M. J. (1994) Constraint Logic Programming: A survey. J. Logic Programming,19(20), 503-581.

Jaar,J.,Maher,M.J.,Marriott,K.and Stuckey,P.(1996)The Semantics of Constraint Logic Programs. Technical Report TR 96/39,Department of Computer Science,University of Melbourne

Jaar, J., Michaylov, S., Stuckey, P. and Yap, R. (1992) The CLP(R) Language and System. ACM Trans. Programming Lang., 14(3), 339-395.

Leach, J., Nieva, S. and Rodrguez-Artalejo, M. (1997) Constraint Logic Programming with Hereditary Harrop formulas. In: Ma luszyn ski, J. (ed.), ILPS'97, pp. 307-321. MIT Press.

Maher, M. (1987) Logic semantics for a class of committed-choice programs. In: Lassez, J. L. (editor), ICLP'87, pp. 858-876. MIT Press.

Miller, D. (1989) A logical analysis of modules in logic programming. J. Logic Programming, 6(1, 2), 79-108.

Miller, D. (1992) Unication under a mixed prex. J. Symbolic Computation, 14, 321-358.

Miller, D. and Nadathur, G. (1986) Higher-order logic programming. In: Shapiro, E. (ed.), ICLP'86: LNCS 225, pp. 448-462. Springer-Verlag.

Miller, D., Nadathur, G., Pfenning, F. and Scedrov, A. (1991) Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Logic, 51(1-2), 125-157.

Miller, D., Nadathur, G. and Scedrov, A. (1987) Hereditary Harrop formulas and uniform proof systems. In: Gries, D. (ed.), LICS'87, pp. 98-105. IEEE Press.

Nadathur, G. (1993) A proof procedure for the logic of Hereditary Harrop formulas. J. Automated Reasoning, 11, 115-145.

Nadathur, G. and Miller, D. (1988) An overview of -Prolog. In: Bowen, K. A. and Kowalski, R. A. (eds.), ICLP'88, pp. 810-827. MIT Press.

Saraswat, V. (1992) The category of constraint systems is Cartesian closed. LICS'92, pp. 341-345. IEEE Press.

Smolka, G. and Treinen, R. (1994) Records for logic programming. J. Logic Programming, 18(3), 229-258.

Van Emden, M. H. and Kowalski, R. H. (1976) The semantics of predicate logic as a programming language. J. ACM, 23(4), 733-742.

Tarski, A. (1951) A Decision Method for Elementary Algebra and Geometry. University of California Press.

Deposited On:22 Nov 2012 10:23
Last Modified:07 Feb 2014 09:43

Repository Staff Only: item control page