26 search results - page 1 / 6 » A Complete and Terminating Execution Model for Constraint Ha... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
CSCLP
2005
Springer
13 years 11 months ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
CP
2005
Springer
13 years 7 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
PODS
1991
ACM
13 years 8 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
ISMIS
2000
Springer
13 years 9 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...