The pushdown method to optimize chain logic programs (Q4645206): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-60084-1_102 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135621391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds in the propagation of selection into logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of magic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical query optimization by proof-tree transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized counting method for recursive logic queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive query processing: The power of logic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:28, 17 July 2024

scientific article; zbMATH DE number 6999460
Language Label Description Also known as
English
The pushdown method to optimize chain logic programs
scientific article; zbMATH DE number 6999460

    Statements

    The pushdown method to optimize chain logic programs (English)
    0 references
    0 references
    0 references
    0 references
    10 January 2019
    0 references
    0 references
    logic program
    0 references
    counting method
    0 references
    chain rule
    0 references
    predicate symbol
    0 references
    finite-state automaton
    0 references
    0 references