On the non-efficient PAC learnability of conjunctive queries

An efficient PAC algorithm is a (possibly randomized) polynomial-time algorithm that takes as input a set of examples Conjunctive queries (CQs) are an extensively studied drawn from an unknown probability distribution D database query language that plays a prominent role and labeled as positive/negative according to an unknown in database theory.