Volume 10, Number 1, January 1991

• 
  Takushi Tanaka: Definite-Clause Set Grammars: A Formalism for Problem Solving. 1-17
• 
  John C. Shepherdson: Unsolvable Problems for SLDNF Resolution. 19-22
• 
  Robert M. Colomb: Enhancing Unification in Prolog through Clause Indexing. 23-44
• 
  Ian T. Foster: A Declarative State Transition System. 45-67
• 
  Giorgio Ausiello, Giuseppe F. Italiano: On-Line Algorithms for Polynomially Solvable Satisfiability Problems. 69-90

Volume 10, Number 2, February 1991

• 
  Maurice Bruynooghe: A Practical Framework for the Abstract Interpretation of Logic Programs. 91-124
• 
  Eyal Yardeni, Ehud Y. Shapiro: A Type System for Logic Programs. 125-153
• 
  Yow-Jian Lin, Vipin Kumar: AND-Parallel Execution of Logic Programs on a Shared-Memory Multiprocessor. 155-178

Volume 10, Numbers 3&4, April-May 1991

• 
  Moshe Y. Vardi: Database Logic Programming. 179-180
• 
  Catriel Beeri, Shamim A. Naqvi, Oded Shmueli, Shalom Tsur: Set Constructors in a Logic Database Language. 181-232, (preliminary version: PODS 1987: 21-37)
• 
  Jeffrey F. Naughton, Yehoshua Sagiv: A Simple Characterization of Uniform Boundedness for a Class of Recursions. 233-252
• 
  Catriel Beeri, Raghu Ramakrishnan: On the Power of Magic. 255-299, (preliminary version: PODS 1987: 269-283)
• 
  Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen: Efficient Evaluation for a Subset of Recursive Queries. 301-332, (preliminary version: PODS 1987: 284-293)
• 
  Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Comparison of Methods for Logic-Query Implementation. 333-360

last updated on Sat May 18 06:23:58 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page