Cactus: A Branching-Time Logic Programming Language

Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of time, a fact that makes them unsuitable for certain types of applications. In this paper we introduce the new temporal logic programming language Cactus, which is based on a branching notion of time. In Cactus, the truth value of a predicate depends on a hidden time parameter which has a tree-like structure. As a result, Cactus appears to be especially appropriate for expressing non-deterministic computations or generally algorithms that involve the manipulation of tree data structures.

• Type: Conference
• Year: 1997
• Where: ECSQARU
• Authors: Panos Rondogiannis, Manolis Gergatsoulis, Themis Panayiotopoulos
• Keywords: Automated Reasoning, ECSQARU 1997, Programming Language, Programming Language Cactus, Temporal Programming Languages