Implementation of logical query languages for databases

DOI10.1145/3979.3980zbMath0573.68060OpenAlexW2027276583MaRDI QIDQ3691103

Jeffrey D. Ullman

Publication date: 1985

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3979.3980

zbMATH Keywords

logic programmingrelational databasesHorn clauseprologcapture rule

Mathematics Subject Classification ID

Related Items (23)

A logical query language for hypermedia systems ⋮ An algorithm to convert graphs into EDNF ⋮ Domain-independent formulas and databases ⋮ Controlling recursive inference ⋮ Deriving constraints among argument sizes in logic programs ⋮ Partial evaluation of queries in deductive databases ⋮ The generalized counting method for recursive logic queries ⋮ Magic sets revisited ⋮ Data independent recursion in deductive databases ⋮ Answering atomic queries in indefinite deductive databases ⋮ How expressive is stratified aggregation? ⋮ On temporal logic versus Datalog ⋮ A graph-based decomposition approach for recursive query processing ⋮ Logic programming with sets ⋮ On the convergence of query evaluation ⋮ Integration of expert systems and database management systems. - An extended disjunctive normal form approach ⋮ Binding propagation beyond the reach of rule/goal graphs ⋮ The parallel complexity of single rule logic programs ⋮ Permutation dependency in datalog programs ⋮ Recursive query processing: The power of logic ⋮ A relational approach to logic programming: The extended Alexander method ⋮ Bounds in the propagation of selection into logic programs ⋮ Translation of logic programs into functional fixpoint equations

Uses Software

• INGRES

This page was built for publication: Implementation of logical query languages for databases