Automata Techniques for Temporal Answer Set Programming

TL;DR

This paper explores automata-based techniques to enhance Answer Set Programming (ASP) for dynamic problems, leveraging automata theory and dynamic logic to improve reasoning with temporal operators.

Contribution

It introduces automata techniques into ASP solvers, specifically CLINGO, to better handle temporal and dynamic reasoning tasks.

Findings

Automata techniques improve ASP's handling of dynamic scenarios.

Enhanced ASP solver with automata-based reasoning capabilities.

Potential for more efficient temporal problem solving in ASP.

Abstract

Temporal and dynamic extensions of Answer Set Programming (ASP) have played an important role in addressing dynamic problems, as they allow the use of temporal operators to reason with dynamic scenarios in a very effective way. In my Ph.D. research, I intend to exploit the relationship between automata theory and dynamic logic to add automata-based techniques to the ASP solver CLINGO helping us to deal with theses type of problems.