Temporal answer set programming on finite traces

DOI10.1017/S1471068418000297MaRDI QIDQ4559802zbMATH OpenOpenAlexWikidataFDO

Authors Pedro Cabalar, Roland Kaminski, Torsten Schaub, Anna Schuhmann

Publication date 4 December 2018

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.10227

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27) Temporal logic (03B44)

Abstract: 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) Answer Set Programming (ASP). Also, we argue that finite traces are more natural when reasoning about action and change. As a result, our approach is readily implementable via multi-shot ASP systems and benefits from an extension of ASP's full-fledged input language with temporal operators. This includes future as well as past operators whose combination offers a rich temporal modeling language. For computation, we identify the class of temporal logic programs and prove that it constitutes a normal form for our approach. Finally, we outline two implementations, a generic one and an extension of clingo.

Recommendations

• Temporal answer set programming
• Towards dynamic answer set programming over finite traces
• \textit{telingo} = ASP + time
• Integrating Temporal Extensions of Answer Set Programming
• Reasoning about actions with Temporal Answer Sets

Cites work

• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 774417 (Why is no real title available?)
• scientific article; zbMATH DE number 3313427 (Why is no real title available?)
• An infinitary encoding of temporal equilibrium logic
• Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz
• Temporal equilibrium logic: a survey

Cited in

(15)

• \textit{telingo} = ASP + time
• Towards dynamic answer set programming over finite traces
• Planning with Incomplete Information in Quantified Answer Set Programming
• Theoretical Computer Science
• Temporal ASP: from logical foundations to practical use with \texttt{telingo}
• Metric dynamic equilibrium logic
• Autoepistemic equilibrium logic and epistemic specifications
• Towards metric temporal answer set programming
• Temporal answer set programming
• First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
• Metric temporal equilibrium logic over timed traces
• Metric temporal answer set programming over timed traces
• Integrating Temporal Extensions of Answer Set Programming
• Reactive Answer Set Programming
• Past-present temporal programs over finite traces

Describes a project that uses

Uses Software

• Clingo

This page was built for publication: Temporal answer set programming on finite traces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559802)