Is XOR a combination of AND and NOT operators?
Yes. In fact, any logical operation can be built from the NAND operator, where
A NAND B = NOT(A AND B)
See for instance http://en.wikipedia.org/wiki/NAND_logic, which gives
A XOR B = (A NAND (A NAND B)) NAND (B NAND (A NAND B))
Digression: There is a story about certain military devices being designed using only NAND gates, so that only one part needs to be certified, stocked as spares, etc. I don't know whether it's actually true.
Meanwhile, let me add the fact that XOR is not expressible by any expression whose operations use only AND, OR, IMPLIES, ConverseImplies and IFF.
To see this, observe merely that True XOR True is False, but the other operations always take True input to True output, a feature that would be inductively preserved in complex expressions.