ComputingComputer ScienceAlgorithmsNatural Language ProcessingDatabase ManagementPredicate LogicQuery ProcessingStructured Query LanguageDatalog
We show that for any safe datalog program P1 and any query Q (predicate of P1 with some bound arguments), there is another safe datalog program P2 that produces the answer to Q and takes no more time when evaluated by semi-naive evaluation than when P1 is evaluated topdown.
11
Catriel Beeri, Raghu Ramakrishnan · 1987 · 366 citations
Fernando C. N. Pereira, David H. Warren · 1983 · 298 citations · Full text
Computing, Computer Science, Syntax +11
EXTENSION TABLES: MEMO RELATIONS IN LOGIC PROGRAMMING.
Suzanne W. Dietrich · SLP · 1987 · 126 citations