Abstract

1 Introduction In the beginning of constraint logic programming (CLP), constraint solving was "hard-wired " in a built-in constraint solver written in a low-level language. While efficient, this so-called "black-box " approach makes it hard to modify a solver or build a solver over a new domain, let alone debug, reason about and analyze it. This is a problem, since one lesson learned from practical applications is that constraints are often heterogeneous and application-specific. Consequently, several proposals have been made to allow more for flexibility and customization of constraint systems ("glass-box " or even "no-box " approaches):- Demons, forward rules and conditionals in CHIP [6] allow the definition of

Citations

258	The family of concurrent logic programming languages - Shapiro - 1989
58	A parallel machine for multiset transformation and its programming style. Future Generation Computer Systems - Banatre, Coutant, et al. - 1988
30	Specification of constraint based inference mechanism through extended unification - Holzbaur - 1990
13	Prolog control rules - Naish - 1985
1	11. Fr"uhwirth T., Abdennadher S., Meuss H., Confluence and Semantics of Constraint Simplification Rules, Constraint Journal, Kluwer Academic Publishers, to appear. 12. Fr"uhwirth T., Theory and Practice of Constraint Handling Rules, Special Iss - Manual, Munich, et al. - 1995