Minimizing Datalog Programs Under Uniform Equivalence
For each rule r do
let r be a rule of P that has not yet been considered
let P be the program obtained by deleting rule r from P
if P uniformly contains r then
replace P with P
^
^
^
[Sagiv 88]
Previous slide
Next slide
Back to first slide
View graphic version