T. Graf, Raisonnement sur les contraintes en programmation en logique (in French), Ph.D. Thesis, Version of June 1989, Universite de Nice, France, September 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Theory and Practice of Constraint Handling Rules - Frühwirth (1998) (52 citations) (Correct)
....feasible constructs (demons, forward rules, conditionals) Di 88, vH89] for user defined constraints. These various constructs have been generalized into and made uniform by CHR. Demons are essentially single headed simplification CHR without guards. One version of CHIP also included forward rules [Gr89], which correspond to CHR without guards. In practice, demons and forward rules have been proven useful in CHIP applications in the boolean domain for circuit design and verification. Their potential to define constraint solvers in general was not realized, maybe because of their limitations. The ....
T. Graf, Raisonnement sur les contraintes en programmation en logique (in French), Ph.D. Thesis, Version of June 1989, Universite de Nice, France, September 1989.
Constraint Handling Rules - Frühwirth (1995) (24 citations) (Correct)
....built in and user defined constraints. These techniques are orthogonal to our approach and thus can be integrated. Demons are essentially single headed simplification CHRs without guards. However, labeling routines for a constraint are not possible. One version of CHIP also included forward rules [Gr89], which correspond to CHRs without guards. In practice, demons and forward rules have been proven useful in CHIP applications in the boolean domain for circuit design and verification. Their potential to define constraint solvers in general was not realised, maybe because of their limitations. ....
....which correspond to CHRs without guards. In practice, demons and forward rules have been proven useful in CHIP applications in the boolean domain for circuit design and verification. Their potential to define constraint solvers in general was not realised, maybe because of their limitations. [Gr89] also gives a detailed account of the semantics of forward rules and therefore CHRs without guards. In this sense, CHRs can be seen as an extension of the work on demons and forward rules in CHIP. 6.2 Combined and Extended Languages In the following we relate our approach to other work on ....
T. Graf, Raisonnement sur les contraintes en programmation en logique, Ph.D. Thesis, Version of June 1989 Universite de Nice, France, September 1989 (in French).
Constraint Simplification Rules - Frühwirth (1992) (1 citation) (Correct)
....techniques are orthogonal to our approach and thus can be integrated. Demons [A 90] are essentially single headed Replacement SiRs without guards. However, demons must define a constraint completely, no associated constraint definitions are allowed. One version of CHIP also included forward rules [Gr89], which correspond to SiRs without guards. Gr89] also gives a detailed account of the semantics of forward rules and therefore SiRs without guards. In this sense, SiRs can be seen as an extension of the work on demons and forward rules in CHIP. In practice, demons and forward rules have been ....
....can be integrated. Demons [A 90] are essentially single headed Replacement SiRs without guards. However, demons must define a constraint completely, no associated constraint definitions are allowed. One version of CHIP also included forward rules [Gr89] which correspond to SiRs without guards. [Gr89] also gives a detailed account of the semantics of forward rules and therefore SiRs without guards. In this sense, SiRs can be seen as an extension of the work on demons and forward rules in CHIP. In practice, demons and forward rules have been proven useful in CHIP applications in the boolean ....
T. Graf, Raisonnement sur les contraintes en programmation en logique, Ph.D. Thesis, Version of June 1989 Universite de Nice, France, September 1989 (in French).
J. LOGIC PROGRAMMING 1994:19, 20:1--679 1 Theory and.. - Thom Fruhwirth.. (Correct)
No context found.
T. Graf, Raisonnement sur les contraintes en programmation en logique (in French), Ph.D. Thesis, Version of June 1989, Universite de Nice, France, September 1989.
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