T. Fr#hwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science. Springer-Verlag, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Implementing Non-Linear Constraints With Cooperative Solvers - Monfroy, Rusinowitch.. (1995) (10 citations) (Correct)
....But this is not the only task for the communication manager: it also launches the requested components (if not already running) it kills them when they are not needed anymore and it manages the list of running components (how to communicate with them) 3. 3 The constraint manager CHRs [8] de ne determinate conditional rewriting systems that specify how conjunctions of constraints propagate and simplify. CHRs have been integrated in ECLiPSe as an extension for writing user de ned constraints. Since the CHRs provide a framework for writing user de ned constraints, they are used in ....
T. Fr#hwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
Anwendungen Constraintbasierter Programmierung - Frühwirth, Abdennadher (1997) (Correct)
....eines Constraintl osers f ur die urspr unglichen Constraints m oglich w are. Um Constraints so verwenden zu k onnen, wie sie in einer Anwendung auftreten, wurde eine spezielle Sprache, Constraint Handling Rules (CHR) zum Implementieren von Constraintl osern in den 90er Jahren entwickelt [3]. Die Sprache erm oglicht die schnelle Erstellung von Prototypen, von Erweiterungen, von Spezialisierungen und von Kombinationen von Constraintl osern. CHR sind eine Spracherweiterung, die in eine Programmiersprache als Bibliothek eingebettet werden k onnen. In der Basissprache werden Programme ....
T. Fr uhwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, LNCS 910. Springer-Verlag, March 1995.
Finite Domain Solvers Compared Using Self Referential Quizzes - Fernandez, Hill (1997) (Correct)
.... approach, called the glass box approach, allows the user to control the constraint solver at a more detailed level [vHE 94] We consider here two black box constraint languages (ECL i PS e [AGG 95, BRI 95] and Oz [SMO 95] and two glass box languages (clp(FD) COD 96, DIA 94] and CHR [FRU 94, BRI 95] comparing both their expressiveness and their efficiency. We chose these particular languages since all provide support for FD and boolean constraints, were free and easy to obtain and are being very popular within the logic constraint community. In addition, ECL i PS e includes ....
FR UHWIRTH T., Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, pp:90-107, LNCS 910, May 1994.
Implementing Constraint Solvers: Theory and Practice - Abdennadher, Frühwirth, Meuss (1996) (Correct)
....combining the declarativity of LP with the efficiency of CS. However most CLP languages are not extensible: Constraint solving is usually hard wired in a built in constraint solver written in a low level language. They do not allow for user defined constraints. Constraint handling rules (CHR) [4, 8] are a high level language extension to write constraint systems. CHR support rapid prototyping of application oriented constraint systems by providing executable specifications and efficient implementations due to an optimizing compiler. CHR allows for specialization, modification and combination ....
Fr uhwirth, T. Constraint handling rules. In Constraint Programming: Basics and Trends (March 1995), A. Podelski, Ed., LNCS 910.
A Theorem-Proving Approach to CLP - Wetzel, Kowalski, Toni (1995) (6 citations) (Correct)
....either in definition or integrity constraint form. Definitions are executed in conventional logic programming goal reduction manner, whereas integrity constraints are executed in forward reasoning style. Our use of integrity constraints is similar to Fr uhwirth s Constraint Handling Rules [Fr95]. However, in contrast to [Fr95] if and only if form is used for definitions, and disjunctions and existential quantifiers are represented explicitly. Another distinction is that we seek to develop an approach to CLP which incorporates Abductive Logic Programming (ALP) see [CoThTo91] and ....
....integrity constraint form. Definitions are executed in conventional logic programming goal reduction manner, whereas integrity constraints are executed in forward reasoning style. Our use of integrity constraints is similar to Fr uhwirth s Constraint Handling Rules [Fr95] However, in contrast to [Fr95], if and only if form is used for definitions, and disjunctions and existential quantifiers are represented explicitly. Another distinction is that we seek to develop an approach to CLP which incorporates Abductive Logic Programming (ALP) see [CoThTo91] and Semantic Query Optimization (SQO) ....
Fr uhwirth, T.: Constraint Handling Rules, in: Podelski, A. (ed.), Constraint Programming: Basic and Trends, LNCS 910, Springer-Verlag 1995
A Design for a Generic Constraint Solver for Ordered Domains - Fernández, Hill (1998) (Correct)
No context found.
FR UHWIRTH T., Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, pp:90-107, LNCS 910, May, 1994.
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