223 search results - page 17 / 45 » Logic programs with monotone abstract constraint atoms |
MP
2011
12 years 10 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
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
1992
Springer
13 years 11 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
HYBRID
1994
Springer
13 years 11 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 ...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...