Finding a single, all, or the most probable solution to a finite or non-finite interval algebra network

  • Authors:
  • André Trudel

  • Affiliations:
  • Jodrey School of Computer Science, Acadia University, Wolfville, Nova Scotia, Canada

  • Venue:
  • AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a unified approach for finding a single, all, or the most probable solution to an Interval Algebra network The network may contain finite, non-finite, or a mixture of both types of temporal intervals.