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
A logical approach to represent and reason about calendars
- Trang 134-140
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......
#Calendars #Computer science #Logic #Formal specifications #Databases #Data mining #Problem-solving #Natural languages #Qualifications #Testing
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
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
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
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
Reasoning with disjunctive fuzzy temporal constraint networks
- Trang 36-43
The disjunctive fuzzy temporal constraint network (DFTCN) model is a framework that allows reasoning with fuzzy qualitative and quantitative complex temporal constraints. However, its general complexity is exponential. In this work, we review methods that can reduce this complexity, based on graph topology and preprocessing. The final goal is to integrate all these methods into a general tool for ......
#Fuzzy reasoning #Scheduling #Network topology #Fuzzy sets #Computer networks #Degradation #Algebra #Uncertainty #Filtering #Testing