Jürgen Dix, Martin Müller Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP] Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:15-28 [Conf]

Thomas Eiter, Georg Gottlob Complexity Results for Logic-Based Abduction. [Citation Graph (0, 0)][DBLP] Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:29-44 [Conf]

Audrey Ferry A Topological Characterization of the Stable and Minimal Model Classes of Propositional Logical Programs. [Citation Graph (0, 0)][DBLP] Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:45-68 [Conf]

Yael Moscowitz, Ehud Y. Shapiro On the Structural Simplicity of Machines and Languages. [Citation Graph (0, 0)][DBLP] Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:103-120 [Conf]

Inderpal Singh Mumick, Oded Shmueli Aggregation, Computability, and Complete Query Languages. [Citation Graph (0, 0)][DBLP] Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:121-142 [Conf]

John S. Schlipf A Survey of Complexity and Undecidability Results in Logic Programming. [Citation Graph (0, 0)][DBLP] Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:143-164 [Conf]

Andrei Voronkov On Computability by Logic Programs. [Citation Graph (0, 0)][DBLP] Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:165-0 [Conf]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP