Time is ubiquitous. Accounting for time and its interaction with change is crucial to modeling the dynamic world, especially in domains whose study of data is sensitive to time such as in medical diagnosis, financial investment, and natural language processing, to name a few. We present a framework that incorporates both uncertainty and time in its reasoning scheme. It is based on an existing k...

Reasoning with temporal constraints is a ubiquitous issue in many computer science tasks, for which many dedicated approaches have been and are being built. In particular, in many areas, including planning, workflow, guidelines and protocol management, one needs to represent and reason with temporal constraints between classes of events (e.g., between the types of actions needed to achieve a go...

The Unified Modeling Language (UML) receives increasing attention by designers of real-time systems. Several approaches already extend the UML notation for modeling real-time applications. In this context, it is essential to be able to specify time-bounded temporal constraints as a prerequisite to validate a model for correct system behavior. But currently, UML and corresponding extensions only...

We present a mathematical programming model for the combined vehicle routing and scheduling problem with time windows and additional temporal constraints. The temporal constraints allow for imposing pairwise synchronization and pairwise temporal precedence between customer visits, independently of the vehicles. We describe some real world problems where the temporal constraints, in the literatu...

It is common to find that the definition or common usage of a data modelling language causes there to be restrictions placed on the evolution of data values that are associated with schemas expressed in that modelling language. This paper terms these restrictions temporal constraints, and defines three types of temporal constraint which are argued to be useful modelling concepts, capturing impo...

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 b...

Heuristic search using heuristics extracted from the delete relaxation is one of the most effective methods in planning. Since finding the optimal solution of the delete relaxation is intractable, various heuristics introduce independence assumptions, the implications of which are not yet fully understood. Here we use concepts from graph theory to show that in problems with unary action precond...

In this article, we propose an Allen-like approach to deal with different types of temporal constraints about periodic events. We consider the different components of such constraints (thus, unlike Allen, we also take into account qualitative constraints) including frame times, user-defined periods, qualitative temporal constraints, and numeric quantifiers and the interactions between such comp...