Show icon Show search tips...
Hide icon Hide search tips...

[Sy-cg-global] [Publicity-list] DIMACS Workshop on Applications of Lattices and Ordered Sets to Computer Science

Linda Casals lindac at
Wed Jun 4 09:38:38 EDT 2003

DIMACS Workshop on Applications of Lattices and Ordered Sets to
     Computer Science

July 8 - 10, 2003
DIMACS Center, CoRE Building, Rutgers University

      Jonathan Farley, Massachusetts Institute of Technology 
      Mel Janowitz, DIMACS / Rutgers University, melj at 
      Jimmie Lawson, Louisiana State University, lawson at 
      Michael Mislove, Tulane University, mwm at 

Presented under the auspices of the DIMACS Special Focus
on Mathematics and the Foundations of Computer & Information Science.

Further information may be obtained from

Lattices and ordered sets play an important role in many areas of
computer science. These range from lattices as models for logics,
which are fundamental to understanding computation, to the ordered
sets as models for computation, to the role both lattices and ordered
sets play in combinatorics, a fundamental aspect of computation. In
addition, many applications utilize lattices and ordered sets in
fundamental ways. These include such areas as knowledge
representation, text categorization and data mining, where order plays
a fundamental organizing principle, to the use of lattices and ordered
sets to analyze crypto-protocols in security, to inductive logic
programming, where ordered sets form basic models. A number of more
esoteric structures, such as Kleene algebras and quantales, also
feature in recent advances to understanding computation. This workshop
will bring researchers from the many areas which rely on lattices and
ordered sets together with those doing research in these and related
structures, in order to accomplish two goals:

1) to survey the many areas of computation where lattices and ordered
   sets play a role in order to better understand the problems common
   across these areas, and

2) to enhance the interactions between researchers in the areas of
   lattice theory and ordered sets, and those who utilize these
   structures in modeling computation and in areas of application.

It is expected that researchers in lattice theory and ordered sets
will benefit by discovering new and interesting problems where their
expertise can be applied, and those who work on applications will have
a chance to learn of new advances in these areas that could be applied
to problems where lattice theory and ordered sets traditionally have
played an important role. In addition to these goals, the intention
also is to present talks which are accessible to the broader public
that will help those working in related areas to understand the role
lattice theory and ordered sets play in theoretical computation and
its applications.

The workshop will feature several plenary lectures, whose goal will be
to give a broad background to the workshop, These lectures will be
complimented by several shorter talks that focus on particular areas
of application, as well as on recent advances in lattice theory and
ordered sets. The talks by leaders in lattice theory and ordered sets
will focus on applications to computer science, while the talks by
leading researchers in these areas will describe how techniques from
lattice theory and ordered sets have recently led to results and
applications to problems in computation.

Though most of the talks are by invitation, the organizers do wish to
encourage shorter contributed talks that are in the spirit of the
workshop. While we are especially interested in contributed talks that
are related to the interests of the plenary speakers (models of
quantum computation, logic programming, partial order methods in model
checking, security protocol analysis and Kleene algebras), we also
encourage submissions that are clearly related to the overall theme of
the workshop.

One page abstracts of proposed talks may be sent to any of the
organizers; these should be received by June 1, 2003 to receive full
consideration. Each submission will be carefully evaluated by the
organizers; only as many submissions can be accepted as time allows.

The workshop will be run in an informal manner with plenty of time for
free ranging discussion of issues related to the use of ordered sets
and lattices to topics in computer science and applications of
computers to other areas. People interested in these areas are
encouraged to attend and participate in these discussions. Formal
registration for the workshop is required.

There is limited support available for women, minorities and graduate
students who wish to participate, and who require assistance to attend
the workshop. Requests should be sent to the organizers.

 Invited session speakers and titles:
    Domains and Interaction
    Samson Abramsky, Oxford University

    Two Notions of Universality Considered for Bounded
    Lattices and Kleene Algebras 
    Mick Adams, SUNY

    The Theory of Fixed Points and Galois Connections 
    Applied to Language-Processing Problems 
    Roland Backhouse, University of Nottingham

    Lattices in Multi-Valued Model Checking 
    Glenn Bruns, Bell Labs

    Probability as Order 
    Bob Coecke, Oxford

    Some Open Problems in Kleene and Omega Algebras 
    Ernie Cohen, Microsoft

    Event-based methods for security protocols 
    Federico Crazzolara

    Melvin Fitting, Oxford University

    Implementing Operations on Set Covers via Lattice Algebra 
    Deborah S. Franzblau, CUNY/College of Staten Island

    Partial-Order Methods for Model Checking 
    Patrice Godefroid, Bell Laboratories

    A Decidable Class of Security Protocols 
    Joshua Guttman, Mitre

    Consistent Partial Model Checking 
    Michael Huth, Imperial and Shekhar Pradan

    Physics and Domain Theory 
    Keye Martin, Oxford University

    Applications of Lattices to Computer Security 
    Catherine Meadows, Naval Research Laboratory

    Modal Kleene Algebra 
    Bernhard Moeller, University of Augsburg

    Precedence-Inclusion Patterns and Relational Learning 
    Frank Oles, IBM

    Minimal bicompletions Dusko Pavlovic, Kestrel Institute

    The Visualization of Weighted Lattices for Data Representation 
    Alex Pogel,Tim Hannan and Lance Miller

    A General View of Approximation 
    Ales Pultr, Charles University B. Banaschewski

    Secret sharing schemes realizing access hierarchies 
    Stefan Schmidt

    Ultimate Approximations of Lattice Operators and Their 
    Applications in Knowledge Representation 
    Miroslaw Truszczynski and Victor W. Marek, Kentucky University
    Marc Denecker, K.U.Leuven

    Universality and Language Inclusion for Open and 
    Closed Timed Automata 
    James Worrell, Tulane Univerisity

    Sequents, Lattices, and Logic Programming 
    Guo-Qiang Zhang, Case Western Reserve University

Registration Fees: 

(Pre-registration deadline: June 23, 2003) 

Regular rate
Preregister before deadline $120/day
After preregistration deadline $140/day

Reduced Rate*
Preregister before deadline $60/day
After preregistration deadline $70/day

Preregister before deadline $10/day
After preregistration deadline $15/day

DIMACS Postdocs $0

Non-Local Graduate & Undergraduate students
Preregister before deadline $5/day
After preregistration deadline $10/day

Local Graduate & Undergraduate students $0
(Rutgers & Princeton)

DIMACS partner institution employees** $0

DIMACS long-term visitors*** $0

Registration fee to be collected on site, cash, check, VISA/Mastercard

Our funding agencies require that we charge a registration fee for the
workshop. Registration fees cover participation in the workshop, all
workshop materials, breakfast, lunch, breaks, and any scheduled social
events (if applicable).

* College/University faculty and employees of non-profit organizations
will automatically receive the reduced rate. Other participants may
apply for a reduction of fees. They should email their request for the
reduced fee to the Workshop Coordinator at
workshop at  Include your name, the Institution you
work for, your job title and a brief explanation of your situation.
All requests for reduced rates must be received before the
preregistration deadline. You will promptly be notified as to the
decision about it.

** Fees for employees of DIMACS partner institutions are waived.
DIMACS partner institutions are: Rutgers University, Princeton
University, AT&T Labs - Research, Bell Labs, NEC Laboratories America
and Telcordia Technologies. Fees for employees of DIMACS affiliate
members Avaya Labs, IBM Research and Microsoft Research are also

***DIMACS long-term visitors who are in residence at DIMACS for two or
more weeks inclusive of dates of workshop.


Information on participation, registration, accommodations, and travel
can be found at:


More information about the Dimacs-sy-cg-global mailing list