Using comparation queries in attribute-efficient learning of Boolean functions

We consider the problem of exact attribute-efficient learning functions of Post's closed classes with the help of comparation queries. Here, we show that the complexity of learning by comparation queries is not worse than by membership queries. Particularly, for some classes, if we use comparation queries, we get better value of complexity function.