A Logic Programming View of CLP

We address the problem of lifting definitions, results, and even proofs for the theory of logic programming, so that they apply to constraint logic programming (CLP). We attempt to systematize this lifting, where it is possible, and delineate where it is not possible. We show that the Independence of Negated Constraints property of constraint domains is fundamental to several different aspects of constraint logic programming. This is a principal cause for the inability to lift sonie traditional logic programming results to constraint logic programming.