606 search results - page 29 / 122 » Constraint Hierarchies and Logic Programming |
CADE
2001
Springer
14 years 8 months ago
2001
Springer
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
CORR
2004
Springer
13 years 7 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
13 years 7 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...
ICLP
2011
Springer
12 years 11 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...
LICS
1994
IEEE
13 years 11 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...