Special Monotone SAT problem: NP complete?
The variant where $A=B$ is known as monotone not-all-equal 3-satisfiability, i.e., Monotone NAE3SAT.  According to Wikipedia, it is NP-complete.  It is not the same problem as Monotone-3-SAT.