The Journal of Logic Programming 1991: Vol 10 Table of Contents

1 Pages·1991·0.21 MB·English

THE JOURNALO F
LOGIC PROGRAMMING
VOLUME 10, NUMBERS 1, 2, 3, AND 4, 1991
CONTENTS
DEFINITE-CLAUSE SET GRAMMARS: A FORMALISM FOR PROBLEM SOLVING
Takushi Tanaka
UNSOLVABLE PROBLEMS FOR SLDNF RESOLUTION
John C. Shepherdson
ENHANCING UNIFICATION IN PROLOG THROUGH CLAUSE INDEXING
Robert M. Colomb
A DECLARATIVE STATE TRANSITION SYSTEM
Ian Foster
ON-LINE ALGORITHMS FOR POLYNOMIALLY SOLVABLE SATISFIABILITY PROBLEMS
Giorgio Ausiello and Giuseppe F. Italiano
A PRACTICAL FRAMEWORK FOR THE ABSTRACT INTERPRETATION
OF LOGIC PROGRAMS
Maurice Bruynooghe
A TYPE SYSTEM FOR LOGIC PROGRAMS 125
Eyal Yardeni and Ehud Shapiro
AND-PARALLEL EXECUTION OF LOGIC PROGRAMS
ON A SHARED-MEMORY MULTIPROCESSOR 155
Yow-Jian Lin and Vipin Kumar
DATABASE LOGIC PROGRAMMING 179
Moshe Y. Vardi
SET CONSTRUCTORS IN A LOGIC DATABASE LANGUAGE 181
Catriel Beeri, Shamim Naqvi, Oded Shmueli, and Shalom Tsur
A SIMPLE CHARACTERIZATION OF UNIFORM BOUNDEDNESS
FOR A CLASS OF RECURSIONS 233
Jeffrey F. Naughton and Yehoshua Sagiv
ON THE POWER OF MAGIC 255
Catriel Beeri and Raghu Ramakrishnan
EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES 301
Gosta Grahne, Seppo Sippu, and Eljas Soisalon-Soininen
COMPARISON OF METHODS FOR LOGIC-QUERY IMPLEMENTATION 333
Alberto Marchetti-Spaccamela, Antonella Pelaggi, and Domenico Sacca