Annals of Mathematics and Artificial Intelligence, Volume 15

Volume 15, Number 1, October 1995

Enrico Giunchiglia, Alessandro Armando, Paolo Pecchiari: Structured Proof Procedures. 1-18
Mira Balaban: The F-logic Approach for Description Languages. 19-60
Daniel J. Lehmann: Another Perspective on Default Reasoning. 61-82
Wlodek Zadrozny, Michelle Y. Kim: Computational Mereology: A Study of Part-of Relations for Multimedia Indexing. 83-100
Alexander Bochman: Modal Nonmonotonic Logics Demodalized. 101-123

Emmanuel Kounalis, Michaël Rusinowitch: Reasoning with Conditional Axioms. 125-149
Carl H. Smith, William I. Gasarch: Recursion Theoretic Models of Learning: Some Results and Intuitions. 151-166
Michael J. Maher, Peter J. Stuckey: On Inductive Inference of Cyclic Structures. 167-208
Howard A. Blair, V. Wiktor Marek, John S. Schlipf: The Expressiveness of Locally Stratified Programs. 209-229
Adam Brooks Webber: Proof of the Interval Satisfiability Conjecture. 231-238
Krishnaprasad Thirunarayan: On the Equivalence of Upward and Downward Inheritance Reasoners. 239-256

Complexity Issues in Logic Programming

John S. Schlipf: Complexity and Undecidability Results for Logic Programming. 257-288
Thomas Eiter, Georg Gottlob: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. 289-323
Audrey Ferry: A Topological Characterization of the Stable and Minimal Model Classes of Propositional Logic Programs. 325-355
V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski: Complexity of Computing with Extended Propositional Logic Programs. 357-378
Yael Moscowitz, Ehud Y. Shapiro: On the Structural Simplicity of Machines and Languages. 379-405
Inderpal Singh Mumick, Oded Shmueli: How Expressive is Statified Aggregation? 407-434
Andrei Voronkov: On Computability by Logic Programs. 437-456