Recursive query processing: The power of logic (Q1262144): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Marius Zimand / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Marius Zimand / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90088-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2100264125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences among Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Specialization of Programs by Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient context-free parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of subsumption algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compiling queries in recursive first-order databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relational approach to logic programming: The extended Alexander method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm = logic + control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear resolution with selection function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recursive axioms in deductive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating control for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Alexander Method - a technique for the processing of recursive axioms in deductive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3746920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of logical query languages for databases / rank
 
Normal rank

Latest revision as of 10:30, 20 June 2024

scientific article
Language Label Description Also known as
English
Recursive query processing: The power of logic
scientific article

    Statements

    Recursive query processing: The power of logic (English)
    0 references
    0 references
    1989
    0 references
    This work describes various techniques for query answering procedures for deductive databases, based on the resolution principle. A special emphasis is put on the efficiency of these procedures with respect to the ability to focus on the data relevant to the query, to avoid redundant computations, and to software engineering issues. The developed techniques are used in a general purpose procedure for recursive query processing. The paper convincingly proves the possibility of the logic programming approach to database systems.
    0 references
    query answering procedures
    0 references
    resolution
    0 references
    logic programming
    0 references
    0 references

    Identifiers