Proceedings Ninth International Symposium on Temporal Representation and Reasoning

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
A logical approach to represent and reason about calendars
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 134-140
C. Combi, M. Franceschet, A. Peron
We propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time points properly labelled with proposition symbols marking the starting and ending points of the corresponding granules, and we intensively model sets of granularities with linear time logic formulas. Some real-world granularities are provi...... hiện toàn bộ
#Calendars #Computer science #Logic #Formal specifications #Databases #Data mining #Problem-solving #Natural languages #Qualifications #Testing
A parameterized algebra for event notification services
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 61-63
A. Hinze, A. Voisard
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...... hiện toàn bộ
#Algebra #Logistics #Temperature sensors #Software libraries #Filtering #Database systems #Clocks
Indexed flows in temporal /spl times/ modal logic with functional semantics
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 146-153
A. Burrieza, I.P. de Guzman, E. Munoz
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...... hiện toàn bộ
#Logic #Time measurement #Computer applications #Application software #Clocks #Particle measurements #Communications technology #Boolean functions
Index based processing of semi-restrictive temporal joins
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 70-77
Donghui Zhang, V.J. Tsotras
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 ...... hiện toàn bộ
#Clustering algorithms #Computer science #Concurrent computing #Indexing #Robustness #Finishing
Author index
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 154-154 - 2002
The author index contains an entry for each author and coauthor included in the proceedings record.
Temporal reasoning with classes and instances of events
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 100-107
P. Terenziani
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...... hiện toàn bộ
#Artificial intelligence #Computer science #Guidelines #Application software #Knowledge engineering #Protocols #Knowledge representation #Programming profession #Taxonomy
On the operational semantics of timed rewrite systems
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 10-17
M. Blanc, R. Echahed
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 ...... hiện toàn bộ
#Clocks #Proposals #Calculus #Logic devices #Logic programming #Computer languages #Natural languages #Shape #Equations #Tail
Performance of querying temporal attributes in object-relational databases
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 58-60
C. Kleiner, U.W. Lipeck
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...... hiện toàn bộ
#Object oriented modeling #Indexing #Spatial indexes #Relational databases #Information systems #Database systems #Data models #Spatial databases #Size measurement
On non-local propositional and local one-variable quantified CTL*
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 2-9
S. Bauer, I. Hodkinson, F. Wolter, M. Zakharyaschev
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...... hiện toàn bộ
#Logic #Educational institutions #Computer science #Embedded computing #Instruments #Spatiotemporal phenomena #Calculus
Logic Trạng thái Phân tán Dịch bởi AI
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - Trang 55-57
C. Montangero, L. Semini
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ủ...... hiện toàn bộ
#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
Tổng số: 24   
  • 1
  • 2
  • 3