When the evolution of variables over time is relevant to a classification task, established classifiers cannot be applied directly as the typical input format (data table) is not appropriate. We propose a new representation of temporal patterns that includes constraints on (partial) presence, (partial) absence as well as the duration of temporal predicates. A general-to-specific search-based al...

Computers in consumers product are increasing. Many of these computers are controlled by software. To ensure that the consumer can use the product as expected the software must be tested. Unfortunately, testing is often neglected because it is costly and resource demanding. One solution to this is to make test tools and test methods available to the developers of software. The purpose of this r...

Public demand for intelligent services in their home environments can be expected to grow in the near future once the required technology becomes more widely available and mature. Many intelligent home services cannot be provided in a purely reactive fashion though since they require contextual knowledge about the environment and most importantly the activities the residents are engaged in at a...

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.

Managing symbolic and metric temporal information is fundamental for many real world applications such as scheduling, planning, data base design, computational linguistics and computational models for molecular biology. This motivates us to develop a temporal constraint solving system based on CSPs for handling the two types of temporal information. A main challenge when designing such systems ...

In this paper, we present constraint propagation techniques used in the OPIS scheduling system to update schedule descriptions and detect introduced inconsistencies. Our approach is summarized as follows: • A hierarchical model is used to represent resources and operations to be performed. Schedules are developed and maintained at different levels of precision which are explicitly associated wi...

The automatic generation of diagnostic decision trees from qualitative models is a reasonable compromise between the advantages of using a modelbased approach in technical 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 tree, in which nodes have a temporal ...

In this work, we investigate the computational complexity of Restless Temporal (s,z)-Separation, where are asked whether it is possible to destroy all restless temporal paths between two distinct vertices s and z by deleting at most k from a graph. A graph has fixed vertex set but edges have (discrete) time stamps. path uses with non-decreasing stamps spent each must not exceed given duration Δ...