most citedCanonical Logic Programs are Succinctly Incomparable with Propositional Formulas

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LO2015★ 1 cited

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas

Yuping Shen, Xishun Zhao

\emph{Canonical (logic) programs} (CP) refer to normal logic programs augmented with connective . In this paper we address the question of whether CP are \emph{succinctly…