Seminar by Prof. Arun K Pujari
Temporal Constraint Satisfaction Using Interval Algebra
Prof. Arun K Pujari
Department of Computer Science
University of Hyderabad
Date: Thursday, October 31, 2002
Time: 04:15 PM
Venue: CS-101
Abstract
Temporal reasoning deals with the event modeling for handling scheduling, planning, natural language discourse and other similar tasks. An important aspect of temporal reasoning involves applying qualitative binary constraints between events. Allen's formulation of interval algebra is a popular representation for this purpose, and supports qualitative relations between the time intervals. However it does not support models of event duration. Known extensions of I/A which handle duration are essentially bi-network based CSP. In this talk we present a monolithic structure which enhances the expressiveness of I/A by incorporating duration information and discuss the tractability of this model in constraint satisfaction.
About the Speaker
Dr. Pujari is a faculty member in the Computer Science Department in the University of Hyderabad.