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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Engineering an Incremental ASP Solver
• Title not available (Why is that?)
• On the expressiveness of temporal equilibrium logic
• Tight logic programs
• A generalization of the Lin-Zhao theorem
• Temporal answer set programming on finite traces
• \textit{telingo} = ASP + time
• Loop formulas for splitable temporal logic programs
• A new logical characterisation of stable models and answer sets

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)