Condition as temporal function in information systems

Abstract

The majority of events and choices in information systems are driven by conditions. We argue that, as for facts or events, conditions have a time life during which it is pertinent to deal with them. In this paper, we study conditions as temporal boolean functions in the context of boolean algebra. We provide a taxonomy of conditions and an algorithm for computing boolean operators based on a formal language theoretical approach.