Revisiting separation: algorithms and complexity

DOI10.1093/JIGPAL/JZZ081MaRDI QIDQ5020355zbMATH OpenOpenAlexFDO

Authors Daniel Oliveira, João Rasga

Publication date 5 January 2022

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzz081

Mathematics Subject Classification ID

Temporal logic (03B44) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Separation -- past, present, and future
• Anchored LTL separation
• Expressive completeness for metric temporal logic
• A separation theorem for discrete-time interval temporal logic
• Automata and temporal logic over arbitrary linear time

Cited in

(7)

• Optimal separation in exact query complexities for Simon's problem
• Biabduction (and related problems) in array separation logic
• Sharp separation and applications to exact and parameterized algorithms
• Separation -- past, present, and future
• Anchored LTL separation
• Efficient normalization of linear temporal logic
• Computing the complexity for Schelling segregation models

This page was built for publication: Revisiting separation: algorithms and complexity

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