Pushing Constraint Selections (1992)
| Venue: | Journal of Logic Programming |
| Citations: | 49 - 7 self |
BibTeX
@INPROCEEDINGS{Srivastava92pushingconstraint,
author = {Divesh Srivastava and Raghu Ramakrishnan},
title = {Pushing Constraint Selections},
booktitle = {Journal of Logic Programming},
year = {1992},
pages = {301--315}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we present a procedure that generates and propagates minimum QRP-constraints (if it terminates), based on the definition and uses of program predicates (Section 4). By propagating minimum QRP-constraints to the original program, we obtain a program that fully utilizes the constraint information present in the original program. This procedure is based on two sub-procedures: 1. Procedure Gen Prop predicate-constraints, which generates and propagates constraints that are satisfied by program predicates based on their definitions.
Citations
| 742 | Constraint logic programming - Jaffar, Lassez - 1987 |
| 46 | A Closed Form for Datalog Queries with Integer Order - Revesz - 1990 |
| 39 | On the representation of infinite temporal data and queries (extended abstract - Baudinet, Niezette, et al. - 1991 |
| 35 | A transformation system for deductive database modules with perfect model semantics - Maher - 1993 |
| 24 | On Fourier’s algorithm for linear arithmetic constraints - Lassez, Maher - 1992 |
| 23 | Propagating constraints in recursive deductive databases - Balbin, Kemp, et al. - 1989 |
| 22 | Polynomaial time query processing in temporal deductive databases - Chomicki - 1990 |
| 4 | Subsumption in constraint query languages with linear arithmetic constraints - Srivastava - 1992 |
| 1 | Brodsky and Yehoshua Sagiv. Inference of inequality constraints in logic programs - Alexander - 1991 |
| 1 | Ram88] Raghu Ramakrishnan. Magic Templates: A spellbinding approach to logic programs - conditions - 1990 |
