Temporal Answer Set Programming on Finite Traces

In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental)...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 18; no. 3-4; pp. 406 - 420
Main Authors: CABALAR, PEDRO, KAMINSKI, ROLAND, SCHAUB, TORSTEN, SCHUHMANN, ANNA
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2018
Subjects:
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first