Skip to main content
Open Access Publications from the University of California

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 fluents.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View