Results 1  10
of
12
IFMap: An OntologyMapping Method Based on InformationFlow Theory
, 2003
"... In order to tackle the need of sharing knowledge within and across organisational boundaries, the last decade has seen researchers both in academia and industry advocating for the use of ontologies as a means for providing a shared understanding of common domains. But with the generalised use of ..."
Abstract

Cited by 34 (12 self)
 Add to MetaCart
In order to tackle the need of sharing knowledge within and across organisational boundaries, the last decade has seen researchers both in academia and industry advocating for the use of ontologies as a means for providing a shared understanding of common domains. But with the generalised use of large distributed environments such as the World Wide Web came the proliferation of many di#erent ontologies, even for the same or similar domain, hence setting forth a new need of sharingthat of sharing ontologies. In addition, if visions such as the Semantic Web are ever going to become a reality, it will be necessary to provide as much automated support as possible to the task of mapping di#erent ontologies. Although many e#orts in ontology mapping have already been carried out, we have noticed that few of them are based on strong theoretical grounds and on principled methodologies. Furthermore, many of them are based only on syntactical criteria. In this paper we present a theory and method for automated ontology mapping based on channel theory, a mathematical theory of semantic information flow.
InformationFlowbased Ontology Mapping
 In Proceedings of the 1st International Conference on Ontologies, Databases and Application of Semantics
, 2002
"... As ontologies become ever more important for semanticallyrich information exchange and a crucial element for supporting knowledge sharing in a large distributed environment, like the Web, the demand for sharing them increases accordingly. One way of achieving this ambitious goal is to provide mechan ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
(Show Context)
As ontologies become ever more important for semanticallyrich information exchange and a crucial element for supporting knowledge sharing in a large distributed environment, like the Web, the demand for sharing them increases accordingly. One way of achieving this ambitious goal is to provide mechanised ways for mapping and merging ontologies. This has been the focus of recent research in knowledge engineering.
Formal support for representing and automating semantic interoperability
 In The Semantic Web: Research and Applications. ESWS 2004. Proceedings, LNCS 3053
, 2004
"... Abstract. Semantic interoperability has become a key issue for realizing the Semantic Web in its full potential. However, there is a lot of controversy regarding the meaning and scope of the term and scarce formal approaches to the problem of semantic heterogeneity. In this paper, we discuss these a ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Semantic interoperability has become a key issue for realizing the Semantic Web in its full potential. However, there is a lot of controversy regarding the meaning and scope of the term and scarce formal approaches to the problem of semantic heterogeneity. In this paper, we discuss these approaches and propose a formalisation of semantic interoperability based on the BarwiseSeligman theory of information flow. We argue for a theoretical framework that favours the analysis and implementation of semantic interoperability scenarios. We present an example case of such a scenario where our framework has been applied as well as variations of it in the domain of ontology mapping. 1
Duality in knowledge sharing
 IN 7TH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL INTELLIGENCE AND MATHEMATICS, FT
, 2002
"... I propose a formalisation of knowledge sharing scenarios that aims at capturing the crucial role played by an existing duality between ontological theories one wants to merge and particular situations that need to be linked. I use diagrams in the Chu category and colimits over these diagrams to acco ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
I propose a formalisation of knowledge sharing scenarios that aims at capturing the crucial role played by an existing duality between ontological theories one wants to merge and particular situations that need to be linked. I use diagrams in the Chu category and colimits over these diagrams to account for the reliability and optimality of knowledge sharing systems. Furthermore, I show how we may obtain a deeper understanding of a system that shares knowledge between a probabilistic logic program and Bayesian belief networks by reanalysing the scenario in terms of the present approach.
Modified realizability interpretation of classical linear logic
 In Proceedings of Logic in Computer Science (LiCS
, 2007
"... This paper presents a modified realizability interpretation of classical linear logic. The interpretation is based on work of de Paiva (1989), Blass (1995), and Shirahata (2006) on categorical models of classical linear logic using Gödel’s Dialectica interpretation. Whereas the Dialectica categories ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
This paper presents a modified realizability interpretation of classical linear logic. The interpretation is based on work of de Paiva (1989), Blass (1995), and Shirahata (2006) on categorical models of classical linear logic using Gödel’s Dialectica interpretation. Whereas the Dialectica categories provide models of linear logic, our interpretation is presented as an endointerpretation of proofs, which does not leave the realm of classical linear logic. The advantage is that we obtain stronger versions of the disjunction and existence properties, and new conservation results for certain choice principles. Of particular interest is the simple branching quantifier used in order to obtain a completeness result for the modified realizability interpretation. 1
Beyond the Chuconstruction
, 1999
"... . Starting from symmetric monoidal closed (= autonomous) categories, PoHsiang Chu showed how to construct new  autonomous categories, i.e., autonomous categories that are selfdual by virtue of having a dualizing object. Recently, Michael Barr extended this to the nonsymmetric, but closed, case, ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
. Starting from symmetric monoidal closed (= autonomous) categories, PoHsiang Chu showed how to construct new  autonomous categories, i.e., autonomous categories that are selfdual by virtue of having a dualizing object. Recently, Michael Barr extended this to the nonsymmetric, but closed, case, utilizing monads and modules between them. Since these notions are wellunderstood for bicategories, we introduce a notion of cyclic  autonomy for these that implies closedness and, moreover, is inherited when forming bicategories of monads and of interpolads. Since the initial step of Barr's construction also carries over to the bicategorical setting, we recover his main result as an easy corollary. Furthermore, the Chuconstruction at this level may be viewed as a procedure for turning the endo1 cells of a closed bicategory into the objects of a new closed bicategory, and hence conceptually is similar to constructing bicategories of monads and of interpolads. Keywords: closed bicate...
Dialectica and Chu Constructions: Cousins?
 In this Volume
, 2006
"... This note investigates two generic constructions used to produce categorical models of linear logic, the Chu construction and the Dialectica construction, in parallel. The constructions have the same objects, but are rather di#erent in other ways. We discuss similarities and di#erences and prove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This note investigates two generic constructions used to produce categorical models of linear logic, the Chu construction and the Dialectica construction, in parallel. The constructions have the same objects, but are rather di#erent in other ways. We discuss similarities and di#erences and prove that the dialectica construction can be done over a symmetric monoidal closed basis. We also point out several interesting open problems concerning the Dialectica construction.
algebra and applications
, 2009
"... The Yoneda Lemma is ordinarily understood as a fundamental representation theorem of category theory. As such it can be stated as follows in terms of an object c of a locally small category C, meaning one having a homfunctor C(−, −) : Cop × C → Set (i.e. small homsets), and a functor F: C → Set or ..."
Abstract
 Add to MetaCart
(Show Context)
The Yoneda Lemma is ordinarily understood as a fundamental representation theorem of category theory. As such it can be stated as follows in terms of an object c of a locally small category C, meaning one having a homfunctor C(−, −) : Cop × C → Set (i.e. small homsets), and a functor F: C → Set or
IOS Press Communes via Yoneda, from an Elementary Perspective
"... Abstract. We present the Yoneda Lemma in terms of categories without explicit reference to the notion of functor. From this perspective we then define a commune as a common generalization of Chu spaces and presheaves, and give some applications. Keywords: commune, yoneda, chu space ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We present the Yoneda Lemma in terms of categories without explicit reference to the notion of functor. From this perspective we then define a commune as a common generalization of Chu spaces and presheaves, and give some applications. Keywords: commune, yoneda, chu space