On the non-efficient PAC learnability of conjunctive queries

Download PDF
Open Webpage

Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz

Published: 01 Jan 2024, Last Modified: 22 Jul 2025Inf. Process. Lett. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Conjunctive Queries (CQs) are known to be not efficiently PAC learnable. We give a self-contained exposition.•Acyclic CQs are not efficiently PAC learnable, even for very restrictive notions of acyclicity.•Conjunctive Queries (CQs), and Unions of Conjunctive Queries (UCQs), are efficiently PAC learnable with membership queries.