scientific article; zbMATH DE number 4092827
[For the entire collection see Zbl 0638.00038.] By a recursive database the authors mean a set of clauses without non constant function symbols, containing transitive closure axioms A(x,y)\(\to R(x,y)\) and R(x,y) \& A(y,z)\(\to R(x,z)\). They are interested in goals (queries of the form R(c,d) with constants c,d, as well as in minimal closed positive goals of the form \(C\vee R(c,d)\). The latter corresponds to the possibility of R(c,d) under the generalized closed world assumption. A naive approach would simply generate all positive consequences (they are finite in number) say by hyperresolution and testing for subsumption. The authors provide more sophisticated algorithm based on the graph containing pairs corresponding to all positive A- literals. A query is answered by extracting all paths from this graph, forming the negative clauses from these paths, and sending them together with non-Horn clauses to a theorem proven.
- Implementation of logical query languages for databases
- Horn clause queries and generalizations
- On compiling queries in recursive first-order databases
- Towards an algebraic theory of recursion
- Decidable containment of recursive queries
- Recursive query processing in predicate-goal graph
- A graph-based decomposition approach for recursive query processing
- Parsing as non-Horn deduction
- An efficient strategy for non-Horn deductive 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)