Sciweavers

IPL
2000
69views more  IPL 2000»
13 years 10 months ago
Generating all maximal models of a Boolean expression
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
Dimitris J. Kavvadias, Martha Sideri, Elias C. Sta...
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 10 months ago
Algorithms for Analysing Firewall and Router Access Lists
Network firewalls and routers use a rule database to decide which packets will be allowed from one network onto another. By filtering packets the firewalls and routers can improve...
Scott Hazelhurst
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
14 years 3 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley