Optimizing bottom-up evaluation of constraint queries

DOI10.1016/0743-1066(95)00050-XMaRDI QIDQ3128615zbMATH OpenOpenAlexFDO

Authors David B. Kemp, Peter J. Stuckey

Publication date 5 October 1997

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(95)00050-x

zbMATH Keywords

constraint logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Pushing constraint selections
• Bottom-up evaluation and query optimization of well-founded models
• Efficient goal directed bottom-up evaluation of logic programs
• Memoing evaluation for constraint extensions of datalog

Cited in

(8)

• Repeated redundant inequalities in constraint logic programming
• Subsumtion and indexing in constraint query languages with linear arithmetic constraints.
• Memoing evaluation for constraint extensions of datalog
• Evaluation of Rules for Coping with Insufficient Data in Constraint-Based Search Algorithms
• Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty
• Bottom-up evaluation of Datalog programs with arithmetic constraints
• Pushing constraint selections
• Optimization of bound disjunctive queries with constraints

This page was built for publication: Optimizing bottom-up evaluation of constraint queries

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