Journal of Logic Programming, Volume 14

Volume 14, Numbers 1&2, October 1992

• Marianne Baudinet:
  Proving Termination Properties of Prolog Programs: A Semantic Approach. 1-29
  , preliminary version: LICS 1988
• Philip W. Dart, Justin Zobel:
  Efficient Run-Time Type Checking of Typed Logic Programs. 31-69
  
• Jieh Hsiang, Hélène Kirchner, Pierre Lescanne, Michaël Rusinowitch:
  The Term Rewriting Approach to Automated Theorem Proving. 71-99
  
• Sumit Ganguly, Abraham Silberschatz, Shalom Tsur:
  Parallel Bottom-Up Processing of Datalog Queries. 101-126
  
• Raymond Reiter:
  What Should a Database Know? 127-153
  
• Maria Paola Bonacina, Jieh Hsiang:
  On Rewrite Programs: Semantics and Relationship with Prolog. 155-180
  , preliminary version: NACLP 1990: 449-464
• Dimiter Skordev:
  Short Note: On Van Gelder's Loop Detection Algorithm. 181-183
  , paper: JLP 4(1): 23-31 (1987)
• Allen Van Gelder:
  Short Note: Van Gelder's Response. 185
  

Volume 14, Numbers 3&4, November 1992

• Evelina Lamma, Paola Mello, Antonio Natali:
  An Extended Warren Abstract Machine for the Execution of Structured Logic Programs. 187-222
  
• Yannis E. Ioannidis:
  Commutativity and its Role in the Processing of Linear Recursion. 223-252
  , preliminary version: VLDB 1989: 155-163
• H. Lewis Chau, Douglas Stott Parker Jr.:
  Narrowing Grammar: Theory, Implementation, and Applications. 253-286
  
• H. Albert Lilly, Barrett R. Bryant:
  A Prescribed Cut for Prolog that Ensures Soundness. 287-339
  
• Antonis C. Kakas, Paolo Mancarella:
  Short Note: Preferred Extensions are Partial Stable Models. 341-348
  

Last update Mon Feb 13 04:52:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page