Similarity saturation for first order linear temporal logic with UNLESS

DOI10.1007/3-540-61630-6_23zbMath1427.68295OpenAlexW1537792051MaRDI QIDQ5236443

Regimantas Pliuškevičius

Publication date: 8 October 2019

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61630-6_23

zbMATH Keywords

sequent calculustemporal logiclinear temporal logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Temporal logic (03B44)

Cites Work

• On the interpretability of arithmetic in temporal logic
• A complete axiomatic characterization of first-order temporal logic of linear time
• The power of temporal proofs
• Incompleteness of first-order temporal logic with until
• Temporal logics need their clocks
• The saturated tableaux for linear miniscope Horn-like temporal logic
• Control problems in a temporal logic framework
• Up and Down The Temporal Way
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Similarity saturation for first order linear temporal logic with UNLESS