On logical constraints in Logic Programming
Victor W. Marek, Anil Nerode, Jeffrey B. Remmel · 1995
In this note we will investigate a form of logic programming with constraints. The constraints that we consider will not be restricted to statements on real numbers as in CLP(R), see [9] or on other fixed constraint domain (see the recent review article of Jaffar and Maher [10] for an excellent presentation of the issues in Constraint Logic Programming. The paper of Jaffar and Maher has an extensive bibliography so to save space we will quote only a restricted number of papers in the area). Instead our constraints will be arbitrary global constraints. The basic idea is that the applicability of a given rule is not predicated on the fact that individual variables satisfy certain constraints, but rather on the fact that the least model of the set rules that are ultimately applicable satisfy the constraint of the rule. Thus the role of clauses will be slightly different than in the usual Logic Programming with constraints. In fact, the paradigm we present is closely related to stable mode...