𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Building and maintaining ontologies: a set of algorithms

✍ Scribed by Nadira Lammari; Elisabeth Métais

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
396 KB
Volume
48
Category
Article
ISSN
0169-023X

No coin nor oath required. For personal study only.

✦ Synopsis

Is_A'' links are the core component of all ontologies and are organized into ''hierarchies of concepts''. In this paper we will first address the problem of an automatic help to build sound hierarchies. Dependencies called ''existence constraints'' are the foundation for the definition of a ''normalized'' hierarchy of concepts. In the first part of the paper algorithms are provided to obtain a normalized hierarchy starting either from concepts or from instances using Boolean functions. The second part of the paper is devoted to the hierarchy maintenance: automatically inserting, merging or removing pieces of knowledge. We also provide a way to give synthetic views of the hierarchy.

📜 SIMILAR VOLUMES

A Software Tool for Maintaining File and
A Software Tool for Maintaining File and Macro Build Dependencies
✍ BUFFENBARGER, JIM 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 611 KB

Translating each of a UNIX software system's source files into an object file, and linking the object files into an executable file, can be a time-consuming process. Object file generation accounts for most of this time. Tools that recognize and avoid unnecessary object file regeneration are very po

An extension of building sets and relati
An extension of building sets and relative difference sets
✍ Xiang-dong Hou; Surinder K. Sehgal 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

Building sets are a successful tool for constructing semi-regular divisible difference sets and, in particular, semi-regular relative difference sets. In this paper, we present an extension theorem for building sets under simple conditions. Some of the semi-regular relative difference sets obtained