%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Michel Wermelinger",
%%% version = "1.01",
%%% date = "25 November 2011",
%%% time = "16:14:37 MDT",
%%% filename = "wermelinger-michel.bib",
%%% address = "Universidade Nova de Lisboa
%%% Departamento de Informatica
%%% 2825 Monte da Caparica
%%% Portugal",
%%% telephone = "?n/a?",
%%% FAX = "?n/a?",
%%% URL = "http://www-ctp.di.fct.unl.pt/~mw",
%%% checksum = "26154 926 5202 50391",
%%% email = "mw at di.fct.unl.pt (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "conceptual structures, software",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a bibliography of publications of
%%% Michel Wermelinger. The companion LaTeX file
%%% wermelinger-michel.ltx can be used to typeset
%%% this bibliography.
%%%
%%% At version 1.01, the year coverage looked
%%% like this:
%%%
%%% 1990 ( 1) 1993 ( 4) 1996 ( 1)
%%% 1991 ( 5) 1994 ( 1) 1997 ( 3)
%%% 1992 ( 4) 1995 ( 3) 1998 ( 6)
%%%
%%% InProceedings: 14
%%% MastersThesis: 1
%%% Misc: 2
%%% TechReport: 8
%%% Unpublished: 3
%%%
%%% Total entries: 28
%%%
%%% This file is available as part of the BibNet
%%% Project. The master copy is available for
%%% public access on ftp.math.utah.edu in the
%%% directory tree /pub/bibnet/authors. It is
%%% mirrored to netlib.bell-labs.com in the directory
%%% tree /netlib/bibnet/authors, from which it is
%%% available via anonymous ftp and the Netlib
%%% service.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
%%----------------------------------------------------------------------
%% Publisher abbreviations
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
@String{pub-IEEE = "IEEE"}
@String{pub-IEEE:adr = "1109 Spring Street, Suite 300, Silver
Spring, MD 20910, USA"}
@String{pub-SPRINGER = "Springer-Verlag"}
@String{pub-SPRINGER:adr = "Berlin, Heidelberg, New York, Tokyo"}
@String{pub-SV = "Springer-Verlag"}
@String{pub-SV:adr = "Berlin, Germany~/ Heidelberg, Germany~/
London, UK~/ etc."}
%%----------------------------------------------------------------------
%% Bibliography entries:
@TechReport{Wermelinger:1990:AAI,
author = "Michel Wermelinger",
title = "{AIPO: Ambiente de Introdu\c{c}\~ao \`a
Programa\c{c}\~ao}",
number = "RT-36/90-DI",
institution = "Departamento de Inform{\'a}tica, Universidade Nova de
Lisboa",
month = may,
year = "1990",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "Manual de refer{\^e}ncia da vers{\~a}o 1.41",
abstract = "O AIPO \'e um mini-ambiente integrado de
programa\c{c}\~ao em Pascal especialmente concebido
para cadeiras do g\'enero Introdu\c{c}\~ao aos
Computadores e Programa\c{c}\~ao. Consiste de um
editor, um compilador e um interpretador. O primeiro
\'e basicamente uma vers\~ao bastante simplificada do
PEPP [Wermelinger 87], que por sua vez se inspirou no
MET [Guerreiro 88b]. O compilador e o interpretador
foram tirados de [Rees 88] e alterados de acordo com as
necessidades.",
}
@InProceedings{Wermelinger:1991:FPA,
author = "Michel Wermelinger and Jos{\'e} Gabriel Lopes",
booktitle = "Anais do VIII Simp{\'o}sio Brasileiro de
Intelig{\^e}ncia Artificial",
title = "Uma Ferramenta para Aquisi{\c{c}}{\~a}o e
Representa{\c{c}}{\~a}o de Conhecimento baseada em
Grafos Conceptuais",
publisher = "Sociedade Brasileira de Computa{\c{c}}{\~a}o",
pages = "287--294",
year = "1991",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1991/sbia91.ps.gz",
abstract = "Este artigo descreve o sistema GET (Graph Editor and
Tools), uma ferramenta baseada nas estruturas
conceptuais de John Sowa. O GET pode ser usado para
aquisi\c{c}\~ao e representa\c{c}\~ao gen\'erica do
conhecimento. Apresentam-se duas aplica\c{c}\~oes. Uma
\'e um interpretador sem\^antico de frases em
Portugu\^es que tamb\'em tem algumas capacidades
dedutivas. A outra \'e uma capacidade intr\'\i{}nseca
do sistema e permite a aquisi\c{c}\~ao de
informa\c{c}\~ao sem\^antica para um dicion\'ario
utilizado pelo interpretador. O GET tamb\'em permite a
representa\c{c}\~ao gr\'afica de rela\c{c}\~oes
conceptuais ao incorporar um editor que funciona com o
X-Windows.",
}
@TechReport{Wermelinger:1991:GGE,
author = "Michel Wermelinger",
title = "{GET: Graph Editor and T}ools---The Incomplete
Reference",
number = "RT-3/91-CIUNL",
institution = "Centro de Inform{\'a}tica da Universidade Nova de
Lisboa",
month = jan,
year = "1991",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1991/get-ref.ps.gz",
abstract = "Conceptual structures are an ambitious attempt to
represent knowledge in a natural and expressive way.
The formalism was first presented in [Sowa84] but has
its roots in Peirce's existential graphs. GET is
primarily the graduating project of the author but it is
also intended to be used as an experimenting tool for
semantic representation of Portuguese sentences. In its
actual state, GET is a collection of Prolog predicates
that implement several of the operations on conceptual
graphs and an editor for X-Windows. The former is
collectively called CGT (Conceptual Graph Tools) and
the latter is known as CGE (Conceptual Graph Editor).
GET is supposed to evolve into something more
substantial if so permit time and funds. It also
depends on the choices made within the CROP project
(Robust Understanding of Portuguese, JNICT contract no.
PMCT/P/TIT/167/90). For instance, it is possible to
envisage a Conceptual Processor (see [Sowa84, section
4.7]) as part of a Dialog Manager. This manual is
intended for the users of GET. Part I describes the
editor and Part II a semantic interpreter for
Portuguese sentences that shows what conceptual graphs
might be used for. Even if you are just interested in
the interpreter and couldn't care less for the editor,
you should start by reading the sections on Quintus
X-Prolog and linear notation.",
}
@TechReport{Wermelinger:1991:GIC,
author = "Michel Wermelinger",
title = "{GET}: An Implementation of Conceptual Graphs",
number = "RT-5/91-CIUNL",
institution = "Centro de Inform{\'a}tica da Universidade Nova de
Lisboa",
month = jan,
year = "1991",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1991/get.ps.gz",
abstract = "This paper describes GET (Graph Editor and Tools), a
partial implementation of Sowa's conceptual structures.
First, a brief overview of X-Prolog, an X-Windows based
Prolog programming environment, is given. A summary of
GET's graphical interface and linear notation follows.
Finally, an example application using the graphs to
represent sentences in Portuguese will be presented.",
}
@TechReport{Wermelinger:1991:GSN,
author = "Michel Wermelinger",
title = "{GET}---Some Notes on the Implementation",
number = "RT-4/91-CIUNL",
institution = "Centro de Inform{\'a}tica da Universidade Nova de
Lisboa",
month = jan,
year = "1991",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1991/get-impl.ps.gz",
abstract = "These notes provide a brief overview of the
implementation of GET, the Graph Editor and Tools for
the conceptual structures defined in [Sowa84]. The used
data structures will be emphasized, while the
interested reader should consult the Prolog source code
for a description of the predicates.",
}
@TechReport{Wermelinger:1991:MAC,
author = "Michel Wermelinger and Jos{\'e} Gabriel Lopes",
title = "Modeliza{\c{c}}{\~a}o Conceptual de uma Base de
Dados",
type = "Technical Note",
number = "10/91-CIUNL",
institution = "Centro de Inform{\'a}tica da Universidade Nova de
Lisboa",
month = dec,
year = "1991",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1991/bd.ps.gz",
abstract = "O projecto CROP (Compreens\~ao Robusta do Portugu\^es)
pretende construir um sistema com um elevado grau de
interac\c{c}\~ao entre o utilizador e qualquer Sistema
de Informa\c{c}\~ao existente, usando uma interface
multimedia com capacidade para interactuar numa
linguagem natural. Um dos componentes fundamentais do
sistema \'e o modelo conceptual do Sistema de
Informa\c{c}\~ao a suportar (que de momento assumimos
ser uma base de dados relacional devido {\`a} sua
ubiquidade). S\~ao tr\^es as tarefas principais que
ir\~ao ser desempenhadas pelo modelo conceptual
atrav\'es do conhecimento nele contido: ajudar o
processador de linguagem natural a resolver
ambiguidades; detec\c{c}\~ao de inconsist\^encias
sem\^anticas e pragm\'aticas; fazer infer\^encias a
partir dos dados conhecidos; fazer a liga\c{c}\~ao
f\'\i{}sica {\`a} base de dados. Este artigo \'e um
primeiro passo para atingir o objectivo proposto.
Iremos analisar algumas vantagens e desvantagens de
duas abordagens poss\'\i{}veis: a l\'ogica de primeira
ordem e as estruturas conceptuais. Al\'em das
caracter\'\i{}sticas acima mencionadas teremos tamb\'em
em conta a manuten\c{c}\~ao do modelo conceptual face a
altera\c{c}\~oes na base de dados. Cada uma das duas
sec\c{c}\~oes seguintes \'e dedicada a um dos
formalismos. O relat\'orio termina com um resumo e
compara\c{c}\~ao das observa\c{c}\~oes feitas.",
}
@InProceedings{Choi:1992:LLN,
author = "Young Bae Choi and Maurice Pagnucco and Heather
Pfeiffer and Michel Wermelinger",
editor = "Gerard Ellis and Robert A. Levinson",
booktitle = "Proceedings of the First International Workshop on
{PEIRCE}: A Conceptual Graphs Workbench",
title = "{LINEAR}: Linear Notation Interface",
publisher = "Key Centre for Software Technology, Dept. of
Computer Science, University of Queensland",
address = "St. Lucia, Queensland., Australia",
pages = "25--28",
day = "10",
month = jul,
note = "Available as University of Queensland Technical Report
241",
year = "1992",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1992/peirce92-l.ps.gz",
abstract = "The linear form of a Conceptual Graph is an important
form of input and output for many Conceptual Graph
tools. It also serves as an important notation for
presenting Conceptual Graphs to others. It is therefore
an integral part of the PEIRCE project. In this paper
we shall introduce the PEIRCE linear notation interface
subgroup (LINEAR) which is devoted to the development
of the linear form notation and related tools. We shall
outline its aims and current members, along with other
issues relevant to the subgoup.",
xxaddress = "Las Cruces, New Mexico, USA",
}
@InProceedings{Eklund:1992:GGI,
author = "Peter Eklund and Michel Wermelinger and Keith Campbell
and Harry Delugach and Robert Muehlbacher and Heather
Pfeiffer",
editor = "Gerard Ellis and Robert A. Levinson",
booktitle = "Proceedings of the First International Workshop on
{PEIRCE}: A Conceptual Graphs Workbench",
title = "{GRIP}: Graphical Interface",
publisher = "Key Centre for Software Technology, Dept. of
Computer Science, University of Queensland",
address = "St. Lucia, Queensland., Australia",
pages = "29--31",
day = "10",
month = jul,
note = "Available as University of Queensland Technical Report
241",
year = "1992",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1992/peirce92-g.ps.gz",
abstract = "A major advantage of conceptual graphs is their ease
of use particularly in the graphical form. The goals of
the graphical interface subgroup is the creation of a
document providing general guidelines for the
implementation of such an interface and the creation of
one (or more) implementations conforming to those
guidelines. Furthermore, members of the group plan to
make available a suite of portable universal interfaces
for the representation and acquisition of conceptual
graphs.",
xxaddress = "Las Cruces, New Mexico, USA",
}
@TechReport{Wermelinger:1992:FAA,
author = "Michel Wermelinger and Lu{\'\i{}}s Seabra Lopes and
Jo{\~a}o C. Carrapi{\c{c}}o",
title = "Folhas de Apoio ao Estudo Pr{\'a}tico de {Fundamentos}
de {Programa{\c{c}}{\~a}o}",
type = "Technical Note",
number = "NT-3/92-DI",
institution = "Departamento de Inform{\'a}tica, Universidade Nova de
Lisboa",
month = jun,
year = "1992",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1992/fp.ps.gz",
abstract = "Estas folhas baseiam-se numas outras, escritas h\'a
tr\^es anos pelos primeiros dois autores para a cadeira
de Introdu\c{c}\~ao aos Computadores e {\`a}
Programa\c{c}\~ao. Embora a mat\'eria seja
sensivelmente a mesma, os problemas dados nas
pr\'aticas sofreram algumas altera\c{c}\~oes e
aproveit\'amos a ocasi\~ao para melhorar outros
aspectos. A primeira parte destas notas, dedicada a um
resumo do Pascal, foi substancialmente aumentada. As
segunda e terceira partes, exerc\'\i{}cios te\'oricos e
de escolha m\'ultipla com algum grau de dificuldade,
mantiveram-se tal e qual. A quarta parte cont\'em os
enunciados e solu\c{c}\~oes de quase todos os problemas
dados nas aulas pr\'aticas, exceptuando-se os mais
triviais. Cada resolu\c{c}\~ao \'e acompanhada de
perguntas para o aluno poder aprofundar a compreens\~ao
do programa. Finalmente, na quinta e \'ultima parte
d\~ao-se mais alguns enunciados (sem resolu\c{c}\~ao!)
para o aluno praticar.",
}
@Misc{Wermelinger:1992:REU,
author = "Michel Wermelinger",
title = "A Reconstruction of {\em EXPRESS} using Conceptual
Structures",
howpublished = "Term paper for the ``{Information Systems for CIM}''
course",
month = dec,
year = "1992",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "MSc in Computer Engineering",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1992/cim.ps.gz",
abstract = "This paper provides a first step in reconstructing
EXPRESS using Conceptual Structures (CS). The idea is
to be able to translate EXPRESS schemata in a
straightforward manner to knowledge packets, a new
notion added to CS theory. Representing the semantics
of EXPRESS in another knowledge representation
formalism has several advantages, mainly due to the
fact that it provides a unifying framework for model
analysis.",
}
@InProceedings{Esch:1993:LLN,
author = "John Esch and Maurice Pagnucco and Michel
Wermelinger",
editor = "Robert Levinson and Gerard Ellis",
booktitle = "Proceedings of the Second International Workshop on
{PEIRCE}: A Conceptual Graphs Workbench",
title = "{LINEAR}---Linear Notation Interface",
publisher = "Laval University",
address = "Qu{\'e}bec City, Canada",
pages = "16--24",
day = "7",
month = aug,
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1993/peirce93.ps.gz",
year = "1993",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
abstract = "The purpose of the LINEAR subgroup is to coordinate
the development of a standard linear form grammar for
Conceptual Graphs and to develop related tools. The
main aim of this paper is to present a linear form
grammar for conceptual graphs which we hope will form
the basis for future standardization efforts. We also
suggest some possible extensions to this grammar and
contrast it with the grammar used by PEIRCE. In the
following section we present a linear form grammar
based on the work of Esch [Esch92] while section 3
discusses some suggested extensions to the linear form
grammar. Section 4 presents the linear form grammar
adopted by the current version of PEIRCE (version 0.1)
and discusses some of the more significant differences
between this grammar and that of section 2. In appendix
A we include Sowa's comments on possible future
directions with a discussion on integrating the CG
linear form grammar with that of KIF, the Knowledge
Interchange Format developed by the Interlingua
Committee of the DARPA-sponsored Knowledge Sharing
Effort.",
}
@InProceedings{Wermelinger:1993:XWT,
author = "Michel Wermelinger and Jos{\'e} Gabriel Lopes",
booktitle = "Conceptual Structures: Theory and Implementation",
title = "An {X-Windows} Toolkit for Knowledge Acquisition and
Representation based on {Conceptual Structures}",
volume = "754",
publisher = pub-SV,
address = pub-SV:adr,
pages = "262--271",
year = "1993",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "Proceedings of the Seventh Annual Workshop on
Conceptual Graphs",
series = "Lecture Notes in Artificial Intelligence",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1993/awocg93.ps.gz",
abstract = "This paper describes GET (Graph Editor and Tools), a
tool based on Sowa's conceptual structures, which can
be used for generic knowledge acquisition and
representation. The system enabled the acquisition of
semantic information (restrictions) for a lexicon used
by a semantic interpreter for Portuguese sentences
featuring some deduction capabilities. GET also enables
the graphical representation of conceptual relations by
incorporating an X-Windows based editor.",
}
@InProceedings{Wermelinger:1993:CSM,
author = "Michel Wermelinger and Alex Bejan",
booktitle = "Conceptual Graphs for Knowledge Representation",
title = "Conceptual Structures for Modeling in {CIM}",
volume = "699",
publisher = pub-SPRINGER,
address = pub-SPRINGER:adr,
pages = "345--360",
year = "1993",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "Proceedings of the First International Conference on
Conceptual Structures",
series = "Lecture Notes in Artificial Intelligence",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1993/iccs93.ps.gz",
abstract = "The International Standards Organization (ISO) will
release in 1993 the first version of the STEP standard,
which is dedicated to the exchange of product model
data, and is seen as the basis of the next generation
of enterprise information modeling tools. Almost in the
same time frame ANSI will release the Information
Resource Dictionary System (IRDS) Conceptual Schema
standard, which recommends the conceptual graphs (CGs)
or other representation languages based on logic to be
used for enterprise information modeling and
integration. In this paper we develop the foundations
for the utilization of conceptual structures (CS) in
combination with {\em EXPRESS} and STEP Application
Protocols in the field of Computer Integrated
Manufacturing (CIM). The most important result
described here is a mapping of {\em EXPRESS} into CGs.
Around it we develop the architecture of a system able
to analyze and translate some of the semantics of
information models. Our overall strategy consists of
representing the semantics of the language, including
the informal meanings represented in the {\em EXPRESS}
manual in plain English, in a systematic way in CS, and
then use this block of knowledge, that {\em can} be
processed by a machine, for the increasingly automatic
analysis, translation and integration of enterprise
information models. The work here described is one of
the components of a prototype of a model management
system under development at IBM, Kingston NY,
coordinated by the CIM Architecture group.",
}
@Misc{Wermelinger:1993:SEP,
author = "Michel Wermelinger",
title = "Searching Efficiently in Posets",
howpublished = "Term paper for the ``Topics in Programming
Techonology'' course",
month = mar,
year = "1993",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "MSc in Computer Engineering",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1993/ttp.ps.gz",
abstract = "In recent years hierarchies have gained new importance
in computer science, most notably due to
object-oriented programming languages, order-sorted
logics, and terminological knowledge representation
systems. It is thus necessary to find efficient ways to
implement hierarchies and the operations upon them. The
mathematical abstraction for hierarchies is the
partially ordered set (poset), and the crucial
operation is search. Therefore, this paper will survey
several algorithms for associative retrieval - the most
general form of searching - in arbitrary posets.",
}
@InProceedings{Wermelinger:1994:BCS,
author = "Michel Wermelinger and Jos{\'e} Gabriel Lopes",
booktitle = "Conceptual Structures: Current Practices ---
Proceedings of the Second International Conference on
Conceptual Structures",
title = "Basic Conceptual Structures Theory",
volume = "835",
publisher = pub-SPRINGER,
address = pub-SPRINGER:adr,
pages = "144--159",
year = "1994",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
series = "Lecture Notes in Artificial Intelligence",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1994/iccs94.ps.gz",
abstract = "Although the theory of Conceptual Structures is over
10 years old, basic notions (like canonical graphs) are
far from settled and are subject to constant extensions
and reformulations. However, most of these are done in
an informal way, which doesn't help in clarifying the
issues involved. It is our hope that this paper will
provide a first step towards the complete and rigorous
account of Conceptual Structures (CS) Theory, which is
needed for ongoing standardization and implementation
efforts. Towards that goal, we present formal
definitions of some of the central notions of CS theory
(type, referent, concept, relation, conceptual graph,
canonical formation rules, canon, and canonical graph)
in its simplest form, i.e. no contexts nor coreference
links are allowed and referents must be individuals. We
thereby introduce higher-order types in order to enable
the use of conceptual graphs at the metalevel, the
restriction operation of the canonical formation rules
is extended to make use of the relation hierarchy, we
show the relationship between denotation and conformity
relation, and we give a rigorous meaning to the
canonical basis, among other things.",
}
@InProceedings{Wermelinger:1995:CGF,
author = "Michel Wermelinger",
booktitle = "Conceptual Structures: Applications, Implementation
and Theory",
title = "Conceptual Graphs and First-Order Logic",
volume = "954",
publisher = pub-SPRINGER,
address = pub-SPRINGER:adr,
pages = "323--337",
year = "1995",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "Proceedings of the Third International Conference on
Conceptual Structures",
series = "Lecture Notes in Artificial Intelligence",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1995/iccs95.ps.gz",
abstract = "Conceptual Structures (CS) Theory is a logic-based
knowledge representation formalism. To show that
conceptual graphs have the power of first-order logic,
it is necessary to have a mapping between both
formalisms. A proof system, i.e. axioms and inference
rules, for conceptual graphs is also useful. It must be
sound (no false statement is derived from a true one)
and complete (all possible tautologies can be derived
from the axioms). This paper shows that Sowa's original
definition of the mapping is incomplete, incorrect,
inconsistent, and unintuitive, and the proof system is
incomplete too. To overcome these problems a new
translation algorithm is given and a complete proof
system is presented. Furthermore, the framework is
extended for higher-order types.",
}
@InProceedings{Wermelinger:1995:CSL,
author = "Michel Wermelinger",
editor = "Peter Eklund",
booktitle = "Proceedings of the Fourth International Workshop on
{PEIRCE}",
title = "Conceptual Structures Linear Notation: {A} Proposal
for {PEIRCE}",
publisher = "????",
address = "Santa Cruz, California, USA",
pages = "13--24",
day = "18",
month = aug,
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1995/peirce95.ps.gz",
year = "1995",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
abstract = "This document describes a grammar for the linear
notation of Conceptual Structures (CS). It has been
carefully designed in order to be simple (and therefore
easy to understand and implement), expressive, and easy
to modify. The main goal has been to develop a compact
yet powerful grammar that could be used for the PEIRCE
workbench.",
}
@MastersThesis{Wermelinger:1995:TBE,
author = "Michel Wermelinger",
title = "Teoria {B}{\'a}sica das Estruturas Conceptuais",
school = "Universidade Nova de Lisboa",
month = jan,
year = "1995",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1995/tese.ps.gz",
abstract = "As Estruturas Conceptuais s\~ao um formalismo de
representa\c{c}\~ao de conhecimentos baseado em grafos,
os chamados grafos conceptuais. A teoria foi
inicialmente desenvolvida por John Sowa h\'a dez anos.
Desde ent\~ao, uma comunidade cient\'\i{}fica cada vez
mais ampla tem-na utilizado em muitas \'areas de
aplica\c{c}\~ao e prop{\^o}s v\'arias altera\c{c}\~oes {\`a}
teoria original. Tamb\'em est\'a em desenvolvimento uma
implementa\c{c}\~ao estado-da-arte gratuita e, al\'em
disso, os grafos conceptuais foram adoptados num
padr\~ao ANSI em prepara\c{c}\~ao. Apesar desta
actividade n\~ao existe de facto uma defini\c{c}\~ao
formal, completa, consistente e revista da Teoria das
Estruturas Conceptuais. Esta disserta\c{c}\~ao vem
contribuir para essa defini\c{c}\~ao ao estender,
refinar e clarificar as no\c{c}\~oes b\'asicas da
teoria. A classifica\c{c}\~ao dos grafos conceptuais em
\begin{itemize} \item grafos sintacticamente correctos,
\item grafos bem tipados, \item grafos ontologicamente
correctos, chamados grafos can\'onicos, \item e grafos
verdadeiros \end{itemize} \'e a base da
clarifica\c{c}\~ao do significado das v\'arias
no\c{c}\~oes e serve de guia {\`a}s extens\~oes e aos
refinamentos introduzidos. As principais extens\~oes
foram feitas no sistema de tipos e no esquema de
depend\^encias entre v\'ertices de grafos, e o
refinamento de quase todos os aspectos da teoria - em
particular das regras de forma\c{c}\~ao de grafos
can\'onicos e das regras de infer\^encia para os grafos
verdadeiros - inclui o tratamento formal de algumas
propostas informais de outros autores.",
}
@TechReport{Wermelinger:1996:MAV,
author = "Michel Wermelinger",
title = "Maximiza\c{c}\~ao de Viagens {A}\'ereas",
type = "Nota T\'ecnica",
number = "UNL-DI-4/96",
institution = "Departamento de Inform\'atica, Universidade Nova de
Lisboa",
month = jul,
year = "1996",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1996/viagens.ps.gz",
abstract = "Apresenta-se um programa em C++ que, dado um conjunto
de liga\c{c}\~oes a\'ereas entre cidades, calcula a
viagem mais comprida (ou seja, a que passa pelo maior
n\'umero de cidades) e a viagem mais longa (ou seja, a
que demora mais dias) que tenham Lisboa como ponto de
partida e de chegada. Este documento \'e o relat\'orio
da minha solu\c{c}\~ao do trabalho final da cadeira de
Programa\c{c}\~ao 2, pelo que espero que seja \'util a
docentes e alunos de qualquer curso de
programa\c{c}\~ao.",
}
@InProceedings{Wermelinger:1997:DPC,
author = "Michel Wermelinger",
booktitle = "Proceedings of the Fifth International Conference on
Conceptual Structures",
title = "A Different Perspective on Canonicity",
volume = "1257",
publisher = pub-SPRINGER,
address = pub-SPRINGER:adr,
pages = "110--124",
year = "1997",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
series = "Lecture Notes in Artificial Intelligence",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1997/iccs97.ps.gz",
abstract = "One of the most interesting aspects of Conceptual
Structures Theory is the notion of canonicity. It is
also one of the most neglected: Sowa seems to have
abandoned it in the new version of the theory, and most
of what has been written on canonicity focuses on the
generalization hierarchy of conceptual graphs induced
by the canonical formation rules. Although there is a
common intuition that a graph is canonical if it is
``meaningful'', the original theory is somewhat unclear
about what that actually means, in particular how
canonicity is related to logic. This paper argues that
canonicity should be kept a first-class notion of
Conceptual Structures Theory, provides a detailed
analysis of work done so far, and proposes new
definitions of the conformity relation and the
canonical formation rules that allow a clear separation
between canonicity and truth.",
}
@InProceedings{Wermelinger:1997:HAM,
author = "Michel Wermelinger",
booktitle = "Proceedings of the Second International Workshop on
Software Engineering for Parallel and Distributed
Systems",
title = "A Hierarchic Architecture Model for Dynamic
Reconfiguration",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "243--254",
year = "1997",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1997/pdse97.ps.gz",
abstract = "Dynamic reconfiguration is the ability to modify a
parallel or distributed system while it is running. We
adopt the framework developed by Jeff Kramer and
colleagues at the system architecture level: changes
must occur in a consistent state, which is brought
about by ``freezing'' some system components. The goal
is to reduce system disruption, i.e., to minimize
\begin{enumerate} \item the part of the system to be
``frozen'' and \item the time taken by reconfiguration
operations. \end{enumerate} Towards the first goal we
take a connection based approach instead of a component
based one. To reduce time, we refine the
reconfiguration algorithm by executing changes in
parallel as much as possible. Our model also handles
hierarchic systems.",
copyright = "Copyright 1997 Institute of Electrical and Electronics
Engineers. Reprinted, with permission, from Proceedings
of PDSE'97, May 1997, Boston, USA. This material is
posted here with permission of the IEEE. Such
permission of the IEEE does not in any way imply IEEE
endorsement of any of Universidade Nova de Lisboa's
products or services. Internal or personal use of this
material is permitted. However, permission to
reprint/republish this material for advertising or
promotional purposes or for creating new collective
works for resale or redistribution must be obtained
from the IEEE by sending a blank email message to
info.pub.permission@ieee.org. By choosing to view this
document, you agree to all provisions of the copyright
laws protecting it.",
}
@Unpublished{Wermelinger:1997:CMP,
author = "Michel Wermelinger and Jos\'e Luiz Fiadeiro",
title = "Connectors for Mobile Programs",
month = dec,
year = "1997",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "Submitted to IEEE Transactions on Software
Engineering. This paper is a revised version of
\cite{Wermelinger:1998:CMP}.",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1997/mobile.ps.gz",
}
@InProceedings{Wermelinger:1998:TAA,
author = "Michel Wermelinger and Jos\'e Luiz Fiadeiro",
booktitle = "Proceedings of the 9th International Workshop on
Software Specification and Design",
title = "Towards an Algebra of Architectural Connectors: a Case
Study on Synchronization for Mobility",
publisher = pub-IEEE,
address = pub-IEEE:adr,
month = apr,
year = "1998",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "To appear",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1998/iwssd98.ps.gz",
abstract = "To cope with the flexibility and extensibility needed
for the specification of the architecture of evolving
software systems, it is useful to have a set of
primitive connectors from which new ones can be created
in a systematic way as needs arise and to connect
components only when they are required to interact.
This could be achieved with a connector algebra whose
constants are given primitive connectors and whose
operations allow the (transient) creation of new
connectors. This paper is a step towards that goal. We
put forward an application-independent connector for
partial action synchronization and three generic
operations. Applied to the basic connector, they
provide application-specific connectors for inhibition
and full synchronization of actions. Moreover, we
associate to each connector a condition stating when it
should be applied to components.",
copyright = "Copyright 1998 IEEE. Published in the Proceedings of
IWSSD9, April 1998 Isobe, Japan. Personal use of this
material is permitted. However, permission to
reprint/republish this material for advertising or
promotional purposes or for creating new collective
works for resale or redistribution to servers or lists,
or to reuse any copyrighted component of this work in
other works, must be obtained from the IEEE. Contact:
Manager, Copyrights and Permissions / IEEE Service
Center / 445 Hoes Lane / P.O. Box 1331 / Piscataway, NJ
08855-1331, USA. Telephone: + Intl. 908-562-3966.",
}
@Unpublished{Wermelinger:1998:TC,
author = "Michel Wermelinger and Jos\'e Luiz Fiadeiro",
title = "Transient Connectors",
month = feb,
year = "1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "Submitted",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1998/mobility.ps.gz",
abstract = "Software Architecture has put forward the concept of
connector to express complex relationships between
system components, thus facilitating the separation of
coordination from computation. This separation is
especially important in mobile computing due to the
dynamic nature of the interactions among participating
processes. To capture that dynamics, we associate to
each connector a condition stating when it should be
applied to components. The connectors are given in
COMMUNITY, a UNITY-like program design language which
has a semantics in Category Theory. We show how the
categorical framework can be used for applying the
proposed connectors to specific components and how the
resulting architecture can be visualized by a diagram
showing the components and the connectors.",
}
@TechReport{Wermelinger:1998:CMP,
author = "Michel Wermelinger and Jos\'e Fiadeiro",
title = "Connectors for Mobile Programs",
number = "DI-FCUL TR-98-1",
institution = "Department of Computer Science, University of Lisbon",
month = jan,
year = "1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1998/di-fcul-tr-98-1.ps.gz",
abstract = "Software Architecture has put forward the concept of
connector to express complex relationships between
system components, thus facilitating the separation of
coordination from computation. This separation is
especially important in mobile computing due to the
dynamic nature of the interactions among participating
processes. In this paper we present connector patterns,
inspired in Mobile UNITY, that describe three basic
kinds of transient interactions: action inhibition,
action synchronization, and message passing. The
connectors are given in COMMUNITY, a UNITY-like program
design language which has a semantics in Category
Theory. We show how the categorical framework can be
used for applying the proposed connectors to specific
components and how the resulting architecture can be
visualized by a diagram showing the components and the
connectors.",
}
@InProceedings{Wermelinger:1998:FSA,
author = "Michel Wermelinger",
booktitle = "Proceedings of ICSE'98",
title = "Formal Specification and Analysis of Dynamic
Reconfiguration of Software Architecture",
volume = "2",
publisher = pub-ACM,
address = pub-ACM:adr,
month = apr,
year = "1998",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "To appear. To be presented at the Doctoral Symposium",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1998/icse98.ps.gz",
abstract = "Many of today's software systems must cope with
changing configurations, and my PhD work (among other
current research) seeks to provide ways to specify and
analyse the dynamics of such architectures. I am
looking at work done in Software Architecture,
Distributed Systems, Mobile Computing, and Theoretical
Computer Science in order to develop a formal framework
at a sufficiently abstract level to investigate the
fundamental similarities of architectural evolution,
dynamic reconfiguration, and mobility and to serve as a
high-level Architecture Description Language able to
encompass other authors' proposals. The envisaged
approach will use rewriting, logical, and categorical
techniques.",
}
@Unpublished{Wermelinger:1998:SAE,
author = "Michel Wermelinger",
title = "Software Architecture Evolution and the Chemical
Abstract Machine",
month = jan,
year = "1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "Submitted",
URL = "http://www-ctp.di.fct.unl.pt/~mw/pubs/1998/evolution.ps.gz",
abstract = "The Chemical Abstract Machine (CHAM) is a
general-purpose, simple, intuitive and operational
programming model that has been used for the
specification and analysis of the computational
behaviour of software architectures. It therefore seems
to be a good candidate to describe also the dynamics of
the architecture itself and the coordination between
the two processes. We also explore the ability of the
CHAM to help establish the principles of software
architecture evolution by encoding different approaches
within the same framework.",
}
@InProceedings{Wermelinger:1998:TCM,
author = "Michel Wermelinger",
booktitle = "Proceedings of the 4th International Conference on
Configurable Distributed Systems",
title = "Towards a Chemical Model for Software Architecture
Reconfiguration",
publisher = pub-IEEE,
address = pub-IEEE:adr,
month = may,
year = "1998",
bibdate = "Tue Feb 17 08:43:19 MST 1998",
bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/w/wermelinger-michel.bib",
note = "To appear",
abstract = "The Chemical Abstract Machine is a general-purpose,
simple, and intuitive programming model. Among other
domains, it has been used for the specification and
analysis of the computational behaviour of software
architectures. In this paper we explore the ability of
the formalism to express the dynamics of the
architecture itself and to unify different approaches
to reconfiguration within a single framework.",
}