Automata Techniques for Temporal Answer Set Programming

09/17/2021
by   Susana Hahn, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/04/2021

Automata for dynamic answer set solving: Preliminary report

We explore different ways of implementing temporal constraints expressed...
research
02/17/2020

Implementing Dynamic Answer Set Programming

We introduce an implementation of an extension of Answer Set Programming...
research
08/31/2022

Learning Automata-Based Complex Event Patterns in Answer Set Programming

Complex Event Recognition and Forecasting (CER/F) techniques attempt to ...
research
06/15/2013

Encoding Petri Nets in Answer Set Programming for Simulation Based Reasoning

One of our long term research goals is to develop systems to answer real...
research
06/15/2013

Encoding Higher Level Extensions of Petri Nets in Answer Set Programming

Answering realistic questions about biological systems and pathways simi...
research
01/08/2013

Answer Set Programming for Stream Reasoning

The advance of Internet and Sensor technology has brought about new chal...
research
05/07/2014

claspfolio 2: Advances in Algorithm Selection for Answer Set Programming

To appear in Theory and Practice of Logic Programming (TPLP). Building o...

Please sign up or login with your details

Forgot password? Click here to reset