The Modus Ponens inference rule is generally expressed as:
$$ \begin{array}{rl} & P\rightarrow Q \\ & P \\ \hline \therefore & Q\end{array} $$
Is the below rule also considered to be Modus Ponens?
$$ \begin{array}{rl} & P \lor \lnot Q \\ & Q \\ \hline \therefore & P\end{array} $$
Yes.
Thanks to @Bernard Massé for pointing me in the right direction.
Here's the proof:
$(P \lor \lnot Q)$ can be written as $ (\lnot Q \lor P) $ - Commutative Property
$ (\lnot Q \lor P) $ can be written as $ (Q \rightarrow P) $ - Material Implication
By Modus Ponens :
$$ \begin{array}{rl} & Q\rightarrow P \\ & Q \\ \hline \therefore & P\end{array} $$ This is equivalent to
$$ \begin{array}{rl} & P \lor \lnot Q \\ & Q \\ \hline \therefore & P\end{array} $$