192 search results - page 13 / 39 » Logic Programs with Abstract Constraint Atoms |
ICLP
1992
Springer
14 years 15 days 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
14 years 16 days 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 2 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...
ICLP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...