Ologs: A Categorical Framework for Knowledge Representation
Robert Kent2012, PLoS ONE
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
In this paper we introduce the olog, or ontology log, a categorytheoretic 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. It is hoped that learning to author ologs is much simpler than learning a database definition language, despite their similarity. We describe ologs carefully and illustrate with many examples. As an application we show that any primitive recursive function can be described by an olog. We also show that ologs can be aligned or connected together into a larger network using functors. The various methods of information flow and institutions can then be used to integrate local and global world-views. We finish by providing several different avenues for future research. Contents 40 7. Further directions 48 References 50 Mathematics, MIT,
Related papers
Toward formalizing ologs: Linguistic structures, instantiations, and mappings
2015
We define the notion of linguistic structure on a small category, in order to provide a more formal description of ontology logs, also known as ologs, introduced in [20] by R. E. Kent and the second author. In particular, we construct a bicategory Eng, of English noun phrases and verb phrases, endorsed as functional by varying sets of authors. An olog is then defined as a lax functor to Eng. We then present a new notion of linguistic functor, which extends the notion of meaningful functors defined in [16]. Finally, we discuss the relationship between ologs and databases in this context.
Global S chema G eneration U sing Formal Ontologies
This paper deals with the problem of handling semantic heterogeneity during schema integration. Semantics refer to the meaning of data in contrast to syntax, which solely defines the structure of schema elements. We focus on the part of semantics related to the meanings of terms used to name schema elements. Our approach does not rely on the names of the schema elements or the structure of the schema. Instead, we present an approach based on formal ontologies presented in a logical language for integrating schemas to produce global schemas. Semantic similarity relations between definitions in formal ontologies are defined and used for merging formal ontologies. We show how similarity relations are discovered by a reasoning system using a higher level ontology. The result of the merging process is used for schema integration. The result of schema integration can be used as a global schema in a tightly coupled federated database. Afterwards, we illustrate how the produced global schema can help for the mapping of data elements.
Formalising ontologies and their relations
1999
Ontologies allow the abstract conceptualisation of domains, but a given domain can be conceptualised through many different ontologies, which can be problematic when ontologies are used to support knowledge sharing. We present a formal account of ontologies that is intended to support knowledge sharing through precise characterisations of relationships such as compatibility and refinement. We take an algebraic approach, in which ontologies are presented as logical theories.
Towards arrow-theoretic semantics of ontologies: conceptories
Arxiv preprint arXiv:1008.1309, 2010
In context of efforts of composing category-theoretic and logical methods in the area of knowledge representation we propose the notion of conceptory. We consider intersection/union and other constructions in conceptories as expressive alternative to category-theoretic (co)limits and show they have features similar to (pro-, in-)jections. Then we briefly discuss approaches to development of formal systems built on the base of conceptories and describe possible application of such system to the specific ontology.
Representing ontologies using description logics, description graphs, and rules☆
Artificial Intelligence, 2009
Description logics (DLs) are a family of state-of-the-art knowledge representation languages, and their expressive power has been carefully crafted to provide useful knowledge modeling primitives while allowing for practically effective decision procedures for the basic reasoning problems. Recent experience with DLs, however, has shown that their expressivity is often insufficient to accurately describe structured objects-objects whose parts are interconnected in arbitrary, rather than tree-like ways. DL knowledge bases describing structured objects are therefore usually underconstrained, which precludes the entailment of certain consequences and causes performance problems during reasoning. To address this problem, we propose an extension of DL languages with description graphs-a knowledge modeling construct that can accurately describe objects with parts connected in arbitrary ways. Furthermore, to enable modeling the conditional aspects of structured objects, we also extend DLs with rules. We present an in-depth study of the computational properties of such a formalism. In particular, we first identify the sources of undecidability of the general, unrestricted formalism. Based on that analysis, we then investigate several restrictions of the general formalism that make reasoning decidable. We present practical evidence that such a logic can be used to model nontrivial structured objects. Finally, we present a practical decision procedure for our formalism, as well as tight complexity bounds.
Towards the formalization of knowledge representation
WSEAS Transactions on …
In this paper it is presented a formal methodology based on topology theory to represent knowledge. This framework is used to describe the creation of a semantic network, which is then represented by means of First-Order Logic. By a series of functions applied to a natural basis, issued from the application domain, a family of sets are synthesized with their sub-spaces correlated. Therefore the resultant sub-spaces and their relations form a network of elementary and complex concepts. Complete correspondence among the sub-spaces, the IDEF1x model of the semantic network and the First-Order Logic is obtained by employing this framework. The process planning application domain is used to illustrate the creation of the resultant knowledge base.
Towards MORK: Model for Representing Knowledge
International Journal of Modern Education and Computer Science, 2016
Smart world needs intelligent system for effective and timely decision making. This is achieved only through a knowledge based system with functional knowledge representation units. In this paper, two models are proposed for representing knowledge. This process involves in getting the data and placing the information in the correct location. Logical notations are used for taking the clauses and graph is used for putting the entities. In Model one, the data is translated into logical statements using predicate logics, later the knowledge is stored in conceptual graph and retrieved. Whereas in Model two, the given information is translated using First Order Logic (FOL), by applying description logic concept rules are defined and as a result reasoning is done. Storage is done by using concept-relation graph. The main aims of our models are to have easy and simple access over the information. These models return the required exact answer, for the higher order query posted by the end user to the intelligent system.
Ontodlp: a logic formalism for knowledge representation
2008
This paper provides an introduction to knowledge representation using OntoDLP, a formalism which combines the full computational power of Disjunctive Logic Programming (DLP) with suitable abstraction mechanisms for the representation of complex objects and default reasoning. The paper does not provide a formal definition of the language, rather it is intended as an informal presentation of its main features.
Door: Towards a formalization of ontology relations
2009
In this paper, we describe our ongoing effort in describing and formalizing semantic relations that link ontolo-gies with each others on the Semantic Web in order to create an ontology, DOOR, to represent, manipulate and reason upon these relations. DOOR is a Descriptive Ontology of Ontology Relations which intends to define relations such as inclusion, versioning, similarity and agreement using ontological primitives as well as rules.
The design and implementation of DLOG, a Prolog-based knowledge representation system
New Generation Computing, 1985
We describe the design and implementation of a Prologbased representation system called DLOG. The DLOG representation language extends the definite clause language of Prolog with several features, including sets, descriptions, unary lambda abstracts, and simple integrity constraints.
Related papers
OO-logic: a Successor of F-logic
2019
Object oriented logic (abbreviated: OO-logic) combines the advantages of conceptual modelling that comes from object-oriented framebased languages with the declarative style, compact and simple syntax, and the well defined semantics of a logic-based language. OO-logic supports typing, meta-reasoning, complex objects, properties, classes, inheritance, rules, queries, modularization, and scoped inference. In this paper we describe the capabilities of knowledge representation systems based on OO-logic and illustrate the use of this logic for ontology specification. OO-logic is a successor of F-logic. It incorporates the experience of a decade of using F-logic in real life applications. OO-logic simplifies the syntax of F-logic and has its focus on rule based reasoning with large sets of data (billions of triples).
Toward a Category Theory Design of Ontological Knowledge Bases
I discuss (ontologies_and_ontological_knowledge_bases / formal_methods_and_theories) duality and its category theory extensions as a step toward a solution to Knowledge-Based Systems Theory. In particular I focus on the example of the design of elements of ontologies and ontological knowledge bases of next three electronic courses: Foundations of Research Activities, Virtual Modeling of Complex Systems and Introduction to String Theory. Comment: 10 pages, Preliminary results to International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K 2009)
Ontology representation & reasoning
Universit di Roma La Sapienza, Roma, Italy, Tech. Rep. NoE InterOp (IST-508011), 2004
It is widely accepted to consider an ontology as a conceptualization of a domain of interest, that can be used in several ways to model, analyze and reason upon the domain. Obviously, any conceptualization of a certain domain has to be represented in terms of a well-defined language, and, once such a representation is available, there ought to be well-founded methods for reasoning upon it, ie, for analyzing the representation, and drawing interesting conclusions about it. This paper surveys both the languages proposed for representing ...
Axioms are objects, too: Ontology engineering beyond the modeling of concepts and relations
2000
This papers presents a new approach for modeling large-scale ontologies. We extend well-established methods for modeling concepts and relations by transportable methods for modeling ontological axioms. The gist of our approach lies in the way we treat the majority of axioms. They are categorized into different types and specified as complex objects that refer to concepts and relations. Considering language and system particularities, this first layer of representation is then translated into the target representation language. This two-layer approach benefits engineering, because the intended meaning of axioms is captured by the categorization of axioms. Classified object representations allow for versatile access to and manipulations of axioms via graphical user interfaces.
Mathematical knowledge representation: semantic models and formalisms
Lobachevskii Journal of Mathematics, 2014
The paper provides a survey of semantic methods for solution of fundamental tasks in mathematical knowledge management. Ontological models and formalisms are discussed. We propose an ontology of mathematical knowledge, covering a wide range of fields of mathematics. We demonstrate applications of this representation in mathematical formula search, and learning.
Ontology in Knowledge Representation
The categorization of entities into classes such as object, plant, animal, or human reflects ontological structure. Ontological structure can be represented by inheritance trees which are orthogonal to more conventional "isa" inheritance trees. Given ontological structure we can define paradigmatic transitions, such as that from caterpillar to butterfly, and ontological transitions, such as that from living to dead. These concepts are exemplified with examples from everyday knowledge and from the world of computer integrated manufacturing. A final section discusses the implications of ontological representation for representation of scientific concepts.
A KIF Formalization for the IFF Category Theory Ontology
2011
This paper begins the discussion of how the Information Flow Framework can be used to provide a principled foundation for the metalevel (or structural level) of the Standard Upper Ontology (SUO). This SUO structural level can be used as a logical framework for manipulating collections of ontologies in the object level of the SUO or other middle level or domain ontologies. From the Information Flow perspective, the SUO structural level resolves into several metalevel ontologies. This paper discusses a KIF formalization for one of those metalevel categories, the Category Theory Ontology. In particular, it discusses its category and colimit sub-namespaces.
The Categorical Product Data Model as a Formalism for Object--Relational Databases
1994
Category theory has been developed over the last 50 years as a multi-level mathematical workspace capable of modelling real-world objects. Categories of objects are manipulated in geometric logic by a single concept represented by the arrow.
Guiding the representation of n-ary relations in ontologies through aggregation, generalisation and participation
Web Semantics: Science, Services and Agents on the World Wide Web, 2011
We put forward a methodological approach aimed at guiding ontologists in choosing which relations to reify. Our proposal is based on the notions of aggregation, generalization and participation as used in conceptual modelling approaches for database design in order to represent situations that, normally, would require non-binary relations or complex integrity constraints. In order to justify our approach, we provide mathematical definitions of the constructs that we propose and use them to analyse the extent to which they can be implemented in languages such as OWL. A number of results are also proved that attest to the soundness of the methodological guidelines that we propose. The feedback received from using the method in a real-word situation is that it offers a more controlled use of reification and a closer fit between the resulting ontology and the application domain as perceived by an expert. 2 The term reification can have several meanings and uses in Logic in general, and the Semantic Web in particular. In this paper, we use it as a synonym for encoding n-ary relations as classes. We do not use it to refer to the usage of RDF as a metalanguage to describe other logics, or in situations in which a statement can be assigned a URI and treated as a resource, or the use of classes as individuals.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.