PARTS INFERENCE: Closed and Semi-Closed Partitioning Graphs
Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Nowledge Representation. Pages 304-308.
Abstract
We consider the problem of answering part -o f questions and questions about overlap tn partitioning structures, which ts of Importance tn A . l systems knowledgeable about parts relationships, set tncluston relationships or taxonomies of types . In an earl ter paper tt was noted that the problem o f extracting tnformatton from arbitrary sets of parttttontng assertions ( "P-graphs") Is Intractable (at least 1f P f NP) and the more restrtcttve class of quasi - hierarchical closed P-graphs was introduced as a fairl y fle)(tble representation of partitioning structures permitting efftctent Information extraction . The present paper Introduces the larger class of semi-closed P - graphs . and provides efftctent and complete methods for answering part-of and dlsjolntness questions based on such P-graphs.
@inproceedings{ijcai1981p60,
title = {PARTS INFERENCE: Closed and Semi-Closed Partitioning Graphs},
author = {Papalaskaris, Mary Angela and Schubert, Lenhart K.},
booktitle = {Proceedings of the Seventh International Joint Conference on
Artificial Intelligence, {IJCAI-81}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Roger C. Schank},
pages = {304--308},
year = {1981},
month = {8},
note = {Nowledge Representation},
url = {https://ijcai.org/proceedings/1981/60},
}
TY - CPAPER TI - PARTS INFERENCE: Closed and Semi-Closed Partitioning Graphs AU - Papalaskaris, Mary Angela AU - Schubert, Lenhart K. T2 - Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81 PB - International Joint Conferences on Artificial Intelligence PY - 1981 SP - 304 EP - 308 UR - https://ijcai.org/proceedings/1981/60 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
