Labor Saving New Distinctions

Abstract

It has often been argued that ontologies ought to be determined pragmatically. We study this claim formally by considering a framework in which choosing new objects and relations is a computational task. Using this framework we examine two sets of examples, one involving new relations, the other new objects. For these examples, we consider the runtime space and time savings that can be achieved. We see that in some cases arbitrary new relations can be beneficial. The task of choosing new relations in this framework is shown to be NP-hard. For the class of new object examples we consider, new objects can reduce the runtime computation from O(√n2n) to O(n3).

Cite

Text

Woodfill. "Labor Saving New Distinctions." International Conference on Machine Learning, 1989. doi:10.1016/B978-1-55860-036-2.50108-9

Markdown

[Woodfill. "Labor Saving New Distinctions." International Conference on Machine Learning, 1989.](https://mlanthology.org/icml/1989/woodfill1989icml-labor/) doi:10.1016/B978-1-55860-036-2.50108-9

BibTeX

@inproceedings{woodfill1989icml-labor,
  title     = {{Labor Saving New Distinctions}},
  author    = {Woodfill, John},
  booktitle = {International Conference on Machine Learning},
  year      = {1989},
  pages     = {430-433},
  doi       = {10.1016/B978-1-55860-036-2.50108-9},
  url       = {https://mlanthology.org/icml/1989/woodfill1989icml-labor/}
}