I think there is no non-trivial way to do what the question is asking.
Let's say that a set of partial (possibly total) binary operations $S$ is complete for the symmetric difference operation $\triangle$ if
every operation in $S$ is a (possibly trivial) restriction of some composition of copies of $\triangle$, and
for every pair of sets $(A,B)$ there is a partial operation $\cdot$ that is a composition of partial operations in $S$ and has the property that $A \cdot B$ is defined and is equal to $A \mathbin{\triangle} B$. (Note that is weaker than saying that $S$ itself is a composition of partial operations in $S$, which is impossible if none of the operations in $S$ is total.)
Even with this weak version of the definition, the only sets $S$ that are complete for $\triangle$ are trivial, in a sense that we will make precise below. Note that by the first clause of the definition, and the fact that $\triangle$ is commutative, associative, and satisfies $A \mathbin{\triangle} A = \emptyset$, every partial operation $\cdot$ in $S$ is the restriction of one of the four following total operations:
The constant binary operation given by $A \cdot B = \emptyset$,
The projection given by $A \cdot B = A$,
The projection given by $A \cdot B = B$, and
The symmetric difference operation $\triangle$ itself.
The first three operations do not help us form any additional binary operations under composition, so we consider them to be trivial, and we assume that $S$ consists only of restrictions of $\triangle$.
A trivial way to get a complete set $S$ is for the union of the domains of the partial operations in $S$ to consist of all pairs $(A,B)$: for example, the proper set difference operation "$\setminus$" as defined in the question is simply the restriction of $\triangle$ to the domain $\{(A,B) : B \subseteq A\}$, so we could let $S = \{\setminus, \cdot\}$ where $\cdot$ is the restriction of $\triangle$ to the complementary domain $\{(A,B) : B \not \subseteq A\}$. More generally, we could weaken the triviality requirement to consider the domains of the partial operations in $S$ and their reverses; for example, this requirement would be satisfied by the set $S = \{\setminus, \cdot\}$ where $\cdot$ now denotes the restriction of $\triangle$ to the domain $\{(A,B) : A \not \subseteq B\}$.
However, every complete set is trivial in this way. Suppose that some pair $(A,B)$ is not in the domain of any partial operation $\cdot$ in $S$, and neither is the reversed pair $(B,A)$. Because the partial operations in $S$ are all binary, it is not hard to show that the pairs $(A,B)$ and $(B,A)$ cannot be in the domain of any composition of elements of $S$ either, so there is no way to get the symmetric difference $A \mathbin{\triangle} B$.
As written, you say that $x$ is in at least one of them, and $x$ is in neither of them. In other words, you've defined the empty set. To fix it, you could change $$x\notin A\wedge x\notin B$$ to $$x\notin A\vee x\notin B.$$
Best Answer
A function in two variables $f(x,y)$ is called symmetric if $f(x,y)=f(y,x)$.
It is easy to see that $A\mathbin{\triangle}B=B\mathbin{\triangle}A$, exactly because being in exactly in one of $A$ or $B$ is the same as being exactly in one of $B$ and $A$.
This is in contrast to set difference, where $A\setminus B$ is generally not the same as $B\setminus A$.