The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Current systems and formalisms for representing incomplete information generally suffer from at least one of two weaknesses. Either they are not strong enough for representing results of simple queries, or the handling and processing of the data, e.g. for query evaluation, is intractable. In this paper, we present a decomposition-based approach to addressing this problem. We introduce world-set decompositions (WSDs), a space-efficient formalism for representing any finite set of possible worldsarXiv:cs/0606075v2 fatcat:avx7g62vavd3vmnlfuatlivznq