Journal of Logic Programming, Volume 7

Volume 7, Number 1, July 1989

• Daniele Nardi: Formal Synthesis of a Unification Algorithm by the Deductive-Tableau Method. 1-43 BibTeX
• Giorgio Gallo, Giampaolo Urbani: Algorithms for Testing the Satisfiability of Propositional Formulae. 45-61 BibTeX
• Lee Naish: Proving Properties of Committed Choice Logic Programs. 63-84 BibTeX

Volume 7, Number 2, September 1989

• Avshalom Houri, Ehud Y. Shapiro: A Sequential Abstract Machine for Flat Concurrent Prolog. 85-123 BibTeX
• Andrzej Ciepielewski, Seif Haridi, Bogumil Hausman: Or-Parallel Prolog on Shared Memory Multiprocessors. 125-148 BibTeX
• Saumya K. Debray: Flow Analysis of Dynamic Logic Programs. 149-176 BibTeX

Volume 7, Number 3, November 1989

• Lawrence Cavedon, John W. Lloyd: A Completeness Theorem for SLDNF Resolution. 177-191 BibTeX
• Timothy J. Hickey, Shyam Mudambi: Global Compilation of Prolog. 193-230 BibTeX
• Kenneth Kunen: Signed Data Dependencies in Logic Programs. 231-245 BibTeX