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
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
Representation and reasoning with disjunctive temporal constraints
- Trang 46-48
We show the expressiveness provided by a labelled point-based metric model for
specifying and reasoning about complex disjunctive temporal constraints. The
model allows us to manage disjunctive assertions, conjunctive and hypothetical
queries, and one-to-many constraints. Additionally, it becomes an adequate
support for reasoning on costs associated to constraints.
#Algebra #Costs #Time factors #Computational efficiency #Processor scheduling #Project management
Author index
- Trang 154-154 - 2002
The author index contains an entry for each author and coauthor included in the
proceedings record.
Tensed ontology based on simple partial logic
- Trang 141-145
Simple partial logic (SPL) is, broadly speaking, an extensional logic which
allows for the truth-value gap. First I give a system of propositional SPL by
partializing classical logic, as well as extending it with several non-classical
truth-functional operators. Second I show a way based on SPL to construct a
system of tensed ontology, by representing tensed statements as two kinds of
necessary st...
#Ontologies #Logic #Cost accounting #Art #Terminology
Temporal reasoning with classes and instances of events
- Trang 100-107
Representing and reasoning with both temporal constraints between classes of
events (e.g., between the types of actions needed to achieve a goal) and
temporal constraints between instances of events (e.g., between the specific
actions being executed) is a ubiquitous task in many areas of computer science,
such as planning, workflow, guidelines and protocol management. The temporal
constraints betw...
#Artificial intelligence #Computer science #Guidelines #Application software #Knowledge engineering #Protocols #Knowledge representation #Programming profession #Taxonomy
Indexed flows in temporal /spl times/ modal logic with functional semantics
- Trang 146-153
Two classical semantical approaches to studying logics which combine time and
modality are the T /spl times/ W-frames and Kamp-frames (Thomason (1984)). In
this paper we study a new kind of frame that extends the one introduced in
Burrieza et al. (2002). The motivation is twofold: theoretical, i.e.,
representing properties of the basic theory of functions (definability); and
practical, their use i...
#Logic #Time measurement #Computer applications #Application software #Clocks #Particle measurements #Communications technology #Boolean functions
A continuous planning framework with durative actions
- Trang 108-114
This paper describes a continuous planning framework to be used by a planning
agent situated within an environment, which reasons about goals with priorities
and deadlines, and actions with duration. The framework assumes that goals may
be generated continuously, which requires the interleaving of planning and
execution. Constraints upon time may mean it is not possible for all goals to be
achieve...
#Artificial intelligence #Computer science #Interleaved codes #Time factors #Process planning
Index based processing of semi-restrictive temporal joins
- Trang 70-77
Temporal joins are important but very costly operations. While a temporal join
can involve the whole time (and/or key) domain, we consider the more general
case where the join is defined by some time-key rectangle from the whole space
(i.e., when the user is interested in joining portions of the-usually
large-temporal data). In the most restrictive join, objects (within this
rectangle) are joined ...
#Clustering algorithms #Computer science #Concurrent computing #Indexing #Robustness #Finishing