121 search results - page 20 / 25 » The complexity of temporal logic over the reals |
94
Voted
AGP
1994
IEEE
15 years 1 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
71
Voted
IPPS
2008
IEEE
15 years 3 months ago
2008
IEEE
—Hybrid P2P systems rely on the assumption that sufficient objects exist nearby in order to make the unstructured search component efficient. This availability depends on the o...
71
Voted
FUIN
2008
14 years 9 months ago
2008
The issue addressed in this paper concerns the discovery of frequent multi-dimensional patterns from relational sequences. The great variety of applications of sequential pattern m...
103
click to vote
WISE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
173
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...