The principle of inclusion-exclusion requires examining all possible   
   combinations so it's NP-complete. Let's assume the set intersections   
   are expensive to compute, what are the AI approaches to get an   
   approximation of values based on this principle?   
      
   [ comp.ai is moderated ... your article may take a while to appear. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)