Writing out Unifiers in Linear Temporal Logic

DOI10.1093/LOGCOM/EXR022MaRDI QIDQ3165757zbMATH OpenOpenAlexFDO

Authors Vladimir Rybakov

Publication date 19 October 2012

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exr022

zbMATH Keywords

algorithmslinear temporal logicunificationmost general unifiers

Mathematics Subject Classification ID

Temporal logic (03B44)

Recommendations

• Unification in linear temporal logic LTL
• scientific article; zbMATH DE number 6287569
• Unified temporal logic
• From linear temporal logic properties to rewrite propositions
• A proof system for unified temporal logic
• Writing out unifiers for formulas with coefficients in intuitionistic logic
• A proof system for a unified temporal logic
• The Temporal Logic of Rewriting: A Gentle Introduction
• Unifying proof methodologies of duration calculus and timed linear temporal logic
• A simple rewrite system for the normalization of linear temporal logic

Cited in

(10)

• Unification in linear temporal logic LTL
• On rules
• Projective formulas and unification in linear temporal logic \(\mathrm{LTL}_{U}\)
• Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
• Admissibility and unification in the modal logics related to S4.2
• Projective formulas and unification in linear discrete temporal multi-agent logics
• Temporal logic with accessibility temporal relations generated by time states themselves
• Tutorial on admissible rules in Gudauri
• Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge
• Formulas expressing totally nonstable truth values of formulas

This page was built for publication: Writing out Unifiers in Linear Temporal Logic

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