Automata Techniques for Temporal Answer Set Programming

Representing and reasoning about dynamic domains is a key problem in the field of Knowledge Representation and Reasoning. Dynamic and temporal logics are used to describe ordered events, thus they have been adopted as a powerful tool to handle domains where we need to capture actions and change. While most of the research around these formalisms is grounded on classical logic, there is a growing interest to incorporate such dynamic specifications to reason in a non-monotonic manner. One of the main candidates for modeling and solving problems with this type of logic is Answer Set Programming (ASP) [8]. ASP is a well-established approach to declarative problem solving where problems are encoded in the form of logic programs.