In my project I have requirement to solve equation like this

(oid:10) and (lid:4 or lid:3) and ( (cid:91 or cid:92) OR (oid:13 and did:50))

And need to expend it like

oid:10 and lid:4 or oid:10 and lid:3 and cid:91 or oid:10 and lid:4 or oid:10 and lid:3 and cid:92 or oid:10 and lid:4 or oid:10 and lid:3 and oid:13 and .............

Does anybody have idea or algorithm to solve this kind of problem ?
Pleases share even if you have some partial idea.

From your example it is not clear exactly what you want to do. In Boolean logic there are some equivalences, for example "A AND (B OR C)" can be written as "(A AND B) OR (A AND C)", etc. If this kind of transformation is what you want to do, then study the rules of Boolean logic.

You got my requirement Jesper,
I want to expend my equation but problematically.
Only problem is i am not able to write logic for that.
I am considering expression tree right now but so far no success !