---
title: "PARTS INFERENCE: Closed and Semi-Closed Partitioning Graphs"
authors:
  - "Mary Angela Papalaskaris"
  - "Lenhart K. Schubert"
doi: ""
url: "https://ijcai.org/proceedings/1981/60"
pdf: "https://ijcai.org/proceedings/1981/0060.pdf"
venue: "Proceedings of the Seventh International Joint Conference on Artificial Intelligence"
year: 1981
pages: "304-308"
track: "Nowledge Representation"
keywords:
---

# PARTS INFERENCE: Closed and Semi-Closed Partitioning Graphs

Mary Angela Papalaskaris, Lenhart K. Schubert

*Proceedings of the Seventh International Joint Conference on Artificial Intelligence*, 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.