$⊕P$-completeness of $⊕2SAT$
It is shown to be $\oplus P$-complete by Faben:
https://arxiv.org/abs/0809.1836
See Thm 3.5. Note that counting independent sets is same as counting solutions to monotone 2CNF.