S. Abdennadher and T. Fruhwirth. Operational equivalence of constraint handling rules. In Fifth International Conference on Principles and Practice of Constraint Programming, CP99, LNCS. Springer-Verlag, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Integration and Optimization of Rule-based Constraint Solvers - Abdennadher, Frühwirth (2004) Self-citation (Abdennadher Fruhwirth) (Correct)
No context found.
S. Abdennadher and T. Fruhwirth. Operational equivalence of constraint handling rules. In Fifth International Conference on Principles and Practice of Constraint Programming, CP99, LNCS. Springer-Verlag, 1999.
Integration and Optimization of Rule-based Constraint Solvers - Abdennadher, Frühwirth (2004) Self-citation (Abdennadher Fr) (Correct)
No context found.
S. Abdennadher and T. Fruhwirth. Operational equivalence of constraint handling rules. In Fifth International Conference on Principles and Practice of Constraint Programming, CP99, LNCS. Springer-Verlag, 1999.
Operational Equivalence of CHR Programs And Constraints - Abdennadher, Frühwirth (1999) Self-citation (Abdennadher) (Correct)
....= H 0 C) where x are the variables appearing in H , and (H H = H 0 C)V 7 P GV , then (H 0 C[H=H 0 ] V 0 7 P GV 0 . Proof. The claim holds due to the equality propagation property of the normalization function N and according to Lemma 1. A detailed proof can be found in [AF99]. Next we show that a computation can be repeated in a state where redundant built in constraints have been removed. Lemma 4. Let C be a conjunction of built in constraints. If H C G 7 S and CT j= 8 (G built C) then H G 7 S. Proof. This is a consequence of the following claim: If ....
....4. Let C be a conjunction of built in constraints. If H C G 7 S and CT j= 8 (G built C) then H G 7 S. Proof. This is a consequence of the following claim: If H C G 7 S and CT j= 8 (G built C) then H G 7 S. This claim can be proven by analyzing each kind of computation step [AF99]. Finally, the last Lemma refers to joinability of c critical states. Definition 13. Let C = n V i=1 C i be a conjunction of constraints, a permutation on [1; n] where 0 m n, then m V i=1 C i is a subconjunction of C. Lemma 5. Let P 1 and P 2 be terminating CHR programs ....
[Article contains additional citation context not shown here]
S. Abdennadher and T. Fruhwirth. Operational equivalence of constraint handling rules. Research report PMS-FB-1999-4, Computer Science Department, University of Munich, 1999.
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