Complexity of deciding the satisfiability of a quasi-monotone CNF formula

Question

A quasi-monotone CNF formula is a formula where each variable appears at most once as a positive literal (and any number of times as a negative literal).

What is the complexity of deciding its satisfiability?