Executable temporal logic for non-monotonic reasoning

In this paper we view non-monotonic reasoning as a (special kind of) process. As temporal logic is a common formalism to specify and derive properties of processes, we introduce a variant of temporal logic as a general specification language for reasoning processes. We show that it is possible to execute finite specifications in this language, which leads to executability of a large class of finite non-monotonic reasoning processes