Abstract
We solve unification problem for linear temporal logic (LTL). For any given formula φ, we verify if φ is unifiable in LTL; if yes, we construct its unfolded form; and, next, by this form we directly write out the most general unifier for φ. Thus, we show any unifiable in LTL formula has a most general unifier (thus, LTL enjoys unitary unification), though we also show that there are unifiable in LTL formulas which are not projective.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
