11 citations · 39 across the 12 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DM2015
Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses
Oliver Kullmann, Xishun Zhao
We establish a new bridge between propositional logic and elementary number theory. The main objects are "minimally unsatisfiable clause-sets", short "MUs", unsatisfiable conjuncti…
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…