scientific article; zbMATH DE number 4092827

MaRDI QIDQ3820060zbMATH OpenFDO

Authors Shan Chi, Lawrence Henschen

Publication date 1988

zbMATH Keywords

query answeringhyperresolutionnon-Horn clausesgeneralized closed world assumptionrecursive databasetheorem proven

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 3982568
• Implementation of logical query languages for databases
• A time bound on the materialization of some recursively defined views
• Recursive query processing in predicate-goal graph
• On compiling queries in recursive first-order databases

Cited in

(9)

• Recursive query processing in predicate-goal graph
• Implementation of logical query languages for databases
• Towards an algebraic theory of recursion
• An efficient strategy for non-Horn deductive databases
• Parsing as non-Horn deduction
• A graph-based decomposition approach for recursive query processing
• scientific article; zbMATH DE number 1953141 (Why is no real title available?)
• Horn clause queries and generalizations
• On compiling queries in recursive first-order databases

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820060)