DAISy Dynamic Ambient Intelligent Systems Unit

In this paper a method to deal with the inference problem is presented. The database is represented with a directed bipartite graph. At each clearance level, different portions of the graph are accessible. Then, inference is defined as the existence of a " virtual " cycle of information flow, at any classification level. The method we present consists of algorithms that detect and eliminate these cycles. Finally an algorithm that deals with compound queries is presented.