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
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
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
Proceedings Ninth International Symposium on Temporal Representation and Reasoning
- 2002
Presents the front cover of the proceedings record.
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
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
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
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
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