Representation and Reasoning with Multi-Point Events

  • Authors:

  • Rattana Wetprasit;Abdul Sattar;Lina Khatib

  • Affiliations:

  • Knowledge Representation and Reasoning Unit School of Computing and Information Technology, Griffith University, Nathan, QLD 4111 Australia;Knowledge Representation and Reasoning Unit School of Computing and Information Technology, Griffith University, Nathan, QLD 4111 Australia;Computer Science Program, Florida Institute of Technology, 150 W. University Blvd., Melbourne, Fl. 32901, USA

  • Venue:
  • Constraints
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Allen‘s Interval Algebra (IA) and Vilain & Kautz‘s PointAlgebra (PA) consider an interval and a point as basic temporalentities (i.e., events) respectively. However, in many situationswe need to deal with recurring events that include multiple points,multiple intervals or combinations of points and intervals. Inthis paper, we present a framework to model recurring eventsas multi-point events (MPEs) by extending point algebra. Thereasoning tasks are formulated as binary constraint satisfactionproblems. We propose a polynomial time algorithm (based on vanBeek‘s algorithm) for finding all feasible relations. For theproblem of finding a consistent scenario, we propose a backtrackingmethod with a local search heuristic. We also describe an implementationand a detail empirical evaluation of the proposed algorithms.Our empirical results indicate that the MPE-based approach performsbetter than the existing approaches.