Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 32 tok/s
GPT-5 High 40 tok/s Pro
GPT-4o 83 tok/s
GPT OSS 120B 467 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

An Algebra of Lightweight Ontologies (1809.01621v1)

Published 5 Sep 2018 in cs.AI and cs.LO

Abstract: This paper argues that certain ontology design problems are profitably addressed by treating ontologies as theories and by defining a set of operations that create new ontologies, including their constraints, out of other ontologies. The paper first shows how to use the operations in the context of ontology reuse, how to take advantage of the operations to compare different ontologies, or different versions of an ontology, and how the operations may help design mediated schemas in a bottom up fashion. The core of the paper discusses how to compute the operations for lightweight ontologies and addresses the question of minimizing the set of constraints of a lightweight ontology. Finally, the paper describes an implementation of the operations, as a Prot\'eg\'e plug-in.

Citations (1)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.