Implementation of logical query languages for databases
From MaRDI portal
Recommendations
Cited in
(51)- Domain-independent formulas and databases
- Controlling recursive inference
- Partial evaluation of queries in deductive databases
- The generalized counting method for recursive logic queries
- Data independent recursion in deductive databases
- Integration of expert systems and database management systems. - An extended disjunctive normal form approach
- Binding propagation beyond the reach of rule/goal graphs
- Operation-oriented query language approach for recursive queries. I: Functional definition
- Operation-oriented query language approach for recursive queries. II: Prototype implementation and its integration with relational databases
- 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
- A logical query language for hypermedia systems
- An algorithm to convert graphs into EDNF
- Deriving constraints among argument sizes in logic programs
- Magic sets revisited
- On temporal logic versus Datalog
- Efficient model construction for Horn logic with VLog (system description)
- Translating relational queries into iterative programs
- Bounds in the propagation of selection into logic programs
- Deduction in non-Horn databases
- Translation of logic programs into functional fixpoint equations
- Fixpoint strategies for deductive databases
- Database query languages embedded in the typed lambda calculus
- How expressive is stratified aggregation?
- On the top-down method of establishment of the deducibility in logical databases
- An improved depth-first control strategy for query-subquery nets in evaluating queries to Horn knowledge bases
- Comparison of methods for logic-query implementation
- Answering atomic queries in indefinite deductive databases
- A correction of the termination conditions of the Henschen-Naqvi technique
- Horn clause queries and generalizations
- On compiling queries in recursive first-order databases
- A generalization of the differential approach to recursive query evaluation
- scientific article; zbMATH DE number 4049156 (Why is no real title available?)
- scientific article; zbMATH DE number 4049159 (Why is no real title available?)
- scientific article; zbMATH DE number 4053071 (Why is no real title available?)
- scientific article; zbMATH DE number 4064544 (Why is no real title available?)
- scientific article; zbMATH DE number 4092827 (Why is no real title available?)
- scientific article; zbMATH DE number 4094869 (Why is no real title available?)
- scientific article; zbMATH DE number 62656 (Why is no real title available?)
- scientific article; zbMATH DE number 176241 (Why is no real title available?)
- scientific article; zbMATH DE number 1182730 (Why is no real title available?)
- Abstract interpretation of database query languages
- scientific article; zbMATH DE number 219227 (Why is no real title available?)
- scientific article; zbMATH DE number 1416103 (Why is no real title available?)
- Recursive query processing in predicate-goal graph
- Querying logical databases
- A graph-based decomposition approach for recursive query processing
- Logic programming with sets
- On the convergence of query evaluation
This page was built for publication: Implementation of logical query languages for databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691103)
