mlsanityData to 14 Oct 2026

Automata Techniques for Temporal Answer Set Programming

arXiv 2109.08279 ↗First posted 17 Sep 2021cs.AI cs.FL cs.LOcited by 0

Not on the map. Why?

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.

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

4 of 47 references.

References · 4

  1. 2017Multi-shot ASP solving with clingocited by 115
  2. 2018Experimenting with robotic intra-logistics domainscited by 12
  3. 2018Temporal Answer Set Programming on Finite Tracescited by 10
  4. 2019First-Order vs. Second-Order Encodings for LTLf-to-Automata Translationcited by 5

Built on by

Not cited yet.