A genetic approach to qualitative temporal reasoning with constraints
Alessandro Fin · 2003
Temporal reasoning is an area of artificial intelligence, very important to many applications. A structure largely used to describe the qualitative temporal information is Allen's interval-based calculus. Inference in the full calculus is NP-hard, therefore some heuristic techniques are needed to solve this problem. A genetic algorithm that achieves a low computational time cost for hard instances of temporal constraint networks is presented.