On the Expressibility of Stable Logic Programming

What this record says

(We apologize for pidgin LaTeX) Schlipf \cite{sch91} proved that Stable Logic Programming (SLP) solves all $\mathit{NP}$ decision problems. We extend

CATALOG · The abstract is indexed.