XOR representation of AND

Is it possible to represent the logic AND operation using only
NOT and XOR operations? For instance, I know that the AND operation
can be expressed using only OR and NOT operators:

AB = !(!A + !B)

However, is it possible to represent AND using XOR and NOT operators?
I've spent the past few hours trying to do so, thinking that it
must be possible. However, the longer I worked with it, the more I
realized just how symmetrical XOR is in nearly every respect. This is
what makes the whole ordeal tricky. I've searched the internet, and
looked in a textbook that I have, but haven't been able to find any
such representation of the AND operation. I slowly began to wonder if
it's even possible. Does anyone know for sure?
Thanks for your time.
.

Relevant Pages

  • Re: XOR representation of AND
    ... Steven schrieb: ... is it possible to represent AND using XOR and NOT operators? ... I've searched the internet, and ... looked in a textbook that I have, but haven't been able to find any ...
    (sci.logic)
  • Re: XOR representation of AND
    ... is it possible to represent AND using XOR and NOT operators? ... looked in a textbook that I have, but haven't been able to find any ...
    (sci.logic)