Proceedings Ninth International Symposium on Temporal Representation and Reasoning
1530-1311
Cơ quản chủ quản: N/A
Lĩnh vực:
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
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 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
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
Applying local search to temporal reasoning
- Trang 94-99
Local search techniques have attracted considerable interest in the artificial intelligence (AI) community since the development of GSAT (Selman et al., 1992) and the min-conflicts heuristic (Minton et al., 1992) for solving large propositional satisfiability (SAT) problems and binary constraint satisfaction problems (CSPs) respectively. Newer SAT techniques, such as the Discrete Langrangian Metho......
#Artificial intelligence #Costs #Algebra #Feedback #Information technology #Gold #Australia #Constraint optimization #Process planning #Natural language processing
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
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
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