The computational complexity of taxonomic inference
| Author(s) : | Radford Neal, |
| Publisher : | N/A |
| Publication Date : | 1989 |
| ISSN : | N/A |
| Abstract : | McAllester, Given, and Fatima [10] have developed a procedure for infering taxonomic relationships between classes defined by predicates and relations. Their decision procedure runs in O(n 3, |