Optimization of bound disjunctive queries with constraints

DOI10.1017/S1471068404002273MaRDI QIDQ5715450zbMATH OpenOpenAlexFDO

Authors Gianluigi Greco, Sergio Greco, Irina Trubitsyna, Ester Zumpano

Publication date 3 January 2006

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1471068404002273

zbMATH Keywords

disjunctive deductive databases with constraintsguess-and-check techniquemagic-set technique

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 1980928
• Pushing constraint selections
• Logic Programming
• Magic sets for disjunctive Datalog programs
• Optimizing bottom-up evaluation of constraint queries

Cited in

(11)

• Optimization of quasiconjunctive queries
• On the computational complexity of querying bounds on differences constraints
• scientific article; zbMATH DE number 1980928 (Why is no real title available?)
• Checking termination of bottom-up evaluation of logic programs with function symbols
• scientific article; zbMATH DE number 1405575 (Why is no real title available?)
• scientific article; zbMATH DE number 1424049 (Why is no real title available?)
• Enhancing magic sets with an application to ontological reasoning
• Logic Programming
• Block-Sorted Quantified Conjunctive Queries
• On acceptance conditions in abstract argumentation frameworks
• Magic Sets and their application to data integration

Describes a project that uses

Uses Software

• Smodels
• ASSAT

This page was built for publication: Optimization of bound disjunctive queries with constraints

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