M. P. Bonacina and J. Hsiang. On rewrite programs: Semantics and relationsship with PROLOG. Journal of Logic Programming, 14:155--180, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Completion of Constraint Handling Rules - Abdennadher, Frühwirth (1998) (2 citations) (Correct)
....generic answers, even if a constraint cannot further be simplified. This retains some of the power of logic languages like Prolog, where several answers can be given, while avoiding infinitely many answers. Our approach is similar to the ones that related Prolog and TRS computation methods [DJ84,BH92] Example 8. A CHR formulation of the classical Prolog predicate member as a user defined constraint is (6= is built in) r1 member(X, false. r2 member(X, X ] true. r3 member(X, H T] X 6= H member(X,T) Using CHR, the goal member(X, 1,2,3] delays. However Prolog ....
M. P. Bonacina and J. Hsiang. On rewrite programs: Semantics and relationsship with PROLOG. Journal of Logic Programming, 14:155--180, 1992.
On Completion of Constraint Handling Rules - Abdennadher, Frühwirth (1998) (2 citations) (Correct)
No context found.
M. P. Bonacina and J. Hsiang. On rewrite programs: Semantics and relationsship with PROLOG. Journal of Logic Programming, 14:155--180, 1992.
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