• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 17,393
Next 10 →

Theory and Practice of Constraint Handling Rules

by Thom Frühwirth , 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of mu ..."
Abstract - Cited by 455 (37 self) - Add to MetaCart
Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting

Constraint Handling Rules

by Thom Frühwirth - Constraint Programming: Basics and Trends, LNCS 910 , 1995
"... . We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination of cons ..."
Abstract - Cited by 224 (33 self) - Add to MetaCart
of constraint solvers. In our approach, constraint evaluation is specified using multiheaded guarded clauses called constraint handling rules (CHRs). CHRs define determinate conditional rewrite systems that express how conjunctions of constraints propagate and simplify. In this paper we concentrate on CHRs

Probabilistic Constraint Handling Rules

by Thom Frühwirth, Alessandra Di Pierro, Herbert Wiklicky , 2002
"... Classical Constraint Handling Rules (CHR) provide a powerful tool for specifying and implementing constraint solvers and programs. The rules of CHR rewrite constraints (non-deterministically) into simpler ones until they are solved. In this paper we introduce an extension of Constraint Handling Rule ..."
Abstract - Cited by 20 (5 self) - Add to MetaCart
Classical Constraint Handling Rules (CHR) provide a powerful tool for specifying and implementing constraint solvers and programs. The rules of CHR rewrite constraints (non-deterministically) into simpler ones until they are solved. In this paper we introduce an extension of Constraint Handling

Probabilistic Constraint Handling Rules

by unknown authors
"... Abstract Classical Constraint Handling Rules (CHR) provide a powerful tool for specifying and implementing constraint solvers and programs. The rules of CHR rewrite constraints (non-deterministically) into simpler ones until they are solved. In this paper we introduce an extension of Constraint Hand ..."
Abstract - Add to MetaCart
Abstract Classical Constraint Handling Rules (CHR) provide a powerful tool for specifying and implementing constraint solvers and programs. The rules of CHR rewrite constraints (non-deterministically) into simpler ones until they are solved. In this paper we introduce an extension of Constraint

Welcome to Constraint Handling Rules

by Thom Frühwirth , 2008
"... Constraint Handling Rules (CHR) is a declarative concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multisets of relations called constraints until no more change occurs. As an introduction to CHR as a generalpurpose programming language we p ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Constraint Handling Rules (CHR) is a declarative concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multisets of relations called constraints until no more change occurs. As an introduction to CHR as a generalpurpose programming language we

Aggregates for Constraint Handling Rules

by Jon Sneyers, Peter Van Weert, Tom Schrijvers - In Djelloul, Duck et , 2007
"... Abstract. We extend the Constraint Handling Rules language with aggregates such as sum, count, findall, and min. The proposed extension features nested aggregate expressions over guarded conjunctions of constraints, a series of predefined aggregates, and application-tailored user-defined aggregates. ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. We extend the Constraint Handling Rules language with aggregates such as sum, count, findall, and min. The proposed extension features nested aggregate expressions over guarded conjunctions of constraints, a series of predefined aggregates, and application-tailored user-defined aggregates

Visualization of Constraint Handling Rules

by Nada Sharaf, Slim Abdennadher, Thom Frühwirth - UNDER CONSIDERATION FOR PUBLICATION IN THEORY AND PRACTICE OF LOGIC PROGRAMMING , 2003
"... Constraint Handling Rules (CHR) has matured into a general purpose language over the past two decades. Any general purpose language requires its own development tools. Visualization tools, in particular, facilitate many tasks for programmers as well as beginners to the language. The article presents ..."
Abstract - Add to MetaCart
Constraint Handling Rules (CHR) has matured into a general purpose language over the past two decades. Any general purpose language requires its own development tools. Visualization tools, in particular, facilitate many tasks for programmers as well as beginners to the language. The article

On Confluence of Constraint Handling Rules

by Slim Abdennadher, Thom Fruhwirth, Holger Meuss - IN 2ND INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP'96, LNCS 1118 , 1996
"... We introduce the notion of confluence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simplifies and solves constraints by applying rules. Confluence guarantees that a CHR program will always compute the same result for a given set of constrain ..."
Abstract - Cited by 14 (7 self) - Add to MetaCart
We introduce the notion of confluence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simplifies and solves constraints by applying rules. Confluence guarantees that a CHR program will always compute the same result for a given set

Constraint Handling Rules Frank Raiser

by Jon Sneyers, Jon Sneyers , 2009
"... This volume contains the papers presented at CHR 2009, the sixth international workshop on Constraint Handling Rules, held on ..."
Abstract - Add to MetaCart
This volume contains the papers presented at CHR 2009, the sixth international workshop on Constraint Handling Rules, held on

Termination of Constraint Handling Rules

by Paolo Pilozzi, Danny De Schreye
"... Constraint Handling Rules (CHR) [8] is a high-level programming language, designed for the easy implementation of custom constraint solvers. CHR is a language-extension, built on top of Java, C and half a dozen Prolog-variants. The language is currently used in many projects [8]. In contrast to earl ..."
Abstract - Add to MetaCart
Constraint Handling Rules (CHR) [8] is a high-level programming language, designed for the easy implementation of custom constraint solvers. CHR is a language-extension, built on top of Java, C and half a dozen Prolog-variants. The language is currently used in many projects [8]. In contrast
Next 10 →
Results 1 - 10 of 17,393
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University