What is the definition of the complexity class $D^P$?
In recent papers I sometimes read $D^P$ but could not find a definition of it. Unfortunately Complexity Zoo does not give one, too.
Is it the same as: "A language L is in the class $DP$ if and only if there are two languages $L_1\in NP$ and $L_2\in coNP$ such that $L = L_1\cap L_2$" (Def. 17.1 from Papadimitriou - Computational Complexity (1994))?
Note: In the stated definition it says $DP$ not $D^P$. But I was wondering if it is the same.