no code implementations • 19 Apr 2018 • Vernon Asuncion, Yan Zhang, Heng Zhang, Yun Bai, Weisheng Si
In particular, we prove that this language satisfies the so-called bounded derivation-depth prop- erty (BDDP), which implies that the CQA is first-order rewritable, and its data complexity is in AC0 .
