The decidability of RPTL

DOI10.3233/978-1-60750-676-8-151MaRDI QIDQ5392504zbMATH OpenFDO

Authors Fahad Shahbaz Khan

Publication date 12 April 2011

Full work available at URL https://doi.org/10.3233/978-1-60750-676-8-151

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Formal languages and automata (68Q45) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 3909727
• Reasoning in a restricted temporal logic
• On the expressive power of temporal logic
• Regular linear temporal logic with past
• Regular Linear Temporal Logic

Cited in

(2)

• Reasoning in a restricted temporal logic
• scientific article; zbMATH DE number 1696827 (Why is no real title available?)

This page was built for publication: The decidability of RPTL

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