## RISC-CLP(Tree(Delta)) - A Constraint Logic Programming System with Parametric Domain (1995)

Citations: | 3 - 1 self |

### BibTeX

@TECHREPORT{Hong95risc-clp(tree(delta))-,

author = {Hoon Hong and Stefan Ratschan},

title = {RISC-CLP(Tree(Delta)) - A Constraint Logic Programming System with Parametric Domain},

institution = {},

year = {1995}

}

### OpenURL

### Abstract

Current implementations of constraint logic programming languages (like CLP(!), CHIP or RISC-CLP(Real) support constraint solving over a certain fixed domain. In this paper a system is presented which gives the possibility to instantiate a constraint logic programming language with an arbitrary constraint domain. The interface between the system and such a constraint domain is given and the extensions to the Warren Abstract Machine (WAM) for this implementation are presented. 1 Introduction There already exist several implementations of constraint logic programming languages which are highly optimized for a certain constraint domain (for example PROLOG III [9], CHIP [1], CLP(!) [16], CLP(FD) [23], LIFE [4]), RISC-CLP(Real) [12], RISC-CLP(R-Trees) [7] and RISC-CLP(CF) [13]). An alternative approach would be a system which does not involve a fixed constraint domain but is parametric in that it can be instantiated with an arbitrary constraint domain. There already exist several systems ...

### Citations

508 |
An abstract Prolog instruction set
- Warren
- 1983
(Show Context)
Citation Context ...the leaves call the functions for compiling constants (or terms when using compile time constraint construction). The emulator is an implementation of an extension of the Warren Abstract Machine (see =-=[24]-=- or [3]), where the WAM has been extended with: Constraint construction stack: A stack on which constraints are built. The abstract data type operations push for pushing a new object onto the stack an... |

313 |
The CLP(R) Language and System
- Jaffar, Michaylov, et al.
- 1992
(Show Context)
Citation Context ...oduction There already exist several implementations of constraint logic programming languages which are highly optimized for a certain constraint domain (for example PROLOG III [9], CHIP [1], CLP(!) =-=[16]-=-, CLP(FD) [23], LIFE [4]), RISC-CLP(Real) [12], RISC-CLP(R-Trees) [7] and RISC-CLP(CF) [13]). An alternative approach would be a system which does not involve a fixed constraint domain but is parametr... |

299 |
An Introduction to Prolog III
- Colmerauer
- 1990
(Show Context)
Citation Context ... are presented. 1 Introduction There already exist several implementations of constraint logic programming languages which are highly optimized for a certain constraint domain (for example PROLOG III =-=[9]-=-, CHIP [1], CLP(!) [16], CLP(FD) [23], LIFE [4]), RISC-CLP(Real) [12], RISC-CLP(R-Trees) [7] and RISC-CLP(CF) [13]). An alternative approach would be a system which does not involve a fixed constraint... |

258 |
Warren’s Abstract Machine: A Tutorial Reconstruction
- Aı̈t-Kaci
- 1999
(Show Context)
Citation Context ...es call the functions for compiling constants (or terms when using compile time constraint construction). The emulator is an implementation of an extension of the Warren Abstract Machine (see [24] or =-=[3]-=-), where the WAM has been extended with: Constraint construction stack: A stack on which constraints are built. The abstract data type operations push for pushing a new object onto the stack and pop f... |

70 | Constraint processing in cc(fd
- Hentenryck, Saraswat, et al.
- 1995
(Show Context)
Citation Context ... already exist several implementations of constraint logic programming languages which are highly optimized for a certain constraint domain (for example PROLOG III [9], CHIP [1], CLP(!) [16], CLP(FD) =-=[23]-=-, LIFE [4]), RISC-CLP(Real) [12], RISC-CLP(R-Trees) [7] and RISC-CLP(CF) [13]). An alternative approach would be a system which does not involve a fixed constraint domain but is parametric in that it ... |

24 |
Extensible unification by metastructures
- NEUMERKEL
- 1990
(Show Context)
Citation Context ...le with (one or more) attached attributes. Metaterms behave in some respects like variables, but in most respects their behaviour is user-definable (e.g. what happens with them on unification, etc.) (=-=[20]-=-, [19] and [11]). By this method one can integrate constraint solvers into a logic programming system. The drawback of this method is that one is still restricted to PROLOG syntax (including constants... |

23 | An architecture for Prolog extensions
- Meier, Schimpf
- 1993
(Show Context)
Citation Context ...h (one or more) attached attributes. Metaterms behave in some respects like variables, but in most respects their behaviour is user-definable (e.g. what happens with them on unification, etc.) ([20], =-=[19]-=- and [11]). By this method one can integrate constraint solvers into a logic programming system. The drawback of this method is that one is still restricted to PROLOG syntax (including constants). Fur... |

19 |
An Abstract Machine for CLP(R), in
- Ja€ar, Michaylov, et al.
- 1992
(Show Context)
Citation Context ...ed but gefficient implementation. Common methods for implementing constraint logic programming systems include Metainterpreters (like [8]), interpreters (like presented in [16]) and compilers (CLP(!) =-=[15]-=- or CHIP [2]) which extend the WAM for handling constraints over certain domains. Existing systems with exchangeable constraint solvers are either interpreter systems and/or they use a predefined synt... |

18 | A verified Prolog compiler for the Warren Abstract Machine - Russinoff - 1992 |

16 | RISC-CLP(Real): Logic Programming with Non-linear Constraints over the Reals
- HONG
- 1993
(Show Context)
Citation Context ...ations of constraint logic programming languages which are highly optimized for a certain constraint domain (for example PROLOG III [9], CHIP [1], CLP(!) [16], CLP(FD) [23], LIFE [4]), RISC-CLP(Real) =-=[12]-=-, RISC-CLP(R-Trees) [7] and RISC-CLP(CF) [13]). An alternative approach would be a system which does not involve a fixed constraint domain but is parametric in that it can be instantiated with an arbi... |

10 | RISC-CLP(CF) Constraint Logic Programming over Complex Functions
- Hong
- 1994
(Show Context)
Citation Context ...ges which are highly optimized for a certain constraint domain (for example PROLOG III [9], CHIP [1], CLP(!) [16], CLP(FD) [23], LIFE [4]), RISC-CLP(Real) [12], RISC-CLP(R-Trees) [7] and RISC-CLP(CF) =-=[13]-=-). An alternative approach would be a system which does not involve a fixed constraint domain but is parametric in that it can be instantiated with an arbitrary constraint domain. There already exist ... |

7 |
Involution approach to solving systems of algebraic equations
- Zharkov, Blinkov
- 1993
(Show Context)
Citation Context ...E Maria: TRUE Michael: TRUE John: FALSE Delta- Constraints: More? (Y/N)y Failed Figure 5: Example Session We have implemented further constraint domains, for example a domain using Involution method (=-=[25]-=-), which uses a special type of Groebner bases for deciding the consistency of systems of linear and nonlinear equations over the complex numbers and computing a normal form. This constraint solver ha... |

5 | Extending RISC-CLP(Real) to Handle Symbolic Functions
- Caprotti
- 1993
(Show Context)
Citation Context ...ic programming languages which are highly optimized for a certain constraint domain (for example PROLOG III [9], CHIP [1], CLP(!) [16], CLP(FD) [23], LIFE [4]), RISC-CLP(Real) [12], RISC-CLP(R-Trees) =-=[7]-=- and RISC-CLP(CF) [13]). An alternative approach would be a system which does not involve a fixed constraint domain but is parametric in that it can be instantiated with an arbitrary constraint domain... |

5 |
The Sturm library manual - a C++ library for symbolic computation
- Hong, Neubacher, et al.
- 1994
(Show Context)
Citation Context ...in computer algebra systems, whereas our system aims more at efficiency using constraint solvers written in traditional programming languages and computer algebra libraries (like SACLIB [6] and Sturm =-=[14]-=-). CLPS also provides abstraction levels (3 levels in one dimension vs. 6 levels in two dimensions in our system) and constraints are stored as normal PROLOG structures and This research was done in t... |

5 |
A Constraint Logic Programming Shell
- Lim, Stuckey
- 1990
(Show Context)
Citation Context ...a fixed constraint domain but is parametric in that it can be instantiated with an arbitrary constraint domain. There already exist several systems which provide such funcionality, for example CLPS ( =-=[18]-=-), ECLiPSe ([10], [5]) or CAL ([22]). In this paper we report another system that we developed. The name RISC-CLP(Tree(\Delta)) indicates that constraint solving over symbolic trees over some arbitrar... |

3 |
Logic programming with functions over order-sorted feature terms
- Ait-Kaci, Podelski
- 1993
(Show Context)
Citation Context ...ist several implementations of constraint logic programming languages which are highly optimized for a certain constraint domain (for example PROLOG III [9], CHIP [1], CLP(!) [16], CLP(FD) [23], LIFE =-=[4]-=-), RISC-CLP(Real) [12], RISC-CLP(R-Trees) [7] and RISC-CLP(CF) [13]). An alternative approach would be a system which does not involve a fixed constraint domain but is parametric in that it can be ins... |

3 |
Meta-level interpretation of CLP(lists
- Cohen, Koiran, et al.
- 1993
(Show Context)
Citation Context ...ple but inefficient prototype and then refine it to more complicated but gefficient implementation. Common methods for implementing constraint logic programming systems include Metainterpreters (like =-=[8]-=-), interpreters (like presented in [16]) and compilers (CLP(!) [15] or CHIP [2]) which extend the WAM for handling constraints over certain domains. Existing systems with exchangeable constraint solve... |

3 |
CAL: A theoretical background of CLP and its applications
- Sakai, Aiba
- 1989
(Show Context)
Citation Context ...rametric in that it can be instantiated with an arbitrary constraint domain. There already exist several systems which provide such funcionality, for example CLPS ( [18]), ECLiPSe ([10], [5]) or CAL (=-=[22]-=-). In this paper we report another system that we developed. The name RISC-CLP(Tree(\Delta)) indicates that constraint solving over symbolic trees over some arbitrary user-defined constraint domain (\... |

2 |
Extension user manual
- Brisset, Fruhwirth, et al.
- 1994
(Show Context)
Citation Context ...ain but is parametric in that it can be instantiated with an arbitrary constraint domain. There already exist several systems which provide such funcionality, for example CLPS ( [18]), ECLiPSe ([10], =-=[5]-=-) or CAL ([22]). In this paper we report another system that we developed. The name RISC-CLP(Tree(\Delta)) indicates that constraint solving over symbolic trees over some arbitrary user-defined constr... |

2 |
et al. A saclib 1.1 user's guide
- Collins
- 1993
(Show Context)
Citation Context ...like the ones in computer algebra systems, whereas our system aims more at efficiency using constraint solvers written in traditional programming languages and computer algebra libraries (like SACLIB =-=[6]-=- and Sturm [14]). CLPS also provides abstraction levels (3 levels in one dimension vs. 6 levels in two dimensions in our system) and constraints are stored as normal PROLOG structures and This researc... |

2 |
A high-level approach to the realization of CLP languages
- Holzbaur
- 1992
(Show Context)
Citation Context ... more) attached attributes. Metaterms behave in some respects like variables, but in most respects their behaviour is user-definable (e.g. what happens with them on unification, etc.) ([20], [19] and =-=[11]-=-). By this method one can integrate constraint solvers into a logic programming system. The drawback of this method is that one is still restricted to PROLOG syntax (including constants). Furthermore ... |