Convert some table into combinatorial circuit + optimization

Hi.
Let's say, I have big table which is usually suitable to fit it in
some ROM.
But it's possible to construct some circuit containing only primitive
gates that acts just as that ROM.
Here is an example of converting tables from DES cipher into gates:
http://www.darkside.com.au/bitslice/
I'm interesting, is there any automated way to do so, thus to have on
output circuit with the smallest possible primitive gates (AND, OR,
NOT, XOR).

sdf