Tractable Anytime Temporal Constraint Propagation

Louis J. Hoebel

A major concern when reasoning about time in artificial intelligence problems is computational tractability. We present a method for applying temporal reasoners to large scale dynamic problems. We present a partitioning of the temporal database and means of constraint propagation that presents an efficient approach for producing tractable systems. Our goal is not to enhance underlying reasoners but to develop mechanisms by which reasoning about time can be practically applied to certain problems. Tractable computation is the basic consideration.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.