minker@MIMSY.UMD.EDU (Jack Minker) (01/26/88)
The book,
FOUNDATIONS OF DEDUCTIVE DATABASES AND LOGIC PROGRAMMING
Edited by Jack Minker (University of Maryland),
will be available from Morgan-Kaufmann Publishers in early
March, 1988. Orders for the book can be made now. The ISBN
No. is: 0-934613-40-0. The book contains 752 pages and
costs $36.95.
This landmark volume explores the close relationship
between deductive databases and logic programming and the
foundational issues they share. A collection of original
research, contributed by leading researchers, the book grew
out of preliminary work presented at the Workshop on Founda-
tions of Deductive Databases and Logic Programming held in
Washington DC, August 1986. All the papers have been exten-
sively refereed and revised.
Part 1 introduces and examines the import of stratified
databases, and its relationship to circumscription, and pro-
vides a comprehensive survey of negation in deductive data-
bases and logic programming. Part 2 addresses fundamental
theoretical and practical issues in developing large-scale
deductive databases and treats problems such as informative
answers, semantic optimization, updates and computing
answers in non-Horn theories. Part 3 provides results con-
cerning unification, equivalence and optimization of logic
programs and provides a comprehensive survey of results con-
cerning logic programs and parallel complexity. An introduc-
tory survey offering background material and an overview of
research topics, name and subject indexes, and extensive
bibliographic references complete the work.
Invaluable to graduate students and researchers in
deductive databases and logic programming, FOUNDATIONS OF
DEDUCTIVE DATABASES AND LOGIC PROGRAMMING will also be of
interest to those working in automated theorem proving,
artificial intelligence and expert systems.
TABLE OF CONTENTS
INTRODUCTION
Minker, J., 1-16
Introduction to Foundations of Deductive Databases and Logic
Programming
PART 1 - NEGATION AND STRATIFIED DATABASES 17
Chapter 1 Shepherdson, J., 19-88
Negation in Logic Programming
Chapter 2 Apt, K.R., Blair, H. and Walker, A., 89-148
Towards a Theory of Declarative Knowledge
Chapter 3 Van Gelder, A., 149-176
Negation as Failure Using Tight Derivation for General Logic
Programs
Chapter 4 Lifschitz, V., 177-192
On the Declarative Knowledge of Logic Programs with Negation
Chapter 5 Przymusinski, T., 193-216
On the Semantics of Stratified Deductive Databases
Chapter 6 Topor, R. and Sonenberg, E.A., 217-240
On Domain Independent Databases
PART 2 - FUNDAMENTAL ISSUES IN DEDUCTIVE DATABASES AND
IMPLEMENTATIONS 241
Chapter 7 Chakravarthy, U.S., Grant, J. and Minker, J.,
243-273
Foundations of Semantic Query Optimization for Deductive
Databases
Chapter 8 Imielinski, T., 275-312
Intelligent Query Answering in Rule Based Systems
Chapter 9 Sadri, F. and Kowalski, R.A., 313-362
An Application of General Purpose Theorem Proving to Data-
base Integrity
Chapter 10 Manchanda, S. and Warren, D.S., 363-394
A Logic-Based Language for Database Updates
Chapter 11 Henschen, L.J. and Park, H., 395-438
Compiling the GCWA in Indefinite Deductive Databases
Chapter 12 Bancilhon F. and Ramakrishnan, R., 439-517
Performance Evaluation of Data Intensive Logic Programs
Chapter 13 Thom, J., Naish, L. and Ramamohanaro, K., 519-
543
A Superjoin Algorithm for Deductive Databases
PART 3 - UNIFICATION AND LOGIC PROGRAMS, 545
Chapter 14 Kanellakis, P., 547-585
Logic Programming and Parallel Complexity
Chapter 15 Lassez, J-L., Maher, M.J. and Marriott, K.,
587-625
Unification Revisited
Chapter 16 Maher, M.J., 627-658
Equivalences of Logic Programs
Chapter 17 Sagiv, Y., 659-698
Optimizing Datalog Programs
Chapter 18 van Emden, M.H. and Szeredi, P., 699-709
Converting AND-Control to OR-Control Using Program Transfor-
mation
AUTHOR ADDRESSES 711-714
REFEREES 715-716
AUTHOR INDEX 717-721
SUBJECT INDEX 723-746
--
JACK MINKER
minker.umcp-cs@udel-relay