Computational and structural aspects of openly specified type hierarchies

From MaRDI portal





One may identify two main approaches to the description of type hierarchies. In \textit{total specification}, a unique hierarchy is described. In \textit{open specification}, a set of constraints identifies properties of the hierarchy, without providing a complete description. Open specification provides increased expressive power, but at the expense of considerable computational complexity, with essential tasks being NP-complete or NP-hard. In this work, a formal study of the structural and computational aspects of open specification is conducted, so that a better understanding of how techniques may be developed to address these complexities. In addition, a technique is presented, based upon Horn clauses, which allows one to obtain answers to certain types of queries on open specifications very efficiently. For the entire collection see [Zbl 0967.00057].





Describes a project that uses

Uses Software






This page was built for publication: Computational and structural aspects of openly specified type hierarchies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762869)