2911 search results - page 193 / 583 » A Logic of Graph Constraints |
178
Voted
ICLP
2003
Springer
16 years 22 hour 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...
200
click to vote
ICWS
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work, we present a framework for the semantic composition of web services based on Statecharts and uniform community service descriptions. Our model is a two step process....
284
click to vote
MST
2010
15 years 5 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
197
click to vote
GRC
2005
IEEE
16 years 13 days ago
2005
IEEE
— In this article, a formalism for a specific temporal data mining task (the discovery of rules, inferred from databases of events having a temporal dimension), is defined. The...
173
click to vote
CP
2005
Springer
16 years 11 days ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...