Determining the Relationship Among Sets

Hoon Hong, Stefan Ratschan

Date: July 19th (Friday)
Time: ??.??
Abstract
Checking the entailment/disentailment of sets is an important operation in constraint programming. We will generalize this problem to the problem of answering queries about sets using a certain query language. Furthermore we will present an efficient algorithm solving this problem for arbitrary non-linear polynomials.

______________
__________________________________________

Previous page RISC SWP Linz Austria