Holzbaur, C., M. Garca de la Banda, P. J. Stuckey and G. J. Duck, Optimizing Compilation of Constraint Handling Rules in HAL, Special Issue of Theory and Practice of Logic Programming on Constraint Handling Rules (2005), to appear. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Implication Checking for CHR Constraints - Schrijvers, Demoen, Duck.. (2005) Self-citation (Stuckey Duck) (Correct)
No context found.
Holzbaur, C., M. Garca de la Banda, P. J. Stuckey and G. J. Duck, Optimizing Compilation of Constraint Handling Rules in HAL, Special Issue of Theory and Practice of Logic Programming on Constraint Handling Rules (2005), to appear.
Extending Arbitrary Solvers with Constraint Handling Rules - Duck, Stuckey, Banda, al. (2003) (2 citations) Self-citation (Holzbaur Stuckey De la) (Correct)
No context found.
C. Holzbaur, P.J. Stuckey, M. Garca de la Banda, and D. Je#ery. Optimizing compilation of constraint handling rules. In P. Codognet, editor, Logic Programming: Proceedings of the 17th International Conference, LNCS, pages 74--89. Springer-Verlag,
Source-to-Source Transformation for a Class of Expressive Rules - Frühwirth, Holzbaur Self-citation (Holzbaur) (Correct)
No context found.
C. Holzbaur, M.G. de la Banda, D. Je rey, P. J. Stuckey, Optimizing Compilation of Constraint Handling Rules, in Proceedings of the International Joint Conference on Logic Programming (ICLP'01), 2001.
Extending Arbitrary Solvers with Constraint Handling Rules - Duck, Stuckey, Banda, al. (2003) (2 citations) Self-citation (Holzbaur Stuckey De la) (Correct)
No context found.
C. Holzbaur, P.J. Stuckey, M. Garca de la Banda, and D. Je#ery. Optimizing compilation of constraint handling rules. In P. Codognet, editor, Logic Programming: Proceedings of the 17th International Conference, LNCS, pages 74--89. Springer-Verlag,
To the Gates of HAL: a HAL tutorial - Banda, Demoen, Marriott, Stuckey (2002) Self-citation (Stuckey Garc Banda) (Correct)
....solvers. Indeed, it does not even fully support Herbrand constraints since it provides only a limited form of uni cation. This paper provides a high level introduction to HAL. For more detailed explanation of various aspects of HAL the interested reader is referred to our earlier publications [4, 3, 9, 2, 13]. In the next section we introduce the HAL language. In Section 3 we discuss the declarations supported by HAL, then in Section 4 we elaborate on how constraint solvers t within in the language. In Section 5 we illustrate the user extensible delay mechanism provided by HAL. Next in Section 6 we ....
....with a = and behavior except that the matching set S is deleted from G. A syntactic extension allows only part of the lhs to be eliminated by a simpli cation rule: lhs 1 n lhs 2 = guard rhs indicates that only the set matching lhs 2 is eliminated. As in most implementations, HAL CHRs [13] sit on top of the host language. More exactly, they may contain HAL code and are essentially compiled into HAL in a pre processing stage of the HAL compiler. As a consequence, CHR constraints de ned in HAL require the programmer to provide type, mode and determinism declarations. In HAL, CHR ....
C. Holzbaur, P.J. Stuckey, M. Garca de la Banda, and D. Je ery. Optimizing compilation of constraint handling rules. In P. Codognet, editor, Logic Programming: Proceedings of the 17th International Conference, LNCS, pages 74-89. SpringerVerlag, 2001.
Building Constraint Solvers with HAL - Banda, Jeffery, Marriott.. (2001) Self-citation (Holzbaur Stuckey Garc Banda Je) (Correct)
....of the lhs to be eliminated by a simpli cation rule: lhs 1 n lhs 2 = guard rhs indicates that only the set matching lhs 2 is eliminated. Ecient implementations of CHRs are provided for SICStus Prolog, Eclipse Prolog (see [5] and Java [11] Recently, they have also been integrated into HAL [8]. As in most implementations, HAL CHRs sit on top of the host language. More exactly, they may contain HAL code and are essentially compiled into HAL in a pre processing stage of the HAL compiler. As a consequence, CHR constraints de ned in HAL require the programmer to provide type, mode and ....
C. Holzbaur, P.J. Stuckey, M. Garca de la Banda, and D. Je ery. Optimizing compilation of constraint handling rules. In Procs. of ICLP17, LNCS, 2001.
Guard and Continuation Optimization for Occurrence.. - Sneyers, Schrijvers.. (2005) (Correct)
No context found.
Christian Holzbaur, Mara Garca de la Banda, Peter Stuckey, and Gregory Duck. Optimizing compilation of Constraint Handling Rules in HAL. In Special Issue of Theory and Practice of Logic Programming on CHR, 2005. To appear.
The Computational Power and Complexity of Constraint.. - Sneyers, Schrijvers.. (Correct)
No context found.
Christian Holzbaur, Mara Garca de la Banda, Peter J. Stuckey, and Gregory J. Duck. Optimizing Compilation of Constraint Handling Rules in HAL. Theory and Practice of Logic Programming, Special Issue on CHR, 5(4+5), 2005.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC