Complexity and undecidability results for logic programming John S. Schlipf OriginalPaper Pages: 257 - 288
On the computational cost of disjunctive logic programming: Propositional case Thomas EiterGeorg Gottlob OriginalPaper Pages: 289 - 323
A topological characterization of the stable and minimal model classes of propositional logic programs Audrey P. Ferry OriginalPaper Pages: 325 - 355
Complexity of computing with extended propositional logic programs V. Wiktor MarekArcot RajasekarMirosław Truszczyński OriginalPaper Pages: 357 - 378
On the structural simplicity of machines and languages Yael MoscowitzEhud Shapiro OriginalPaper Pages: 379 - 405
How expressive is stratified aggregation? Inderpal Singh MumickOded Shmueli OriginalPaper Pages: 407 - 435