Title :
A genetic approach to qualitative temporal reasoning with constraints
Author_Institution :
Dept. of Comput. Sci., Verona Univ., Italy
Abstract :
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
Keywords :
computational complexity; genetic algorithms; heuristic programming; temporal reasoning; NP-hard; artificial intelligence; computational time cost; constraints; genetic approach; hard instances; heuristic techniques; interval-based calculus; qualitative temporal information; qualitative temporal reasoning; temporal constraint networks; Algebra; Application software; Calculus; Computational efficiency; Computer networks; Computer science; Concrete; Genetic algorithms; Zirconium;
Conference_Titel :
Computational Intelligence and Multimedia Applications, 1999. ICCIMA '99. Proceedings. Third International Conference on
Conference_Location :
New Delhi
Print_ISBN :
0-7695-0300-4
DOI :
10.1109/ICCIMA.1999.798508
