Hey guys, Learning 2 sat problem algos.Understood how to solve the normal OR AND expression and find satisfiability. http://codeforces.net/contest/568/problem/C

In the above problem, take ex. rules: 1 V 3 C 3 C 5 C 1 V 5 V

if i understood it right , the boolean expression will be F= (1 XOR 3 ) AND (3 X-NOR 5) AND (1 X-NOR 5) If i am right how do i solve xor clauses? Specifically what will be corr. implications of the xors and xnors to add to implication graph ?