Volume 15, Number 1, October 1995
- 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
Volume 15, Number 2, November 1995
- Carl H. Smith, William I. Gasarch: Recursion Theoretic Models of Learning: Some Results and Intuitions. 151-166
- 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
Volume 15, Numbers 3-4, 1995
- 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
- Andrei Voronkov: On Computability by Logic Programs. 437-456
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team