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

1 Pages·1991·0.21 MB·English

THE JOURNALO F
LOGIC PROGRAMMING
VOLUME 11, NUMBERS 1, 2, 3, AND 4, 1991
CONTENTS
AUTOMATED THEOREM PROVING AND LOGIC PROGRAMMING:
A NATURAL SYMBIOSIS
Larry Wos and William McCune
THE REDUCE-OR PROCESS MODEL FOR PARALLEL EXECUTION
OF LOGIC PROGRAMS
Laxmikant V. Kalé
COMMENTS ON “LOGIC-PROGRAMMING WITH EQUATIONS”
Pier Giorgio Bosco, Elio Giovannetti, Corrado Moiso, and Catuscia Palamidessi
BILATTICES AND THE SEMANTICS OF LOGIC PROGRAMMING
Melvin Fitting
A LINEAR CONTROL ALGORITHM FOR A CLASS
OF RULE-BASED SYSTEMS 117
Malik Ghallab and Gonzalo Escalada-Imaz
MEMORY- AND BUFFER-REFERENCING CHARACTERISTICS
OF A WAM-BASED PROLOG 133
Evan Tick
ON DERIVED DEPENDENCIES AND CONNECTED DATABASES 163
Philip W. Dart
MAGIC TEMPLATES: A SPELLBINDING APPROACH TO LOGIC PROGRAMS 189
Raghu Ramakrishnan
PARTIAL EVALUATION IN LOGIC PROGRAMMING 217
J. W. Lloyd and J. C. Shepherdson
CONSTRAINT LOGIC PROGRAMMING FOR REASONING ABOUT DISCRETE
EVENT PROCESSES 243
J. S. Ostroff
NEGATIVE SUBGOALS WITH FREE VARIABLES 271
Matthew L. Ginsberg
EFFICIENT BOTTOM-UP COMPUTATION OF
QUERIES ON STRATIFIED DATABASES 295
I. Balbin, G. S. Port, K.R amamohanarao, and K. Meenakshi
DECOMPOSABILITY AND ITS ROLE IN PARALLEL
LOGIC-PROGRAM EVALUATION 345
Ouri Wolfson and Avi Silberschatz
CORRECT ANSWERS TO ALLOWED PROGRAMS AND
QUERIES ARE GROUND 359
J. C. Shepherdson
TITLE INDEX TO VOLUME 11 363
AUTHOR INDEX TO VOLUME 11 364