Proceedings Ninth International Symposium on Temporal Representation and Reasoning
SCOPUS (1997,2000-2008,2011,2013-2014)
1530-1311
Cơ quản chủ quản: N/A
Các bài báo tiêu biểu
A parameterized algebra for event notification services
- Trang 61-63
Event notification services are used in various applications such as digital
libraries, stock tickers, traffic control, or facility management. However to
our knowledge, a common semantics of events in event notification services has
not been defined so far. We propose a parameterized event algebra which
describes the semantics of composite events for event notification systems. The
parameters ser...
#Algebra #Logistics #Temperature sensors #Software libraries #Filtering #Database systems #Clocks
Logic Trạng thái Phân tán Dịch bởi AI
- Trang 55-57
Chúng tôi giới thiệu một logic thời gian để lý luận về các ứng dụng toàn cầu.
Trước tiên, chúng tôi định nghĩa một logic mô-đun cho địa phương tính, nhúng các
lý thuyết địa phương của mỗi thành phần vào một lý thuyết về các trạng thái phân
tán của hệ thống. Chúng tôi cung cấp cho logic một hệ thống tiên đề đầy đủ và
chuyên sâu. Sau đó, chúng tôi mở rộng logic với một toán tử thời gian. Đóng góp
củ...
#Logic #DSL #Đồng hồ #Giao tiếp bất đồng bộ #Ngôn ngữ đặc tả #Điện toán đồng thời #Điện toán phân tán #Trì hoãn #Điện toán phổ biến #Thư viện thời gian chạy
Temporal views as abstract relations
- Trang 116-123
Many natural languages use prepositions to mark relations between entities of
various kinds-between physical entities and their spatial locations, between
temporal entities and their temporal locations, between abstract entities of
various kinds (e.g. between ideas and their 'mental locations'). I show that the
consequences of using prepositions to relate temporal entities emerge naturally
from th...
#Physics computing #Natural languages #Logic #Dictionaries #Artificial intelligence #History #Eyes #Data mining #IEEE entities #Concrete
Extending the RETE algorithm for event management
- Trang 49-51
A growing number of industrial applications use rule-based programming.
Frequently, the implementation of the inference engine embedded in these
applications is based on the RETE algorithm. Some applications supervise a flow
of events in which time, through the occurrence dates of the events, plays an
important role. These applications need to be able to recognize patterns
involving events. Howeve...
#Engines #Pattern recognition #Clocks #Inference algorithms #Pattern matching #Java #Monitoring #Logic #Time factors
Performance of querying temporal attributes in object-relational databases
- Trang 58-60
We evaluate a model for temporal data utilizing the benefits of
object-relational database systems (ORDBS). In particular we show how attribute
timestamping can be efficiently implemented in state-of-the-art ORDBS. The
attribute timestamping concept is based on introducing user-specific types for
temporal versions of datatypes. Moreover on the physical level we make use of
user-defined index struc...
#Object oriented modeling #Indexing #Spatial indexes #Relational databases #Information systems #Database systems #Data models #Spatial databases #Size measurement
A finite-state approach to event semantics
- Trang 124-131
Events employed in natural language semantics are characterized in terms of
regular languages, each string in which can be regarded as a motion picture. The
relevant finite automata then amount to movie cameras/projectors, or more
formally, to finite Kripke structures with partial valuations. The usual regular
constructs (concatenation, choice, etc) are supplemented with superposition of
strings/a...
#Automata #Motion pictures #Natural languages #Cameras #Computer science #Educational institutions #Cost accounting #Proposals #Labeling
Author index
- Trang 154-154 - 2002
The author index contains an entry for each author and coauthor included in the
proceedings record.
On the operational semantics of timed rewrite systems
- Trang 10-17
We propose an efficient operational semantics for a new class of rewrite
systems, namely timed rewrite systems. This class constitute a conservative
extension of first-order conditional term rewrite systems together with time
features such as clocks, signals, timed terms, timed atoms and timed rules. We
define first timed rewrite systems and illustrate them through some examples. A
naive approach ...
#Clocks #Proposals #Calculus #Logic devices #Logic programming #Computer languages #Natural languages #Shape #Equations #Tail
On non-local propositional and local one-variable quantified CTL*
- Trang 2-9
We prove decidability of 'non local' propositional CTL*, where truth values of
atoms may depend on the branch of evaluation. This result is then used to show
decidability of the 'weak' one-variable fragment of first-order (local) CTL*, in
which all temporal operators and path quantifiers except 'tomorrow' are
applicable only to sentences. Various spatio-temporal logics based on
combinations of CTL...
#Logic #Educational institutions #Computer science #Embedded computing #Instruments #Spatiotemporal phenomena #Calculus
A similarity search method of time series data with combination of Fourier and wavelet transforms
- Trang 86-92
Time-series data, such as stock exchange rates and weather data, has widely been
used in many fields. Similarity search of time-series data is important because
it is useful for predicting data changes and searching for common sources. In
this paper, we propose a new similarity search method of time-series data using
both a discrete Fourier transform (DFT) and wavelet transform (WT). A method of
r...
#Search methods #Fourier transforms #Wavelet transforms #Discrete Fourier transforms #Indexing #Discrete wavelet transforms #Time measurement #Shape measurement #Computer science #Stock markets