Recursive query processing: The power of logic

DOI10.1016/0304-3975(89)90088-1zbMath0685.68077OpenAlexW2100264125MaRDI QIDQ1262144

Laurent Vieille

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90088-1

zbMATH Keywords

resolutionlogic programmingquery answering procedures

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (18)

Towards an efficient evaluation of recursive aggregates in deductive databases ⋮ Parallelism in logic programs ⋮ The anatomy of vampire. Implementing bottom-up procedures with code trees ⋮ An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases ⋮ Speeding up inferences using relevance reasoning: a formalism and algorithms ⋮ Unnamed Item ⋮ An analysis of loop checking mechanisms for logic programs ⋮ The pushdown method to optimize chain logic programs ⋮ Generalizing completeness results for loop checks in logic programming ⋮ Loop checks for logic programs with functions ⋮ On the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge Bases ⋮ Recursive queries and context-free graph grammars ⋮ Loop checking in SLD-derivations by well-quasi-ordering of goals ⋮ GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES ⋮ Regular path queries with constraints ⋮ Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete ⋮ Functional queries in datalog ⋮ Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recursive axioms in deductive databases
• Depth-first iterative-deepening: An optimal admissible tree search
• A relational approach to logic programming: The extended Alexander method
• The Alexander Method - a technique for the processing of recursive axioms in deductive databases
• Structure and complexity of relational queries
• Linear resolution with selection function
• Implementation of logical query languages for databases
• Automating control for logic programs
• On compiling queries in recursive first-order databases
• On the efficiency of subsumption algorithms
• Contributions to the Theory of Logic Programming
• Algorithm = logic + control
• Equivalences among Relational Expressions
• A Machine-Oriented Logic Based on the Resolution Principle
• An efficient context-free parsing algorithm
• The Specialization of Programs by Theorem Proving

This page was built for publication: Recursive query processing: The power of logic