Volume 10,
Numbers 1/2/3&4,
January 1991
- Takushi Tanaka:
Definite-Clause Set Grammars: A Formalism for Problem Solving.
1-17 BibTeX
- John C. Shepherdson:
Unsolvable Problems for SLDNF Resolution.
19-22 BibTeX
- Robert M. Colomb:
Enhancing Unification in Prolog through Clause Indexing.
23-44 BibTeX
- Ian T. Foster:
A Declarative State Transition System.
45-67 BibTeX
- Giorgio Ausiello, Giuseppe F. Italiano:
On-Line Algorithms for Polynomially Solvable Satisfiability Problems.
69-90 BibTeX
- Maurice Bruynooghe:
A Practical Framework for the Abstract Interpretation of Logic Programs.
91-124 BibTeX
- Eyal Yardeni, Ehud Y. Shapiro:
A Type System for Logic Programs.
125-153 BibTeX
- Yow-Jian Lin, Vipin Kumar:
AND-Parallel Execution of Logic Programs on a Shared-Memory Multiprocessor.
155-178 BibTeX
- Moshe Y. Vardi:
Database Logic Programming.
179-180 BibTeX
- Catriel Beeri, Shamim A. Naqvi, Oded Shmueli, Shalom Tsur:
Set Constructors in a Logic Database Language.
181-232 BibTeX
,
preliminary version:
PODS 1987:
21-37
- Jeffrey F. Naughton, Yehoshua Sagiv:
A Simple Characterization of Uniform Boundedness for a Class of Recursions.
233-252 BibTeX
- Catriel Beeri, Raghu Ramakrishnan:
On the Power of Magic.
255-299 BibTeX
,
preliminary version:
PODS 1987:
269-283
- Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen:
Efficient Evaluation for a Subset of Recursive Queries.
301-332 BibTeX
,
preliminary version:
PODS 1987:
284-293
- Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà:
Comparison of Methods for Logic-Query Implementation.
333-360 BibTeX
Copyright © Wed Nov 19 19:18:33 2008
by Michael Ley (ley@uni-trier.de)
