Lower-bound Time-complexity Analysis of Logic Programs

Andy King, Kish Shen, Florence Benoy. Lower-bound Time-complexity Analysis of Logic Programs. In ILPS. pages 261-275, 1997.

Authors

Andy King

This author has not been identified. Look up 'Andy King' in Google

Kish Shen

This author has not been identified. Look up 'Kish Shen' in Google

Florence Benoy

This author has not been identified. Look up 'Florence Benoy' in Google