In this paper, we attempt to use a sequence labeling model with features from dependency parsed tree for temporal relation identification. In the sequence labeling model, the relations of contextual pairs can be used as features for relation identification of the current pair. Head-modifier relations between pairs of words within one sentence can be also used as the features. In our preliminary...

Temporally frequent, cost-efficient and precise forest information requirements for national forest inventories, monitoring or protection tasks have grown over time and will continue to do so in the future. New perspectives are given by the airborne digital sensor ADS40, which provides entire image strips with high geometric, radiometric and temporal resolution (every three years for entire Swi...

In previous work we showed that the automatic generation of diagnostic decision trees from qualitative models is a reasonable compromise between the advantages of using a model-based approach in automotive domains and the constraints imposed by on-board applications. In this paper we extend the approach to deal with temporal information. We introduce a notion of temporal diagnostic decision tre...

Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contain labeled events with a temporal extension. Mining frequent temporal patterns from interval sequences proved to be a valuable tool for generating knowledge in the automotive business. In this paper we propose a new al...

A new method for fault detection is presented. It is based on a system description using temporal constraint nets. Temporal constraint nets are extended constraint nets capable of dealing with values that change with time. Faults are detected if observed behavior does not match the description. Matching is formulated as searching for solutions of the temporal constraint net. An efficient algori...

We study the extension of the alternating-time temporal logic (ATL) with strategy contexts: contrary to the original semantics, in this semantics the strategy quantifiers do not reset the previously selected strategies. We show that our extension ATLsc is very expressive, but that its decision problems are quite hard: model checking is k -EXPTIME-complete when the formula has k nested strategy ...

Formal behavioral specifications written early in the system-design process and communicated across all design phases have been shown to increase the efficiency, consistency, and quality of the system under development. To prevent introducing design or verification errors, it is crucial to test specifications for satisfiability. Our focus here is on specifications expressed in linear temporal l...

Many logics for modelling beliefs, desires and intentions of agents, such as Rao and Georgeff’s BDI logic and Wooldridge’s LORA, are based on temporal logics like CTL/CTL∗ (Computational Tree Logic) in which the structure of time is branching in the future and linear in the past. Recently, many attempts have been made to define logics for BDI agents by using extensions of CTL. In this paper, we...