700 search results - page 56 / 140 » On Termination of Constraint Logic Programs |
ICLP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
LATA
2010
Springer
15 years 8 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
112
click to vote
AMAI
1999
Springer
14 years 11 months ago
1999
Springer
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
131
click to vote
ECOWS
2006
Springer
15 years 2 months ago
2006
Springer
In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, ca...
HOTDEP
2008
15 years 1 months ago
2008
We describe a technique for writing distributed applications which manage themselves over one or more utility computing infrastructures: by dynamically acquiring new computational...