[To: petrie: [Bernd Bachmann: semantic unification for conceptual graphs]]

Charles Petrie <petrie@informatik.uni-kl.de>
Date: Mon, 17 May 1993 11:54:47 -0700
Message-id: <9305172032.aa01380@inti.informatik.uni-kl.de>
Comment: List name: SRKB-LIST (do not use email address as name)
Originator: srkb-list@isi.edu
Errors-To: neches@ISI.EDU
Reply-To: <petrie@informatik.uni-kl.de>
Sender: srkb-list@ISI.EDU
Version: 5.5 -- Copyright (c) 1991/92, Anastasios Kotsikonas
From: Charles Petrie <petrie@informatik.uni-kl.de>
To: Multiple recipients of list <srkb-list@ISI.EDU>
Subject:  [To: petrie:  [Bernd Bachmann: semantic unification for conceptual graphs]]
The problem unifying the semantics of heterogenous systems
is fundamental, important, and extremely hard.  I have 
wondered from time to time if one use of an intermediate
language such as KIF is for semantic unification. If people
made a few connections between terms and relations in two
systems both expressed in KIF, perhaps some theorem proving
could suggest further possibilities for connections between
the two systems.
 Bernd Bachmann at the DFKI suggests that this has been
done for conceptual graphs, but as yet, I have only this
abstract. I enclose the citation in case anyone wants to
follow up, or knows more abut it.
Subject: semantic unification for conceptual graphs
Organization: German Research Center for AI (DFKI)
Date: Mon, 17 May 1993 16:49:23 +0200
From: Bernd Bachmann <bachmann@dfki.uni-kl.de>
Message-ID:  <9305171449.aa10650@serv-300.dfki.uni-kl.de>

the citation for the paper on semantic unification for conceptual graphs is:

        AUTHOR             = {G.W. Mineau},
        JOURNAL            = {J. Expt. Theor. Artif. Intell.},
        PAGES              = {127--139},
        TITLE              = {Towards Compatible Primitive Structures},
        VOLUME             = {4},
        YEAR               = {1992},
        DATE               = {22/03/93},
        LOCATION           = {Conceptual Graphs},

abstract = "This paper addresses the problem of knowledge interchange
between two knowledge-based systems whose knowledge is represented using
the conceptual graph formalism of Sowa (1984). For this work it is
assumed that there are protocols allowing these systems to communicate,
consequently a channel between the systems can be esthablished and graphs
can be exchanged. This paper concentrates on the translation of graphs
>From one system's semantics to the other's. Without this translation, 
the exchanged graphs would remain useless. The method this paper proposes 
aims at relating different syntactical structures by detecting 
their co-occurence in semantically similar contexts. 
Because we need to identify such contexts, the method requires 
the intervention of knowledge engineers of both systems."}

- Bernd

Bernd Bachmann, DFKI, Postfach 2080, D-W-6750 Kaiserslautern, Germany
Tel: +49 631 205-3482; Fax: +49 631 205-3210; email: bachmann@dfki.uni-kl.de

----- End of forwarded messages