Optimizing Bottom-Up Evaluation of Constraint Queries

Abstract

We consider a class of constraint logic programs including negation that can be executed bottom up without constraint solving, by replacing constraints with tests and assignments. We show how to optimize the bottom-up evaluation of queries for such programs using transformations based on analysis obtained using abstract interpretation. Although the paper… (More)
DOI: 10.1016/0743-1066(95)00050-X

Topics

  • Presentations referencing similar topics