If you do not find what you are looking for here, try the Selected Publications and Other
Papers pages; if you still cannot find it, please contact my secretary
at
UCSD CSE Dept (+1 (858) 822-2337). See also the lists of books, and the complete list of all publications in my
resume (also available in pdf, though this may be updated less frequently).

Newer papers are usually available in pure postscript and/or pdf, but many
older papers are in gzipped postscript. In Unix, you can extract postscript
from a .ps.gz file with gunzip, and use ghostview to view the postscript. In
Windows, gzip seems too arcane for the Winzip Wizard, but can be handled by
Power Archiver, and postscript can be viewed using GSView. On Apple
machines, Stuffit Expander should work. You can view pdf files with acrobat.

[Newly Revised, 29 May 06] Time, Structure and Emotion in Music, by
Joseph Goguen and Ryoko Goguen, Japanese translation by Sumi Adachi to
appear in Japanese transwlation in Jo no Giho, Keio University
Press, Tokyo, 2006, a collection of the Keio University special invited
lectures, 2003-2004. There is also a postscript
version, which seems to work better on some browsers. This short paper
describes experiments with musical stimuli that reveal unexpected
properties of the chunking of qualitative experience, and sketches a theory
of qualia based on the blending model of algebraic semiotics.

[Newly Re-Revised, 27 May 06]Style as Choice of Blending Principles, by
Joseph Goguen and Fox Harrell, to appear in The Structure of Style:
Algorithmic Approaches to Understanding Manner and Meaning, ed. by
Shlomo Argamon, Kevin Burns, and Shlomo Dubnov, Springer 2006; postscript version also available. An earlier version appeared in Style and Meaning in
Language, Art, Music and Design, ed. by Shlomo Argamon, Shlomo
Dubnov and Julie Jupp; Proceedings of a Symposium at 2004 AAAI Fall
Symposium Series, Technical Report FS-04-07, AAAI Press, 2004, pages 49
to 56 (Washington DC, October 21-24); there are also a postscript version, and powerpoint slides for the lecture. This paper proposes a
new approach to style based on the principles for blending that works
employ; it also includes an implementation approach to syntax based on
structural blending and cognitive grammar, and proposes a reconsideration
and generalization of optimality principles for blending. A poetry
generation system based on this ideas is also explained, and some output is
included.

[Newly Re-Revised, 1 May 06]Mathematical Models of Cognitive Space and Time, a
preliminary version will appear in Reasoning and Cognition, edited
by Daniel Andler and Mitsu Okada; proceedings of symposium at Keio
University, December 2005. A better title for the revised version would be
"Reasoning about Mathematical Models of Cognitive Space and Time." The
paper constructs mathematical models for reasoning about space and time,
and metaphors of time as space, using the language of unified concept
theory, especially frames and frame blending. The new material provides
more explanation and motivation for categories and institutions, with some
pictures. Slides of talk Mathematical
models of cognitive space and time at University of Bremen, Center
for Research on Spatial Cognition, 30 September 2005, Bremen, Germany (does
not have the most recent results, but does have some pictures).

[Newly Revised in response to referee comments, 9
April 2006]Information Integration in
Institutions, to appear in Jon Barwise Memorial Volume
edited by Larry Moss, Indiana University Press, 2006. This paper unifies
and/or generalizes several approaches to information, including the
information flow theory of Barwise and Seligman, the formal conceptual
analysis of Wille, the lattice of theories approach of Sowa, the
categorical general systems theory of Goguen, and the cognitive semantic
theories of Fauconnier, Turner, Gardenfors, and others. Its rigorous
approach uses category theory to achieve independence from any particular
choice of representation, and institutions to achieve independence from any
particular choice of logic. Corelations, cocones, and colimits over
arbitrary diagrams provide a very general formalization of information
integration, and Grothendieck constructions extend this to several kinds of
heterogeneity. Examples from databases, ontologies, cognitive semantics
and other areas are treated. An unusual way to institutionalize databases
is given in an appendix, inspired by C.S. Peirce's triadic semiotics.
Another appendix gives a brief overview of category theory. A postscript version is also available.

[New] A short essay, A Distributed Integration Approach to Learning,
written for a Science of Distributed Learning project meeting on 8 November
2005. Suggests a way to unify several different approaches to learning,
based on the view that learning is a form of distributed integration.

[New] Another short essay, Support for Ontological Diversity and
Evolution, written for the SEEK (Science Environment for Ecological
Knowledge) project meeting on 27 October 2005. Argues that multiple
ontologies for single domains are inevitable, and suggests technology and
theory to support work in such environments, including ways to detect and
negotiate differences.

[New] The
Griot System Homepage describes the multimedia display/performane
engine we are developing, to integrate generative graphics, structured
generative text (narrative, poetry, etc.), music, and so on. The page
describes the system architecture, lists performances using the system, and
gives links to references providing more details.

[New]Specifying, Programming and Verifying with Equational Logic,
by Joseph Goguen and Kai Lin, in We Will
Show Them! Essays in honour of Dov Gabbay, Vol. 2, edited by Sergei
Artemov, Howard Barringer, Artur d'Avila Garcez, Luis Lamb and John Woods,
College Publications 2005, pages 1-38. In a logical programming language,
a program is a theory over a formal logic, and its computation is deduction
in that theory. As a consequence, specification, programming and
verification all fit a single unified framework. The OBJ languages are
logical programming languages, based on various extensions of first order
equational logic. Everything in these languages is logic-based, including
their powerful module systems, which provide a convenient language for
software architecture. A new feature introduced in this paper is mutual
coinduction, illustrated with inductive proof schemes. Two theoretical
contributions are a new formalization of logical programming, and a new
semantics for higher order modules. A postscript
version is also available, as are versions in the much more voluminous
format of the book, in pdf and postscript.

[Newly Revised]Verifying Design with Proof Scores, by Kokichi
Futatsugi, Joseph Goguen and Kazuhiro Ogata, to appear, Proceedings,
Verified Software: Theories, Tools, Experiments, workshop celebrating
150th anniversary of Eidgenoschische Hochschule Zurich, 10-13 October 2005.
This paper argues that design verification is a superior approach to code
verification, and argues that proof scores are an attractive approach to
design verification. A postscript version is
also available.

[New]Data, Schema, Ontology, and Logic Integration, to appear in
Logic Journal of the IGPL (IGPL stands for " Interest Group on Pure
and Applied Logic"), volume 13, no 6, 2006; special issue on combining
logics, edited by Walter Carnielli, Miguel Dionisio, and Paulo Mateus; postscript version also available. Extended
abstract appears in Proceedings, CombLog'04 Workshop, edited by Walter Carnielli,
Miguel Dionisio, and Paulo Mateus, pages 21-31; held 28-30 July 2004, in
Lisbon, Portugal; keynote address. Motivation and theory for a "data
integration chain," from data to schema to ontology to ontology language to
ontology logic integration; main new ideas are abstract schema, abstract
schema species, and abstract schema morphism.

[New] A Trip Report
Page, with descriptions of some recent trips, some with photos.

[Newly Revised]What is a Concept?, by Joseph Goguen, in
Proceedings of 13th
International Conference on Conceptual Structures (ICCS '05), edited by
Frithjof Dau and Marie-Laure Mungier, Springer Lecture Notes in Artificial
Intelligence, volume 3596, pages 52-77, 2005; conference held 18-22 July,
2005, Kassel, Germany. Slides for the
lecture are also available in pdf and in
postscript. This paper surveys a number of approaches to concepts,
focussing on cognitive, social, and formal approaches, and in particular,
unifies the symbolic mental spaces of Fauconnier and the geometric conceptual
spaces of Gardenfors; ideas of Peirce and Latour help to unify the diversity
of approaches.

[Newly Revised]What is a Logic?, by Till Mossakowski, Joseph
Goguen, Razvan Diaconescu, and Andrzej Tarlecki, Logica Universalis,
ed. Jean-Yves Beziau (Birkhauser, 2005), pages 113-133. Proceedings of First World Conference on Universal
Logic, 26 March to 3 April 2005, Montreaux, Switzerland. Defines an
equivalence relation on institutions such that the equivalence classes
define a notion of "a logic"; in addition, several interesting invariants
are defined for this notion, including a new Lindenbaum category
construction and a model cardinality spectrum. To handle proof theory,
traditional categorical logic is extended to use sets of sentences instead
of single sentences as objects.

[New]Qualia
Project Homepage. Research on the vexing problem of qualia, with links
to papers and websites on this topic.

[New]Arts,
Music and Consciousness. Information on the Art and the Brain
book series, and links to research on a new musicology for forms of music
developed after about 1950, including free jazz improvisation; nonlinear
dynamical systems theory provides a mathematical basis, but ideas from
blending theory and hierarchical information theory are also used.

Homepage for Computational
Narratology, with links for work with Fox Harrell in this exciting new
area, which is concerned with developing theory and technology to produce
interesting new multimedia narratives on the fly for computer games, active
poems, and other new media objects.

Website of CSE 294A, graduate research
seminar on Meaning and Computation; Spring 2004 meetings provided an
introduction to general algebra, with computer science applications.

A blog, with notes on computer science, sociology
of technology, logic, life, and all that. Note: The blog has
recovered from a serious security bug in its underlying Pivot system, and can
be read but not written at this time.

Verification with Proof Scores in
CafeOBJ, by Kokichi Futatsugi, Joseph Goguen, and Kazuhiro Ogata.
In Abstracts of Presentations at Workshop on Algebraic Development
Techniques, ed. Peter Mosses, 2004, pages 75-78 (Barcelona, 27-29 March).
A short description of a semi-formal approach to software verification.

Steps towards a Design Theory for Virtual
Worlds, by Joseph Goguen. Chapter in Developing Future
Interactive Systems, edited by Maribel Sanchez-Segura, published by Idea
Group, pages 116-152, 2005; an html version
is also available. This paper is an expanded and revised version of a
keynote lecture given at the Virtual Worlds and Simulation
Conference, Phoenix AZ, 10 January 2001, and published in Proceedings,
Conference on Virtual Worlds and Simulation, edited by Christopher
Landauer and Kirstie Bellman, Society for Modelling and Simulation, 2001,
pages 298-303. It sketches algebraic semiotics and its applications,
especially to user interface design and scientific visualization; it is an
update of a "distinguished lecture" Algebraic Semiotics and User
Interface Design, given at the Institute for Software Research,
University of California at Irvine, 20 October 2000.

Critical Points for Interactive Schema
Matching, with Guilian Wang, Young-Kwang Nam, and Kai Lin.
Technical Report CS2004-0779, UCSD Department of Computer Science, 31 January
2004; this is the long version of a paper of the same name in Advanced Web
Technologies and Applications, edited by Jeffrey Xu Yu, Xuemin Lin,
Hongjun Lu and YanChun Zhang, Springer Lecture Notes in Computer Science,
volume 3007, 2004, pages 654-664. Proceedings of Sixth Asia Pacific Web
Conference, Hangzhou, China, 14-17 April 2004. The shorter published version is also available, as is a pdf version of the full report.

Website of CSE 87C, an undergraduate seminar
on Computational Narratology.

Consciousness Studies, in
Encyclopedia of Science and Religion, vol 1, ed. J. Wentzel Vrede van
Huyssteen, Macmillan Reference, 2003, pp. 158-164. A pdf version is also available. This is a brief survey of
the emerging field of consciousness studies (by request of the editor, this
article contains more on religion than normally appears in my papers). Slides
are available for a science-oriented lecture version of Consciousness Studies, given as part of a
seminar for mental health professionals offered by the University of
California at Berkeley Extension, 27 September 2003.

Visit the "world-famous" UC San Diego Semiotic
Zoo for an astonishing collection of exotic semiotic morphisms, each
an example of bad design arising through failure to preserve some relevant
structure. Notes: (1) The zoo is still under construction, and one
wing is not yet open; (2) the zoo won a "Creativity Award" from Art & Technology; (3) links to
papers explaining the ideas of algebraic semiotics can also be found at this
site.

Institution Morphisms, by Joseph
Goguen and Grigore Rosu, in
Formal Aspects of Computing 13, 2002, pages 274-307; special issue
edited by Don Sannella, in honor of the retirement of Rod Burstall. This
paper brings greater order to the chaotic menagerie of different genres and
species of morphisms between institutions, by exploring their basic properties
and some important relationships among them, and by giving them systematic
suggestive names.

A Hidden Herbrand Theorem: Combining the
Object, Logic and Functional Paradigms, by Joseph Goguen, Grant Malcolm, and Tom Kemp, Journal
of Logic and Algebraic Programming, Volume 51, 2002, pages 1-41. Shows
how to combine the logic and object paradigms using hidden algebra with
existential quantifiers. This is a journal version of a paper in
Principles of Declarative Programming, edited by Catuscia Palamidessi,
Hugh Glaser and Karl Meinke (Proceedings of PLIP/ALP'98 [Programming
Languages, Implementations, Logics and Programs / Algebraic and Logic
Programming], Pisa, Italy, 14-19 September 1998), Springer Lecture Notes in
Computer Science, Volume 1490, pages 445-462. (The paper was completed in
2001, and uses an older version of hidden algebra.) Compressed postscript and pdf versions are also available.

Structure and Values in Music, a
brief description of a project in its early stages, on implicit values and
formal structure in music, particularly improvised music.

Kumo, BOBJ, and Behavioral
Verification, tutorial given 26 November 2001 at ASE'01
(Automated Software Engineering 2001), San Diego, and also used for lecture at
Keio University, Tokyo, 18 December 2001.

Web-based Support for Cooperative Software
Engineering, by Joseph Goguen and Kai
Lin. In Annals of Software Engineering, volume 12, No. 1, pages
167-191, 2001, special issue on multimedia software engineering, edited by
Jeffrey Tsai. This is an overview of the Tatami project, featuring version
4 of the Kumo proof assistant and website generator, and focusing on its
design decisions, its use of multimedia web capabilities, and its
integration of formal and informal methods for software development in a
distributed cooperative environment. A gzipped
postscript version is also available. The paper is a revised and
expanded version of the paper Web-based
Multimedia Support for Distributed Cooperative Software
Engineering, by Joseph Goguen and Kai
Lin, which appeared in Proceedings, International Symposium on
Multimedia Software Engineering, edited by Jeffrey Tsai and Po-Jen
Chuang, IEEE Press, pages 25-32; this meeting was held in Taipai, Taiwan,
December 2000.

Circular Coinduction by Grigore Rosu and Joseph Goguen, in
Proceedings, International Joint Conference on Automated Deduction,
Sienna, June 2001. This paper provides the full proof of correctness of
circular coinduction, and draws some consequences, including various
congruence criteria. A gzipped postscript
version is also available.

Notes on Narrative, by Joseph
Goguen, Brief overview of some techniques for the analysis of stories,
including summaries of the structural theory of narrative, and techniques for
the extraction of value systems from stories. See also The Structure of Narrativ for a precise
formal model.

A collection of proof displays
generated by the latest Kumo proof
assistant and website generator, version 4. This is part of the Tatami project, one goal of which is to make
machine proofs much more readable than is usual; the project has some emphasis
on behavioral proofs of distributed concurrent systems. The following proofs
are available for your browsing pleasure:

An inductive proof that 1+...+
n = n(n+1) / 2. This will give you a chance to explore Kumo's
navigation and display conventions on a simple example.

A coinductive proof of a
behavioral property of a simple flag object. This illustrates some basics
of the hidden algebra approach on a very simple example; it gives an
especially clear explanation of the need for behavioral properties.

Two proofwebs for some familiar inductive properties of lists. The first
was generated by a duck score written at the beginning of this effort; it is
striking that all the lemmas needed to complete the proof can be deduced from
the way that an improving series of proof attempts fail. The second proofweb
succeeds, and was generated by a duck score derived from the first just by
reordering its goals so that the lemmas that were found necessary are proved
in the correct order.

This early attempt at
proving that the reverse of the reverse of a list is the list, takes a direct
approach, and its explanations emphasize the way that the two lemmas that are
needed to complete the proof can be deduced from the output produced by
unsuccessful proof attempts; one of these lemmas is the associativity of
append

Here are the complete proofs
for all three inductive properties of lists, including the two lemmas
that are needed to establish the main goal.

A simple inductive proof of a formula for the sum of the squares of the first n natural numbers. This example is deliberately very spare,
and in particular has no explanations, in order to illustrate the default
conventions that Kumo uses when a user supplies only the absolute minimum
input.

tutorial material on hidden algebra (which
won a "Key Resource Award in Formal Methods" from links2go), which is linked
to other tutorials on first order logic, and proof planning;

many user-supplied home and explanation pages;

several illustrative Java applets; and

live proof execution via an OBJ server.

Netscape 3.0 or later and some knowledge of hidden algebra are needed. This is version 4 of Kumo,
implemented by Kai Lin. Eventually the Java
source code will also be available for downloading via the Kumo homepage.
Your feedback is very welcome: please send comments on the implementation to
the implementer, Kai Lin, and comments
on the explanations and the theory to Joseph Goguen.

Two chapters from Theorem Proving and Algebra, by Joseph Goguen, to
be published by MIT Press, someday. This book provides introductions to
general algebra and its applications in computer science, especially term
rewriting and theorem proving. Chapter 1, Introduction and Chapter 8 is First Order Logic, plus the References and the Table of
Contents, are available. Chapter 8 gives an elegant algebraic exposition
of first order logic, proof planning and induction; the approach to induction
is unusually general, and there are many examples.

An Implementation-Oriented Semantics for Module
Composition, by Joseph Goguen and Will Tracz, in Foundations of
Component-based Systems, edited by Gary Leavens and Murali Sitaraman,
Cambridge, April 2000, pages 231-263. The full
version of 7 March 1997, revised 15 October 1998 is also available, but
some bugs still need fixing in this version. Considers horizontal and
vertical module composition, with laws relating them, using a purely set
theoretic version of institutions, in a way that applies to any imperative
programming, specification language pair.

Software Engineering with OBJ: algebraic specification in action,
edited by Joseph Goguen and Grant
Malcolm, Kluwer, April 2000; ISBN 0-7923-7757-5. A book on OBJ3 and its
applications. The paper Introducing OBJ,
which is essentially a user manual for OBJ3, was revised and extended in
August 1999. The Introduction with a
table of contents, and the paper More Higher Order
Programming with OBJ3, are also available.

An Introduction to Algebraic Semiotics, with
Applications to User Interface Design, by Joseph Goguen, in
Computation for Metaphor, Analogy and Agents, edited by Chrystopher
Nehaniv, Springer Lecture Notes in Artificial Intelligence, volume 1562,
1999, pages 242-291. This is the original paper on the mathematical
foundations of algebraic semiotics, with 3/2-categories and 3/2-colimits,
which provide a foundation for blending with any optimality principle given
as a partial ordering on morphisms; the paper also has many examples,
especially from user interface design. A preliminary version appeared in
Proceedings, Conf. on Computation for Metaphor, Analogy and Agents
(Aizu-Wakamatsu, Japan, 6-10 April 1998) pages 54-79. For some recent
updates, see the webpaper Formal Notation
for Conceptual Blending. An earlier version is Semiotic
Morphisms, Technical Report CS97-553, August 1997, and a now obsolete
extended abstract appeared in Proceedings, Conference on Intelligent
Systems: A Semiotic Perspective, Volume II (National Institute of Standards
and Technology, Gaithersberg MD, 20-23 Oct 1996) pages 26-31.

Hidden Congruent Deduction, by Grigore Rosu and Joseph Goguen, in
Automated Deduction in Classical and Non-Classical Logics, edited by
Ricardo Caferra and Gernot Salzer, Lecture Notes in Artificial Intelligence,
Volume 1761, pages 252-267, 2000. Preliminary version in Proceedings,
First-Order Theorem Proving - FTP'98, edited by Ricardo Caferra and Gernot
Salzer, Technische Universitat Wien, pages 213-223, 1998 (proceedings of a
workshop held at Schloss Wilhelminenberg, Vienna, November 23-25, 1998; the complete proceedings are available on
the web, and by ftp). This paper
extended all the main notions and results of hidden algebra to operations that
may have more than one hidden argument, introduced the notion of cobasis, gave
criteria for operations to be congruent, and introduced more powerful rules of
deduction.

Tossing Algebraic Flowers down the Great
Divide, by Joseph Goguen, in People and Ideas in Theoretical
Computer Science, edited by Cristopher Calude (Springer 1998), pages
93-129. A sort of intellectual autobiography, written by invitation for the
25th anniversary celebration of the European Association for Computer Science,
for a book of such essays.

A Hidden Agenda, by Joseph Goguen and Grant Malcolm, Theoretical
Computer Science, vol 245, no 1, pages 55-101, August 2000, special issue
on Algebraic Engineering, edited by Chrystopher Nehaniv and Masami Ito. This
is an early basic paper on hidden algebra, treating coinduction,
nondeterminism, concurrency and more. A compressed
postscript version is also available. An earlier version is UCSD Technical Report CS97-538, April 1997, and an
obsolete abstract is in Proceedings of Workshop on New Mathematics
for Computer Science, in Conference on Intelligent Systems: A Semiotic
Perspective (National Institute of Standards and Technology, Gaithersberg MD,
20-23 Oct 1996) pages 159-167.

Hidden Algebra for Software
Engineering, in Combinatorics, Computation and Logic,
Proceedings, Conference on Discrete Mathematics and Theoretical Computer
Science, (University of Auckland, New Zealand, 18-21 January 1999), edited by
Cristian Calude and
Michael Dinneen, Australian Computer Science Communications, Volume 21,
Number 3, Springer, pages 35-59, 1999 (keynote lecture). A compressed postscript version is also available. A
gentle introduction to hidden algebra, with simple examples, much motivation,
and some history.

Signs and Representations: Semiotics for
User Interface Design, by Grant Malcolm and Joseph Goguen, in
Visual Representations and Interpretations, edited by Ray Paton and
Irene Nielson, Springer, 1999 (proceedings of a workshop held in Liverpool,
UK), pages 163-172. An informal introduction to algebraic semiotics with
examples, including aspects of operating systems interfaces.

Stretching First Order Equational Logic:
Proofs with Partiality, Subtypes and Retracts. Watch retracts at
work and at play! Watch these happy little cuties frolic as they prove
results about partial functions! Submitted for publication; last modified 2
June 1998. An obsolete version appears in, Proceedings, International
Workshop on First Order Theorem proving (Schloss Hagenbert, Austria, 27-28
October 1997), edited by Maria Paola Bonacina and Ulrich Furbach, RISC-Linz
Report 97-70, pages 78-85, 1997; the complete proceedings are available on the
web.

Towards a Social, Ethical Theory of
Information, in Social Science Research, Technical Systems and
Cooperative Work, edited by Geoffrey Bowker, Les Gasser, Leigh Star and
William Turner (Erlbaum, 1997) pages 27-56. A pdf
version is also available. Presents a theory of information based on
social interaction, especially ethnomethodology, and shows how values arise
naturally in such a theory.

A Very Brief History of Truth. Written in
1996 as an exercise in html, this is a tongue in cheek build up
to semi-automated theorem proving systems, such as our own Kumo.

Towards an Algebraic Semantics for the Object
Paradigm, by Joseph Goguen and Rãzvan Diaconescu, in Recent
Trends in Data Type Specification, Proceedings of the 9th Workshop on
Abstract Data Types (Caldes de Malevella, Spain, 28 October 1992), edited by
Hartmut Ehrig and Fernando Orejas, Springer, Lecture Notes in Computer
Science, Volume 785, 1994, pages 1-29. Although this is an early paper on
hidden algebra, it includes an approach to inheritance, and details of the
categorical concurrent connection construction.

Logical Support for Modularisation,
with Rãzvan Diaconescu and
Petros Stefaneas. In Logical Environments, edited by Gerard Huet and
Gordon Plotkin (Proceedings of a Workshop held in Edinburgh, May 1991),
Cambridge, 1993, pages 83-130. Studies properties of logical that support
the definition, combination, parameterisation and reuse of modules. Results
give connections among preservation of conservative extension under pushouts,
distributive laws for information hiding over sums, and Craig interpolation.

If you have not found what you are looking for, try the Selected Publications and Other
Papers pages; if you still cannot find it, please contact my secretary
at
UCSD CSE Dept (+1 (858) 822-2337). See also the lists of books, and the complete list of all publications in my
resume (which is also available in pdf, although this is likely to be updated less
frequently).
Maintained by Joseph Goguen
Last modified: Mon May 29 13:26:41 PDT 2006