The pushdown method to optimize chain logic programs

DOI10.1007/3-540-60084-1_102MaRDI QIDQ4645206zbMATH OpenOpenAlexFDO

Authors Sergio Greco, Domenico Saccà, Carlo Zaniolo

Publication date 10 January 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60084-1_102

zbMATH Keywords

chain rulecounting methodfinite-state automatonlogic programpredicate symbol

Mathematics Subject Classification ID

Logic programming (68N17) Formal languages and automata (68Q45)

Recommendations

• Grammars and automata to optimize chain logic queries
• scientific article; zbMATH DE number 176243
• On decompositions of chain datalog programs into P (left-)linear 1-rule components
• Efficient evaluation for a subset of recursive queries
• scientific article; zbMATH DE number 4049156

Cites work

• Bounds in the propagation of selection into logic programs
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 176243 (Why is no real title available?)
• Logical query optimization by proof-tree transformation
• On the power of magic
• Recursive query processing: The power of logic
• The generalized counting method for recursive logic queries

Cited in

(4)

• Magic sets for disjunctive Datalog programs
• Bounds in the propagation of selection into logic programs
• scientific article; zbMATH DE number 176243 (Why is no real title available?)
• Grammars and automata to optimize chain logic queries

This page was built for publication: The pushdown method to optimize chain logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645206)