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:
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
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 the operational semantics of timed rewrite systems
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - 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
Performance of querying temporal attributes in object-relational databases
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - 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*
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - 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
Proceedings Ninth International Symposium on Temporal Representation and Reasoning
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - 2002
Presents the front cover of the proceedings record.
Tensed ontology based on simple partial logic
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - 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
Reasoning with disjunctive fuzzy temporal constraint networks
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - 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
A logical approach to represent and reason about calendars
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - 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
A continuous planning framework with durative actions
Proceedings Ninth International Symposium on Temporal Representation and Reasoning - - 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
Tổng số: 24
- 1
- 2
- 3