Journal of Logic Programming, Volume 34

Volume 34, Number 1, January 1998

• M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar:
  Transformational Methodology for Proving Termination of Logic Programs. 1-41
  

• Xining Li:
  A New Term Representation Method for Prolog. 43-57
  
• Jean-Jacques Hébrard, Philippe Luquet:
  The Horn Basis of a Set of Clauses. 59-66
  

Volume 34, Number 2, February 1998

• Roland N. Bol, Lars Degerstedt:
  Tabulated Resolution for the Well-Founded Semantics. 67-109
  
• Marc Denecker, Danny De Schreye:
  SLDNFA: An Abductive Procedure for Abductive Logic Programs. 111-167
  

Volume 34, Number 3, March 1998

• Ilyas Cicekli:
  Abstract Metaprolog Engine. 169-199
  
• Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng:
  Completeness and Properness of Refinement Operators in Inductive Logic Programming. 201-225
  
• David A. Rosenblueth, Julio C. Peralta:
  SLR Inference an Inference System for Fixed-Mode Logic Programs Based on SLR Parsing. 227-259
  

Last update Mon May 20 01:18:30 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page