31 search results - page 2 / 7 » Converting Constraint Handling Rules to Equivalent Transform... |
LOPSTR
2009
Springer
13 years 12 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
TPLP
2008
13 years 5 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
ICMT
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on pattern...
LOPSTR
2007
Springer
13 years 11 months ago
2007
Springer
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expres...
SMI
2010
IEEE
13 years 3 months ago
2010
IEEE
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...