The article presents a method for handling complex queries in databases that involve both positive and negative conditions. The researchers developed techniques to efficiently evaluate these queries in probabilistic databases, which store data with associated probabilities. By manipulating nested expressions and computing probability bounds, they were able to create a framework for evaluating various types of queries accurately. This framework was tested in real scenarios and found to be efficient in processing complex queries.