IJCSLP 1992 Workshop on Structural Complexity and Recursion-theoretic methods in Logic-Programming

Howard A. Blair, V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel (Eds.): Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, November 13, 1992. Mathematical Sciences Institute, Cornell University

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier: Halting Problem of One Binary Horn Clause id Undecidable. 5-14
Jürgen Dix, Martin Müller: Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs. 15-28
Thomas Eiter, Georg Gottlob: Complexity Results for Logic-Based Abduction. 29-44
Audrey Ferry: A Topological Characterization of the Stable and Minimal Model Classes of Propositional Logical Programs. 45-68
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: Rule Systems and Well-Orderings. 69-92
V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski: Complexity of Computing with Extended Propositional Logic Programs. 93-102
Yael Moscowitz, Ehud Y. Shapiro: On the Structural Simplicity of Machines and Languages. 103-120
Inderpal Singh Mumick, Oded Shmueli: Aggregation, Computability, and Complete Query Languages. 121-142
John S. Schlipf: A Survey of Complexity and Undecidability Results in Logic Programming. 143-164
Andrei Voronkov: On Computability by Logic Programs. 165-