
Temporal Logic Programs with Variables
In this note we consider the problem of introducing variables in tempora...
read it

Functional ASP with Intensional Sets: Application to GelfondZhang Aggregates
In this paper, we propose a variant of Answer Set Programming (ASP) with...
read it

Interpolable Formulas in Equilibrium Logic and Answer Set Programming
Interpolation is an important property of classical and many nonclassic...
read it

MANCaLog: A Logic for MultiAttribute Network Cascades (Technical Report)
The modeling of cascade processes in multiagent systems in the form of ...
read it

Temporal Answer Set Programming on Finite Traces
In this paper, we introduce an alternative approach to Temporal Answer S...
read it

Revisiting Explicit Negation in Answer Set Programming
A common feature in Answer Set Programming is the use of a second negati...
read it

Equilibrium Graphs
In this paper we present an extension of Peirce's existential graphs to ...
read it
Temporal Answer Set Programming
We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving. Such programs are the result of combining usual rules with temporal modal operators, as in Lineartime Temporal Logic (LTL). We focus on recent results of the nonmonotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the full syntax of LTL, but performs a model selection criterion based on Equilibrium Logic, a well known logical characterization of Answer Set Programming (ASP). We obtain a proper extension of the stable models semantics for the general case of arbitrary temporal formulas. We recall the basic definitions for TEL and its monotonic basis, the temporal logic of HereandThere (THT), and study the differences between infinite and finite traces. We also provide other useful results, such as the translation into other formalisms like Quantified Equilibrium Logic or Secondorder LTL, and some techniques for computing temporal stable models based on automata. In a second part, we focus on practical aspects, defining a syntactic fragment called temporal logic programs closer to ASP, and explain how this has been exploited in the construction of the solver TELINGO.
READ FULL TEXT
Comments
There are no comments yet.