![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
timeletshttp://journals.plos.org/plosone/article?id=10.1371/journal.pone.0024274
Abstract
In this paper we introduce the olog, or ontology log, a category-theoretic model for knowledge representation (KR). Grounded in formal mathematics, ologs can be rigorously formulated and cross-compared in ways that other KR models (such as semantic networks) cannot. An olog is similar to a relational database schema; in fact an olog can serve as a data repository if desired. Unlike database schemas, which are generally difficult to create or modify, ologs are designed to be user-friendly enough that authoring or reconfiguring an olog is a matter of course rather than a difficult chore.
≠≠≠≠≠≠≠
So far, it's been the best paper/book/video that let me wrap my mind around major CT concepts. I particularly like their graphical separation between "data" and "type" levels (2.2.3). It's a good way to represent convergent paths at different levels of abstraction.
Abstract
In this paper we introduce the olog, or ontology log, a category-theoretic model for knowledge representation (KR). Grounded in formal mathematics, ologs can be rigorously formulated and cross-compared in ways that other KR models (such as semantic networks) cannot. An olog is similar to a relational database schema; in fact an olog can serve as a data repository if desired. Unlike database schemas, which are generally difficult to create or modify, ologs are designed to be user-friendly enough that authoring or reconfiguring an olog is a matter of course rather than a difficult chore.
≠≠≠≠≠≠≠
So far, it's been the best paper/book/video that let me wrap my mind around major CT concepts. I particularly like their graphical separation between "data" and "type" levels (2.2.3). It's a good way to represent convergent paths at different levels of abstraction.
