# Automata Techniques for Temporal Answer Set Programming

arXiv: https://arxiv.org/abs/2109.08279 · HTML: https://mlsanity.com/paper/2109.08279/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 47 references that are in the map.
- First posted on arXiv 17 Sep 2021.

## Builds on (most cited first, 4 of 4)

- [Multi-shot ASP solving with clingo](https://mlsanity.com/paper/1705.09811/) (2017)
- [Experimenting with robotic intra-logistics domains](https://mlsanity.com/paper/1804.10247/) (2018)
- [Temporal Answer Set Programming on Finite Traces](https://mlsanity.com/paper/1804.10227/) (2018)
- [First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation](https://mlsanity.com/paper/1901.06108/) (2019)

## Abstract (arXiv)

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.