Temporal Reasoning with Constraints on Fluents and Events

We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal constraints. Although the complete inference algorithm is exponential, we characterize a tractable core with limited expressibility and inferential power. Our results render a variety of constraint propagation techniques applicable for reasoning with constraints on Auents.

• Type: Conference
• Year: 1994
• Where: AAAI
• Authors: Eddie Schwalb, Kalev Kask, Rina Dechter
• Keywords: AAAI 1994, Complete Inference Algorithm, Intelligent Agents, Temporal Constraints, Temporal Reasoning