Past-present temporal programs over finite traces

DOI10.1007/978-3-031-43619-2_53MaRDI QIDQ6545583FDOQ6545583

Authors Pedro Cabalar, Martín Diéguez, Francois Laferriere, Torsten Schaub

Publication date 29 May 2024

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Towards dynamic answer set programming over finite traces
• Temporal answer set programming on finite traces
• Loop formulas for splitable temporal logic programs
• Temporal answer set programming

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 6606365 (Why is no real title available?)
• A generalization of the Lin-Zhao theorem
• A new logical characterisation of stable models and answer sets
• Engineering an Incremental ASP Solver
• Loop formulas for splitable temporal logic programs
• On the expressiveness of temporal equilibrium logic
• Temporal answer set programming on finite traces
• Tight logic programs
• \textit{telingo} = ASP + time

This page was built for publication: Past-present temporal programs over finite traces

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