Variable independence for first-order definable constraints

@article{Libkin2003VariableIF,
  title={Variable independence for first-order definable constraints},
  author={Leonid Libkin},
  journal={ACM Trans. Comput. Log.},
  year={2003},
  volume={4},
  pages={431-451}
}
Whenever we have data represented by constraints (such as order, linear, polynomial, etc.), running time for many constraint processing algorithms can be considerably lowered if it is known that certain variables in those constraints are independent of each other. For example, when one deals with spatial and temporal databases given by constraints, the projection operation, which corresponds to quantifier elimination, is usually the costliest. Since the behavior of many quantifier elimination… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Real Algebraic Geometry

  • J. BOCHNAK, M. COSTE, ROY, M.-F
  • 1998
Highly Influential
17 Excerpts

Similar Papers

Loading similar papers…