Domain independent propagation.

*(English)*Zbl 0862.68023
Institute for New Generation Computer Technology (ed.), 5th generation computer systems 1992. International conference, FGCS ’92. Japan 1992, Vol. 2. Amsterdam: IOS Press. 1004-1011 (1992).

Summary: Recent years have seen the emergence of two main approaches to integrating constraints into logic programming. The CLP scheme introduces constraints as basic statements over built-in computation domains.On the other hand, systems such as CHIP have introduced new inference rules, which enable certain predicates to be used for propagation thereby pruning the search tree. Unfortunately these two complementary approaches were up to now incompatible, since propagation techniques appeared intimately tied to the notion of finite domains. This paper introduces a generalisation of propagation that is applicable to any CLP computation domain, thereby restoring orthogonality and bridging the gap between two important constraint logic programming paradigms. The practical interest of this new notion of ”domain independent” propagation is demonstrated by applying a prototype system for solving some hard search problems.

For the entire collection see [Zbl 0853.00057].

For the entire collection see [Zbl 0853.00057].

##### MSC:

68N17 | Logic programming |