Volume 7: January - December 1997

Issue 1: 1997


An algebraic perspective of constraint logic programming

  • An algebraic perspective of constraint logic programming
  • FS. de Boer1, A. Di Pierro2 and C. Palamidessi3 1Faculteit Wiskunde en Informatica, Universiteit Utrecht, PO Box 8089, 3508 TB Utrecht, The Netherlands. Email: frankb@cs.ruu.nl, 2Dipartimento di Informatica, Universita di Pisa, Corso Italia 40, 56125 Pisa, Italy. Email: dipierro@di.unipi.it and 3DISI, Universita di Genova, via Dodecaneso 35, 16146 Genova, Italy. Email: catuscia@disi.unige.it


    We develop a denotational, fully abstract semantics for constraint logic programming (clp) with respect to successful and failed observables. The denotational approach turns out very useful for the definition of new operators on the language as the counterpart of some abstract operations on the denotational domain. In particular, by defining our domain as a cylindric Heyting algebra, we can exploit, to this aim, operations of both cylindric algebras (such as cylindrification), and Heyting algebras (such as implication and negation). The former allows us to generalize the clp language by introducing an explicit hiding operator; the latter allows us to define a notion of negation which extends the classical negation used in logic programming. In particular, we show that our notion subsumes both negation as failure and negation as instantiation.

    Keywords: Constraint logic programming, cylindric algebras, distributive lattices, Heyting negation, negation as instantiation.

    Pages: 1 - 38

    Part of the OUP Journal of Logic and Computation WWW service

    General Information

    Click here to register with OUP.

    This page is maintained by OUP admin

    Last updated 25 Jan 97

    Part of the OUP Journals World Wide Web service.

    Copyright Oxford University Press, 1997