T. Fruhwirth. A Declarative Language for Constraint Systems: Theory and Practice of Constraint Handling Rules. Habilitation, Computer Science Institute, LMU Munich, 1998. Shortened version to appear in Journal of Logic Programming, Special Issue on Constraint Logic Programming, P. Stuckey and K. Marriot, editors. 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)
....called (constraint) stores, and the annotation V is a sequence of variables. Empty conjunctions are represented by the built in constraint true. We attribute to each state hF; E; DiV the formula 9 y F E D 1 Else use e.g. 8 x8 y ( G 1 : G j ) H1 : H i 9 z (B 1 : B k ) [Fru97]. 8 as its logical meaning, where y are the variables occurring in the state except the ones appearing in V , which remain free in the formula. When it is clear from the context, we will confuse a state S and its logical reading. We also will drop the annotation V from a state if it is not of ....
....binary search on them: A single interval is split in half as long as its size is above a certain threshold eps. eps is a lower bound for the size of the smallest nonempty interval possible in the constraint problem at hand. Since such a lower bound always exists, termination is not affected [Fru97]. Example 8.4. The constraints on intervals X, Y, Z c(X,Y, pbefore,pstarts] c(X,Z, pstarts,pduring] c(Y,Z, before,contains,after] can be tightened by path consistency to c(X,Y, before] c(Z,Y, before] c(X,Z, starts,during] while the constraints on points U, V and on intervals Y, Z ....
[Article contains additional citation context not shown here]
T. Fruhwirth, A Declarative Language for Constraint Systems - Theory and Practice of Constraint Handling Rules, Habilitation, Dept of Computer Science, LMU Munich, December 1997.
On Completion of Constraint Handling Rules - Abdennadher, Frühwirth (1998) (2 citations) (Correct)
....Simplify ; X Z; X = Y Definition 4. A CHR program is called terminating, if there are no infinite computations. For most existing CHR programs it is straightforward to prove termination using simple well founded orderings. Otherwise it is impossible without relying on implementational details [Fru98] The following theorem from [Abd97] gives a decidable, sufficient and necessary criterion for confluence of a terminating program: Theorem 1. A terminating CHR program is confluent iff all its critical pairs are joinable. 3 Completion The idea of completion as developed for term rewriting ....
T. Fruhwirth. A Declarative Language for Constraint Systems: Theory and Practice of Constraint Handling Rules. Habilitation, Computer Science Institute, LMU Munich, 1998.
On Completion of Constraint Handling Rules - Abdennadher, Frühwirth (1998) (2 citations) Self-citation (Fruhwirth) (Correct)
No context found.
T. Fruhwirth. A Declarative Language for Constraint Systems: Theory and Practice of Constraint Handling Rules. Habilitation, Computer Science Institute, LMU Munich, 1998. Shortened version to appear in Journal of Logic Programming, Special Issue on Constraint Logic Programming, P. Stuckey and K. Marriot, editors.
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