Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas

Open in new window