A Definitional Fragment of Temporal Equilibrium Logic: from Temporal Programs to Compact Automata
This work considers a definitional fragment of Temporal Equilibrium Logic, which allows to capture temporal rules that contain complex (implication-free) temporal formulas in rule bodies, and shows how the set of all stable models of a theory can be represented as a non-deterministic finite state automaton (NFA).