ML Anthology

Plausible Inferencing Using Extended Composition

Michael N. Huhns, Larry M. Stephens
IJCAI 1989 pp. 1420-1425
/ijcai/1989/huhns1989ijcai-plausible/

Abstract

Abstract. This paper considers the composition of tuples from two relations in order to derive additional tuples of one of these relations. Our purpose is to determine when the composition is plausible and for which relation the new tuples are derived. We first present a formal definition of composition and our extension to it. We next define conditions on the domains and ranges of the relations that are necessary for extended composition to occur. We then show how a set of underlying attributes, independently specified for each relation, is sufficient for determining plausible composition, when the primitives are combined according to an algebra. Finally, we apply our method for extended composition to a representative group of semantic relations and evaluate the results. 1

PDF Semantic Scholar

Cite

Text

Huhns and Stephens. "Plausible Inferencing Using Extended Composition." International Joint Conference on Artificial Intelligence, 1989.

Markdown

[Huhns and Stephens. "Plausible Inferencing Using Extended Composition." International Joint Conference on Artificial Intelligence, 1989.](https://mlanthology.org/ijcai/1989/huhns1989ijcai-plausible/)

BibTeX

@inproceedings{huhns1989ijcai-plausible,
  title     = {{Plausible Inferencing Using Extended Composition}},
  author    = {Huhns, Michael N. and Stephens, Larry M.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1989},
  pages     = {1420-1425},
  url       = {https://mlanthology.org/ijcai/1989/huhns1989ijcai-plausible/}
}