English

Automata Techniques for Temporal Answer Set Programming

Artificial Intelligence 2021-09-20 v1 Formal Languages and Automata Theory Logic in Computer Science

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.

Keywords

Cite

@article{arxiv.2109.08279,
  title  = {Automata Techniques for Temporal Answer Set Programming},
  author = {Susana Hahn},
  journal= {arXiv preprint arXiv:2109.08279},
  year   = {2021}
}

Comments

In Proceedings ICLP 2021, arXiv:2109.07914

R2 v1 2026-06-24T06:03:29.318Z