561 search results - page 30 / 113 » Slicing of Constraint Logic Programs |
103
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
116
click to vote
ICLP
2011
Springer
14 years 1 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
101
click to vote
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
HYBRID
1994
Springer
15 years 1 months ago
1994
Springer
Abstract. We present a language,Hybrid cc, for modeling hybrid systems compositionally. This language is declarative, with programs being understood as logical formulas that place ...