Searching for "Lower-bound Time-complexity Analysis of Logic Programs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Lower-bound Time-complexity Analysis of Logic Programs
by Andy King, Kish Shen, Florence Benoy — 1997 — In Jan Maluszynski, editor, International Symposium on Logic Programming
…Lower-bound Time-complexity Analysis of Logic Programs Andy King 1 , Kish Shen 2 and Florence…
Cited by 15 (4 self) – Add To MetaCart

Detecting and Exploiting Determinism in Logic Programs
by Pat Hill, Andy King
…, which is often measured by the number of resolution steps. The paper Lower-bound time-complexity…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB