[图书][B] Logic Programming and Databases: An Overview

S Ceri, G Gottlob, L Tanca, S Ceri, G Gottlob, L Tanca - 1990 - Springer
This book deals with the integration of logic programming and databases to generate new
types of systems, which extend the frontiers of computer science in an important direction …

An amateur's introduction to recursive query processing strategies

F Bancilhon, R Ramakrishnan - Proceedings of the 1986 ACM SIGMOD …, 1986 - dl.acm.org
This paper surveys and compares various strategies for processing logic queries in
relational databases. The survey and comparison is limited to the case of Horn Clauses with …

[图书][B] Foundations of databases

S Abiteboul, R Hull, V Vianu - 1995 - sigmod.org
This database theory book provides a focused presentation of the core material on relational
databases, and presents a number of advanced topics in a unified framework. Some of the …

[PDF][PDF] What you always wanted to know about Datalog(and never dared to ask)

S Ceri, G Gottlob, L Tanca - IEEE transactions on knowledge and data …, 1989 - Citeseer
Datalog is a database query language based on the logic programming paradigm; it has
been designed and intensively studied over the last five years. We present the syntax and …

[PDF][PDF] Magic sets and other strange ways to implement logic programs

F Bancilhon, D Maier, Y Sagiv, JD Ullman - Proceedings of the fifth ACM …, 1985 - dl.acm.org
Several methods for implementing database queries expressed as logical rules are given
and they are compared for efficiency. One method, called “magic sets,” is a general …

On the power of magic

C Beeri, R Ramakrishnan - Proceedings of the sixth ACM SIGACT …, 1987 - dl.acm.org
This paper considers the efficient evaluation of recursive queries expressed using Horn
Clauses. We define sideways information passing formally and show how a query …

Negation as failure using tight derivations for general logic programs

A Van Gelder - The Journal of Logic Programming, 1989 - Elsevier
A general logic program is a set of rules that have both positive and negative subgoals. We
define negation in general logic programs as finite failure, but we limit proof attempts to tight …

Implementation of logical query languages for databases

JD Ullman - ACM Transactions on Database Systems (TODS), 1985 - dl.acm.org
We examine methods of implementing queries about relational databases in the case where
these queries are expressed in first-order logic as a collection of Horn clauses. Because …

Optimizing datalog programs

Y Sagiv - Proceedings of the sixth ACM SIGACT-SIGMOD …, 1987 - dl.acm.org
Datalog programs, ie, Prolog programs without function symbols, are considered It is
assumed that a variable appearing in the head of a rule must also appear in the body of the …

[图书][B] SNePS considered as a fully intensional propositional semantic network

SC Shapiro, WJ Rapaport - 1987 - Springer
Abstract SNePS, the Semantic Network Processing System, is a semantic network language
with facilities for building semantic networks to represent virtually any kind of information …