Learn More
Reasoning about time is important in real-life situations and in engineered systems. In this research, we develop new algorithms for solving the Simple Temporal Problems (STP) and the more general Temporal Constraint Satisfaction Problem (TCSP). First, we propose a new efficient algorithm, the STP-solver, for computing the minimal network of an STP. This(More)
  • 1