Received: by CLI.COM (4.1/1); Wed, 12 Jan 94 18:02:44 CST
Date: Wed, 12 Jan 94 18:02:43 CST
From: "Robert S. Boyer" <boyer@CLI.COM>
Message-Id: <9401130002.AA24102@dilbert.cli.com.CLI.COM>
Received: by dilbert.cli.com.CLI.COM (4.1/CLI-1.2) 
	id AA24102; Wed, 12 Jan 94 18:02:43 CST
To: nqthm-users@cli.com
Subject: Nqthm-1992
Reply-To: boyer@cli.com

	      ANNOUNCEMENT OF A NEWLY AVAILABLE VERSION OF NQTHM


A new version of our theorem proving program Nqthm is now available.  The new
version is called Nqthm-1992.  The previous version was released in 1987.

The new version is almost perfectly upwards compatible with the previous
release.  Some minor bugs have been fixed, several new features have been
added, and a few performance enhancements have been made.  We know of no bug in
the previous release of Nqthm that can lead to a proof of (FALSE), but we
highly recommend to all Nqthm users that they obtain and install Nqthm-1992 and
delete or archive away any earlier version.

Included with the Nqthm-1992 distribution are thousands of Nqthm-checked
theorems formulated by Bevier, Boyer, Brock, Bronstein, Cowles, Flatau, Hunt,
Kaufmann, Kunen, Moore, Nagayama, Russinoff, Shankar, Talcott, Wilding, Yu, and
others.

There is a new license for Nqthm-1992 whose terms are more liberal than those
of the previous license.  In particular, no longer is reporting of who has
copies of Nqthm required of those who obtain or redistribute the new version.

The release of Nqthm-1992 includes three revised chapters of the book `A
Computational Logic Handbook', including Chapter 4, on the formal logic for
which the system is a prover, and Chapter 12, the reference guide to user
commands.  Change bars in the margin of the postscript version of these
chapters indicate what is new.

To obtain Nqthm-1992, connect to Internet site ftp.cli.com by anonymous ftp,
giving your email address as the password, `get' the file
/pub/nqthm/nqthm-1992/README, and follow the instructions therein.

Source code for Nqthm-1992 is included in this distribution.  Building the
system requires only a few steps, given a running Common Lisp.  Nqthm-1992 is
not dependent on any particular Common Lisp implementation or operating system.
It has been run under both CLTL1 and CLTL2 conforming implementations of Common
Lisp.  Nqthm-1992 has been run in a variety of settings, including under
Austin-Kyoto, CMU, Franz, Lucid, Macintosh, and Symbolics Common Lisps, and
under Linux, Macintosh, Sun, Symbolics, and Ultrix operating systems.  As a
convenience for users of Unix-like systems, there are `make' files for building
and testing.  Also, a few executable images are available, currently via AKCL
for both Sparcs and Linux-running PC-Clones and via MCL 2.0.1.

Robert S. Boyer  (boyer@cli.com)         J Strother Moore (moore@cli.com)

Computational Logic, Inc.
Austin, Texas

January, 1994








Date: Wed, 12 Jan 94 18:20:26 CST
From: Matt Kaufmann <kaufmann>
Message-Id: <9401130020.AA00764@thunder.CLI.COM>
Received: by thunder.CLI.COM (4.1/CLI-1.2) 
	id AA00764; Wed, 12 Jan 94 18:20:26 CST
To: nqthm-users
Subject: Pc-Nqthm-1992

             Announcement of a Newly Available Version of Pc-Nqthm

A new version of the "Pc-Nqthm" interactive enhancement of the Boyer-Moore
theorem proving program Nqthm is now available.  The new version is called
Pc-Nqthm-1992, and is an extension of the newly-released Nqthm-1992 version of
Nqthm.

As is the case with Nqthm-1992, this new version of Pc-Nqthm is almost
perfectly upwards compatible with the previous release.  Details may be found
in the file text/release-notes.txt that is provided with the system, but these
may in most cases be safely ignored.  Note however that like Nqthm-1992, all
Pc-Nqthm-1992 libraries (i.e., the .lib and .lisp files produced by MAKE-LIB)
are incompatible with those from the 1987 versions of Nqthm and Pc-Nqthm.

It is highly recommended that all Pc-Nqthm users obtain and install Nqthm-1992
and Pc-Nqthm-1992 and delete or archive away any earlier versions.  Note that
Pc-Nqthm-1992 is built on top of Nqthm-1992, and will not run on top of older
versions of Nqthm.

Included with the Nqthm-1992 distribution are a large number of
Pc-Nqthm-checked definitions and theorems formulated by Cowles, Goldschlag,
Kaufmann, Siebert, Verkest, Wilding, and Young.

As with Nqthm-1992, there is a new license for Pc-Nqthm-1992 whose terms are
more liberal than those of the previous license.  In particular, no longer is
reporting of who has copies of Pc-Nqthm required of those who obtain or
redistribute the new version.

To obtain Pc-Nqthm-1992, connect to Internet site ftp.cli.com by anonymous ftp,
`get' the file /pub/pc-nqthm/pc-nqthm-1992/README-pc, and follow the
instructions therein.

Source code for Pc-Nqthm-1992 is included in this distribution.  Building the
system requires only a few steps, given a running Common Lisp.  Pc-Nqthm-1992
is not dependent on any particular Common Lisp implementation or operating
system, in a variety of settings.  As a convenience for users of Unix-like
systems, there are `make' files for building and testing.  Also, a few
executable images are available.

Matt Kaufmann  (kaufmann@cli.com)

Received: by CLI.COM (4.1/1); Thu, 20 Jan 94 09:26:51 CST
Date: Thu, 20 Jan 94 09:26:50 CST
From: Matt Kaufmann <kaufmann@CLI.COM>
Message-Id: <9401201526.AA02090@thunder.CLI.COM>
Received: by thunder.CLI.COM (4.1/CLI-1.2) 
	id AA02090; Thu, 20 Jan 94 09:26:50 CST
To: theorem-provers@mc.lcs.mit.edu, qed@mcs.anl.gov, mind@aisb.ed.ac.uk,
        indus@herky.cs.uiowa.edu, nqthm-users@cli.com, info-hol@cs.uidaho.edu,
        isabelle-users@cl.cam.ac.uk, dreamers@aisb.ed.ac.uk, risks@csl.sri.COM,
        cade-12@aisb.edinburgh.ac.uk, basin@mpi-sb.mpg.de, fausto@irst.it,
        kaufmann@cli.com
Subject: workshop announcement

		       CALL FOR WORKSHOP PARTICIPATION:
				       
		  Correctness and Metatheoretic Extensibility
			of Automated Reasoning Systems
				       
			June 26, 1994 (see Note at end)
				 Nancy, France
				       
			   Held in conjunction with
				    CADE-12
	   (Twelfth International Conference on Automated Deduction)
				 Nancy, France

Please post/circulate.

This one-day workshop will center around three related themes: 

1) How can we guarantee that the formulas proved by theorem provers
   are actually theorems?
2) How can provers themselves be verified or built in some correct
   way?
3) How can theorem provers be soundly extended with new inference
   rules and procedures?
 
These themes are motivated by problems in applying computers to
machine checked mathematics, for example, formal proofs of program
correctness.  They are central issues in many applications, in
particular in constructing software and hardware which provably meet
formal specifications.

The first two themes will address the question of how we can trust the
system we are using and how we can apply formal methods to the
construction of such systems.  This is an important and difficult
question as modern theorem provers (e.g., Never, Nqthm, Nuprl, HOL)
are quite complex, but yet must be more or less trusted if we are to
trust the correctness of proofs built with them.  Little work has been
done in this area to date.  The problem area encompasses for example,
ways we can verify a system within itself, or bootstrapping complex
verified provers from simpler already trusted ones.  It also
encompasses the problem of building simple trusted proof-checkers.

The third theme is significant as it is desirable to extend provers
with the kinds of rules and procedures that humans have found
effective in constructing proofs.  Hence, some framework for
metatheoretic extensibility is desirable.  The primary traditional
solution to this problem is tactics, but they can be inflexible as
they must construct a justification using primitive inference rules.
Other approaches are the meta-functions of Boyer and Moore and the
work at Cornell (e.g., Constable, Howe, and others) in meta-theoretic
extensibility.

The structure of the workshop will be to alternate presentation of
current and past approaches to these questions with discussion and
comparison.  Of particular interest is work, both existing and
proposed, that has potential for realization in an implementation.

Potential participants should apply by submitting a short statement
that contains both an abstract of their work in this area that they
wish to present, if any, and a short description of their current
interests.  This should be sent by email to David Basin,
basin@mpi-sb.mpg.de, before February 27th.  Include also your address,
email address, phone, and fax information.  Participant notification
will be sent out no later than April.  If there is sufficient
interest, an informal workshop proceedings may appear afterwards, in
which case participants will have a chance to revise their statements
for the proceedings.

Organizers: 
   David Basin,          MPI Saarbruecken, basin@mpi-sb.mpg.de
   Fausto Giunchiglia,   IRST and University of Trento, fausto@irst.it
   Matt Kaufmann,        Computational Logic, Inc., kaufmann@cli.com

Note:  The CADE-12 workshop schedule is tentative at this point,
although unlikely to change.  If the date were to change, it would be
1 day later (June 27, 1994).  A final announcement will be sent when
the date is finalized.

From peter@informatik.uni-koblenz.de  Fri Jan 28 06:45:17 1994
Return-Path: <peter@informatik.uni-koblenz.de>
Received: from mailhost.uni-koblenz.de by cli.com (4.1/SMI-4.1)
	id AA08522; Fri, 28 Jan 94 06:45:17 CST
From: peter@informatik.uni-koblenz.de
Received: from bax.uni-koblenz.de by mailhost.uni-koblenz.de with smtp
	(Smail3.1.28.1) id m0pPsTG-0001caC; Fri, 28 Jan 94 13:38 MET
Message-Id: <m0pPsTG-0001caC@mailhost.uni-koblenz.de>
Received: by bax.uni-koblenz.de (4.1/KO-2.0)
	id AA17847; Fri, 28 Jan 94 13:40:39 +0100
Date: Fri, 28 Jan 94 13:40:39 +0100
To: fg121@inferenzsysteme.informatik.th-darmstadt.de, cade-12@aisb.ed.ac.uk,
        rewriting-list@lorraine.loria.fr, theorem-provers@mc.lcs.mit.edu,
        deduktion@intellektik.informatik.th-darmstadt.de,
        kgs@logic.tuwien.ac.at, aal@anu.edu.au, isabelle-users@cl.cam.ac.uk,
        info-hol@cs.uidaho.edu, nqthm-users@cli.com
Subject: CADE WS Theory reasoning 

+---------------------------------------------------------------+
|								|
|          Call  for  Workshop  Participation  (CADE  12)       |
|						   		|
|						   		|
|           THEORY  REASONING  IN  AUTOMATED  DEDUCTION	   	|
|								|
|								|
|                  Nancy, France, June 27, 1994		   	|
|								|
+---------------------------------------------------------------+


[ LaTeX version included below ]

Theory reasoning offers  the  possibility  of  combining  general
problem  solving  methods with specialized problem dependent rea-
soning systems.  A distinguished feature of theory reasoning sys-
tems is that the interface for the interaction of the two reason-
ing parts has to be designed very carefully.

Examples of such calculi are theory resolution, theory model  el-
imination,  and  constraint  resolution, where the combination of
the two reasoners is done on the literal or formula level. Anoth-
er  approach  offers  unification  based methods by integrating a
specialized theory reasoner at the term level.

Theory reasoning can also be seen as a framework for the integra-
tion  of  different reasoning paradigms.  The topic is of growing
interest and is an example of semantics-based  reasoning  as  op-
posed  to  purely syntactic reasoning.  Theory reasoning offers a
bridge from powerful knowledge representation  systems  to  effi-
cient theorem proving.


Topics of interest: 
--------------------
This workshop is intended to be quite broad; it should bring  to-
gether  interested researchers to exchange ideas, clarify notions
and point out new challenging research problems.  Papers are wel-
come  on all aspects of theory reasoning, including, but not lim-
ited to:

  o Applications of theory reasoning   o Implementation issues
  o Computational aspects              o Interface issues
  o Constraints                        o System descriptions
  o Hybrid systems                     o Theory reasoning calculi


Workshop: 
----------
The workshop is held in conjunction with CADE-12 (Twelth Interna-
tional  Conference on Automated Deduction).  Attendence is by in-
vitation only; authors of accepted papers will be  invited.   In-
formal  proceedings  containing  the accepted papers will be sup-
plied by the CADE organizing committee.  The registration will be
by  standard  CADE registration forms.  Further information about
CADE-12 can be obtained by anonymous ftp from  dream.dai.ed.ac.uk
(192.41.104.168), directory /pub/cade-12.


Submission: 
------------ 
Potential participants should apply by submitting an abstract  of
about  5  pages  to the address listed below. Please include your
postal address, phone number and e-mail address.  Although we ac-
cept hardcopies we strongly prefer e-mail submissions.  If possi-
ble, please send compressed and uuencoded .dvi or .ps-files.

Important dates:

            +-----------------------------------------------+
            | Submission deadline:  	  April  8, 1994    |
            | Notification of acceptance: April 29, 1994    |
            | Camera-ready copy due:      May   20, 1994    |
            +-----------------------------------------------+


Address for submission and further questions:
----------------------------------------------
  Ulrich Furbach   
  University of Koblenz
  Dept. of Computer Science
  Rheinau 1                
  56075 Koblenz            
  Germany                  
                           
  Phone:      +49 261 9119 433
  Fax:        +49 261 9119 499
  uli@informatik.uni-koblenz.de


Program Committee:
-------------------
  Peter Baumgartner              Germany
  Hans-J"urgen B"urckert         Germany
  Hubert Common                  France 
  Alan Frisch                    UK     
  Ulrich Furbach                 Germany
  Neil Murray                    USA    
  Uwe Petermann                  Germany
  Mark Stickel                   USA    


%%%%%%%%%%%%%%%%%%%%%% LaTeX Version %%%%%%%%%%%%%%%%%%%

\documentstyle[11pt]{article} 
\setlength{\oddsidemargin}{0cm}
\setlength{\evensidemargin}{0cm}
\setlength{\textwidth}{16cm}
\setlength{\topmargin}{0cm}
\setlength{\headsep}{0.0in}
\setlength{\textheight}{25cm}
\pagestyle{empty}

\setlength{\parindent}{0cm}

\begin{document}
\begin{center}
{\LARGE Call for Workshop Participation (CADE 12)}\\[3ex]
{\LARGE\bf Theory Reasoning in Automated Deduction} \\[3ex]
{\large \bf Nancy, France, June 27, 1994}
\end{center}
\bigskip

\parbox[t]{6.6cm}{
\setlength{\parskip}{0.5\baselineskip}
{\bf Program Committee:}\\[0.5ex]
\begin{tabular}{ll}
Peter~Baumgartner & Germany\\
Hans-J{\"u}rgen~B{\"u}rckert & Germany\\
Hubert~Common & France\\ 
Alan~Frisch & UK\\	 
Ulrich~Furbach &  Germany\\
Neil~Murray & USA\\
Uwe~Petermann & Germany\\
Mark~Stickel & USA
\end{tabular}
\bigskip

{\bf Submission Address:}\\[0.5ex]
\begin{tabular}{l}
Ulrich~Furbach\\
University of Koblenz\\
Dept.\ of Computer Science\\
Rheinau 1\\
56075 Koblenz\\
Germany\\[2mm]
\hskip-0.5em\begin{tabular}[t]{ll}
Phone: & +49~261~9119~433\\
Fax: &  +49~261~9119~499\\
\multicolumn{2}{l}{\tt uli@informatik.uni-koblenz.de}
\end{tabular}\\
\end{tabular}
%
}
\hfill
\rule[-10cm]{.3mm}{10.5cm}
\hfill
\parbox[t]{8.5cm}{
\setlength{\parskip}{0.5\baselineskip}
{\bf Theory reasoning} offers the possibility of combining general
problem solving methods with specialized problem dependent reasoning
systems.  A distinguished feature of theory reasoning systems is that
the interface for the interaction of the two reasoning parts has to be
designed very carefully.

Examples of such calculi are theory resolution, theory model
elimination, and constraint resolution, where the combination of the
two reasoners is done on the literal or formula level. Another
approach offers unification based methods by integrating a specialized
theory reasoner at the term level.

Theory reasoning can also be seen as a framework for the integration
of different reasoning paradigms.  The topic is of growing interest
and is an example of semantics-based reasoning as opposed to purely
syntactic reasoning. Theory reasoning offers a bridge from powerful
knowledge representation systems to efficient theorem proving.
}\\[2ex]

{\bf Topics of interest:} This workshop is intended to be quite broad;
it should bring together interested researchers to exchange ideas,
clarify notions and point out new challenging research problems.
Papers are welcome on all aspects of theory reasoning, including, but
not limited to:
\begin{quote}
{\em \setlength{\tabcolsep}{2em}
\begin{tabular}{ll}
Applications of theory reasoning & Implementation issues\\
Computational aspects & Interface issues \\
Constraints   & System descriptions\\
Hybrid systems  & Theory reasoning calculi 
\end{tabular}
}
\end{quote}

{\bf Workshop:} 
The workshop is held in conjunction with CADE-12 (Twelth International
Conference on Automated Deduction). Attendence is by invitation only;
authors of accepted papers will be invited. Informal proceedings
containing the accepted papers will be supplied by the CADE organizing
committee.  The registration will be by standard CADE registration
forms.  Further information about CADE-12 can be obtained by anonymous
ftp from {\tt dream.dai.ed.ac.uk} (192.41.104.168), directory {\tt
/pub/cade-12}.
\medskip

{\bf Submission:} Potential participants should apply by submitting an
{\bf abstract} of about {\bf 5 pages} to the address listed above.
Please include your postal address, phone number and e-mail address.
Although we accept hardcopies we {\em strongly\/} prefer {\bf e-mail
  submissions}. If possible, please send {\em compressed\/} and {\em
  uuencoded\/} $\star$.dvi or $\star$.ps-files.  The {\bf deadline}
for the submission is {\bf April 8, 1994}.  {\bf Notification of
  acceptance} will be {\bf April 29, 1994}. {\bf Hardcopies} for the
workshop abstracts are due {\bf May 20, 1994}.
\end{document}

%%%%%%%% End LaTeX Version %%%%%%%%%%%%%%%%

____________________________________________________________________
Peter Baumgartner                      | peter@infko.uni-koblenz.de
University of Koblenz,                 |
Institute for Computer Science         | Voice: +49 261 9119-426
Rheinau 1, 56075 Koblenz, Germany      | Fax:   +49 261 9119-499
____________________________________________________________________

From walsh@lorraine.loria.fr  Mon Jan 31 12:55:24 1994
Return-Path: <walsh@lorraine.loria.fr>
Received: from lorraine.loria.fr by cli.com (4.1/SMI-4.1)
	id AA00711; Mon, 31 Jan 94 12:55:24 CST
Received: from myrtille.loria.fr (myrtille.loria.fr [152.81.6.12]) by lorraine.loria.fr (8.6.5/8.6.5) with ESMTP id TAA24673 for <nqthm-users@cli.com>; Mon, 31 Jan 1994 19:54:54 +0100
From: Toby Walsh <Toby.Walsh@loria.fr>
Received: from localhost (walsh@localhost) by myrtille.loria.fr (8.6.4/8.6.4) id TAA20565 for nqthm-users@cli.com; Mon, 31 Jan 1994 19:54:58 +0100
Date: Mon, 31 Jan 1994 19:54:58 +0100
Message-Id: <199401311854.TAA20565@myrtille.loria.fr>
To: nqthm-users@cli.com
Subject: CADE-12 workshop on induction



+---------------------------------------------------------------+
|                                                               |
|                 Call  for  Participation                      |
|                                                               |
|                   CADE-12 Workshop on                         |
|                                                               |
|        Automation  of  Proof  by  Mathematical Induction      |
|                                                               |
|             Nancy, France, Monday 27th June, 1994             |
|                                                               |
+---------------------------------------------------------------+

Mathematical induction is required for reasoning about objects or
events containing repetition, e.g. computer programs with recursion or
iteration, electronic circuits with feedback loops or parameterised 
components. It is thus a vital ingredient in the development of formal
methods for the synthesis, verification and transformation of computer
software and hardware. There are also applications of mathematical
induction in the formation of plans containing repetition and in
explanation based learning of repetitive actions. Thus the automation
of inductive reasoning provides a major opportunity for the
application of AI techniques to design problems in computer science.

This workshop is the third in a series organised by the MInd and IndUS
consortia on the automation of proofs by mathematical induction. Previous
workshops were held in Albany (NY) in conjunction with CADE-11, and in
Washington (DC) in conjunction with AAAI-93. MInd is a European
consortium funded by ESPRIT and IndUS is a United States consortium
funded by NSF. The workshop is open to both members and non-members of
the MInd and IndUS consortia. 

Topics of interest: 
--------------------

The aim of the workshop is to bring together all researchers
interested in automating inductive reasoning. Topics for discussion
may include, but are not limited to, the following:

    o formalisms for inductive inference
    o explicit induction and inductive completion
    o architectures for inductive inference
    o heuristics for controlling inductive proof search
    o mechanisms for choosing induction rules
    o mechanisms for generalisation
    o mechanisms for suggesting lemmas
    o the productive use of failure
    o applications of inductive inference
    o the relationship between recursive programs and inductive
      proofs.

You are invited to suggest other topics and possible speakers.


Format of workshop:
-------------------

The workshop will consist of panel discussions and research
presentations. Each panel discussion will address a "hot topic" in 
inductive proof and will last approximately two hours. Two speakers, who
have made rival and significant contributions to these topics, will
each give a short introduction. The discussion will then be
thrown open to the floor. A combination of technical and
polemical contributions will be encouraged. So as to take
advantage of the most recent developments, we will leave the final
selection of "hot topics" until just before the workshop.
Selected participants will be invited to give short presentations of
their current research. Preference will be given to work that is
novel, promising and not already familiar to the other participants.

The workshop will be held in conjunction with CADE-12 (Twelth International
Conference on Automated Deduction). Attendence is by invitation only.
Registration will be via the standard CADE registration form.  Further
information about CADE-12 can be obtained by anonymous ftp from  
dream.dai.ed.ac.uk (192.41.104.168), directory /pub/cade-12.


Submission: 
------------ 
Persons wishing to attend the workshop should submit three copies of a
1 page summary of research in this area along with a postal address, phone 
number and an electronic mail address (if possible). Applications should be 
sent to Toby Walsh at the address below to arrive by Friday 15th April
1994. As postal services can be slow, we welcome electronic submissions, 
preferably in LaTeX or plain text format. All electronic submissions will
be acknowledged on receipt (though submissions received before April 1st 
will not be acknowledged till after April 1st). The research summaries will 
be circulated to workshop participants.

Important dates:

            +-----------------------------------------------+
            | Submission deadline:        April 15, 1994    |
            | Notification of acceptance: April 29, 1994    |
            +-----------------------------------------------+


Address for submission and any questions:
-----------------------------------------
  
  Toby Walsh
  IRST
  Loc. Pante di Povo
  I38100 Trento
  Italy
                 
  Phone:  (+39) 461 314359
  Fax:    (+39) 461 810851
  Email:  toby@irst.it

Program Committee:
-------------------
  Alan Bundy, Edinburgh
  Michael Rusionwitch, Nancy
  Toby Walsh, Trento


%%%%%%%%%%%%%%%%%%%%%% LaTeX Version %%%%%%%%%%%%%%%%%%%

\documentstyle[11pt]{article} 
\setlength{\oddsidemargin}{0cm}

\setlength{\oddsidemargin}{0cm}
\setlength{\evensidemargin}{0cm}
\setlength{\textwidth}{16cm}
\setlength{\topmargin}{0cm}
\setlength{\headsep}{0.0in}
\setlength{\textheight}{25cm}
\pagestyle{empty}

\setlength{\parindent}{0cm}

\begin{document}
\begin{center}
{\LARGE Call for Workshop Participation (CADE 12)}\\[3ex]
{\LARGE\bf Automation  of  Proof  by  Mathematical Induction} \\[3ex]
{\large \bf Nancy, France, Monday 27th June, 1994}
\end{center}
\bigskip

\parbox[t]{5.6cm}{
\setlength{\parskip}{0.5\baselineskip}
~ \\
{\bf Program Committee:}\\[2ex]
\begin{tabular}{ll}
Alan Bundy & Edinburgh \\
Michael Rusinowitch & Nancy \\
Toby Walsh & Trento
\end{tabular}
\bigskip

{\bf Submission Address:}\\[2ex]
\begin{tabular}{l}
Toby Walsh \\
IRST \\
Loc. Pante di Povo \\
I38100 Trento \\
Italy \\[2mm]
\hskip-0.5em\begin{tabular}[t]{ll}
Phone: & (+39)~461~314359 \\
Fax: &   (+39)~461~810851 \\
Email: & {\tt  toby@irst.it}
\end{tabular}\\
\end{tabular}
%
}
\hfill
\rule[-12cm]{.3mm}{12.5cm}
\hfill
\parbox[t]{8.5cm}{
\setlength{\parskip}{0.5\baselineskip}

Mathematical induction is required for reasoning about objects or
events containing repetition, e.g. computer programs with recursion or
iteration, electronic circuits with feedback loops or parameterised 
components. It is thus a vital ingredient in the development of formal
methods for the synthesis, verification and transformation of computer
software and hardware. There are also applications of mathematical
induction in the formation of plans containing repetition and in
explanation based learning of repetitive actions. Thus the automation
of inductive reasoning provides a major opportunity for the
application of AI techniques to design problems in computer science.

This workshop is the third in a series organised by the MInd and IndUS
consortia on the automation of proofs by mathematical induction. Previous
workshops were held in Albany (NY) in conjunction with CADE-11, and in
Washington (DC) in conjunction with AAAI-93. MInd is a European
consortium funded by ESPRIT and IndUS is a United States consortium
funded by NSF. The workshop is open to both members and non-members of
the MInd and IndUS consortia.}\\[2ex]


{\bf Topics of interest:} 
The aim of the workshop is to bring together all researchers
interested in automating inductive reasoning. Topics for discussion
may include, but are not limited to, the following:

%\begin{quote}
{\em \setlength{\tabcolsep}{2em}
\begin{tabular}{ll}
formalisms for inductive inference & 
explicit induction and inductive completion \\
architectures for inductive inference &
heuristics for controlling search \\
mechanisms for choosing induction rules & 
mechanisms for generalisation \\
mechanisms for suggesting lemmas & 
the productive use of failure \\
applications of inductive inference &
relationship between recursion and induction
\end{tabular}
}
%\end{quote}


You are invited to suggest other topics and possible speakers.

\medskip

{\bf Format of Workshop:} 
The workshop will consist of panel discussions and research
presentations. Each panel discussion will address a ``hot topic'' in 
inductive proof and will last approximately two hours. Two speakers, who
have made rival and significant contributions to these topics, will
each give a short introduction. The discussion will then be
thrown open to the floor. A combination of technical and
polemical contributions will be encouraged. So as to take
advantage of the most recent developments, we will leave the final
selection of ``hot topics'' until just before the workshop.
Selected participants will be invited to give short presentations of
their current research. Preference will be given to work that is
novel, promising and not already familiar to the other participants.

The workshop will be held in conjunction with CADE-12 (Twelth International
Conference on Automated Deduction). Attendence is by invitation only.
Registration will be via the standard CADE registration form.  Further
information about CADE-12 can be obtained by anonymous ftp from  
{\tt dream.dai.ed.ac.uk} (192.41.104.168), directory {\tt /pub/cade-12}.


\medskip

{\bf Submission:}
Persons wishing to attend the workshop should submit three copies of a
1 page summary of research in this area along with a postal address, phone 
number and an electronic mail address (if possible). Applications should be 
sent to Toby Walsh at the address listed above to arrive by {\bf Friday
15th April 1994}.  As postal services can be slow, we
welcome electronic submissions, preferably in LaTeX or plain text
format. All electronic submissions will be acknowledged on receipt
(though submissions received before April 1st will not be acknowledged
till after April 1st). The research summaries will be circulated to
workshop participants. You will be notified of acceptance by {\bf
Friday 29th April, 1994} at the latest.

\end{document}


%%%%%%%% End LaTeX Version %%%%%%%%%%%%%%%%


From rodmoten@cs.cornell.edu (rodmoten@cs.cornell.edu)  Mon Feb  7 11:03:53 1994
Return-Path: <rodmoten@cs.cornell.edu>
Received: from thialfi.cs.cornell.edu by cli.com (4.1/SMI-4.1)
	id AA18602; Mon, 7 Feb 94 11:03:53 CST
Received: from CLOYD.CS.CORNELL.EDU by thialfi.cs.cornell.edu (5.67/I-1.99E)
	id AA05651; Mon, 7 Feb 94 12:03:47 -0500
Received: from OTTAR.CS.CORNELL.EDU by cloyd.cs.cornell.edu (5.67/I-1.99D)
	id AA20114; Mon, 7 Feb 94 12:03:50 -0500
Message-Id: <9402071703.AA17817@ottar.cs.cornell.edu>
Received: by ottar.cs.cornell.edu (5.67/N-0.13)
	id AA17817; Mon, 7 Feb 94 12:03:44 -0500
To: nqthm-users-fab@cli.com
Subject: problem compiling nqthm
Date: Mon, 07 Feb 94 12:03:44 -0500
From: Roderick Moten <rodmoten@cs.cornell.edu>

While attempting to compile nqthm with Lucid Common Lisp 
on a Sun Sparc2 workstation, the following compilation error
occured.

;;; Reading source file "events.lisp"
>>Error: Function PACK declared to return at most 1 value

LAMBDA:
Original code: (LAMBDA (#:FORM #:ENVIRONMENT) (DECLARE (ARGLIST #)) (BLOCK DEFEVENT (LET* # #)))
   Required arg 0 (FORM): (DEFEVENT ADD-AXIOM (NAME TYPES TERM) (EVENT-COMMAND (LIST # NAME TYPES TERM) (LET # # # # # # NAME)))
   Required arg 1 (ENVIRONMENT): ((9))
:C  0: Return the values anyway
    1: Try compiling "events.lisp" again
:A  2: Abort to Lisp Top Level


Could anyone tell me how to fix this?

Please mail replies directly to me since I'm not on the mailing
list.

Thanks,

Rod

From kropf@ira.uka.de (kropf@ira.uka.de)  Mon Feb 14 03:54:09 1994
Return-Path: <kropf@ira.uka.de>
Received: from iraun1.ira.uka.de by cli.com (4.1/SMI-4.1)
	id AA02901; Mon, 14 Feb 94 03:54:09 CST
Received: from ira.uka.de by iraun1.ira.uka.de id <04118-0@iraun1.ira.uka.de>;
          Mon, 14 Feb 1994 10:47:50 +0100
Received: from ira.uka.de by i80fs2.ira.uka.de id <12298-0@i80fs2.ira.uka.de>;
          Mon, 14 Feb 1994 10:48:41 +0100
Date: Mon, 14 Feb 94 10:48:40 EST
From: "Thomas Kropf, Univ. Karlsruhe" <kropf@ira.uka.de>
Sender: ThomasKropf <kropf@ira.uka.de>
To: info-hol@cs.uidaho.edu, isabelle-users@cl.cam.ac.uk,
        theorem-provers@mc.lcs.mit.edu, lambda-usergroup@dcs.ed.ac.uk,
        fg121@inferenzsysteme.informatik.th-darmstadt.de,
        rewriting-list@lorraine.loria.fr,
        deduktion@intellektik.informatik.th-darmstadt.de
Cc: nqthm-users@cli.com
Subject: CFP: Theorem provers in Circuit Design: TPCD94 (Reminder)
Message-Id: <"i80fs2.ira.303:14.01.94.09.48.56"@ira.uka.de>

This is a reminder for TPCD94's deadline, which is in about 5 weeks
(25 March 1994). 

TPCD94 will take place the week after 

 - The 7th International Workshop on Higher Order Logic Theorem Proving 
   and its Applications (Malta, 19-22 September)

 - EURO-DAC '94 (Grenoble, France, 19 - 23 September) and

 - The 3rd International School and Symposium in Real Time and Fault
   Tolerant Systems (Luebeck, Germany, 19 -23 September)

hence especially for people from outside Europe there is the opportunity 
to conveniently combine TPCD94 with one of the above events.

My apologies to all those who are on more than one of the above mailing
lists and got multiple copies of this reminder.

  --Thomas Kropf-- 

          +-------------------------------------------------------+
          |                                                       |
          |                   CALL FOR PAPERS                     |
          |                                                       |
          |         Second International Conference on            |
          |                                                       |
          |         THEOREM PROVERS IN CIRCUIT DESIGN:            |
          |          Theory, Practice and Experience              |
          |                                                       |
          |        Bad Herrenalb (Blackforest), Germany           |
          |             26. - 29. September 1994                  |
          |                                                       |
          |         In cooperation with  IFIP WG 10.2             |
          |                                                       |
          +-------------------------------------------------------+

FOCUS AND OBJECTIVES

The use of formal methods in the design of digital systems is steadily
gaining popularity. The  practicability of such techniques, however,
depends on the support of appropriate mechanized verification tools.

This conference is a sequel to the one held at Nijmegen in June 1992
and provides a forum for discussing the role of theorem provers in the
design of digital systems. The objective is to cover all relevant aspects
of work in the field, i.e. verification, synthesis and testing, including
original research as well as case studies and other practical experi-
ments with new or established theorem proving tools, including tau-
tology and model checkers.

The primary focus will be on the ways in which formal methods can
be incorporated into hardware design tools and hardware design me-
thodologies, rather than the theory underlying the theorem provers.

Topics of interest include the philosophy behind the incorporation of
formal techniques in design tools, hardware specification languages,
the design and development and evaluation of formally-based  tools,
and the integration of formally based design and verification with exi-
sting tools and methodologies.

The intended audience includes workers in the field of hardware ve-
rification as well as practising digital designers with little or no prior
knowledge in formal methods.

SUBMITTING A PAPER

Five copies of a complete paper (in English) should be sent to the Con-
ference Chair at the address given below to arrive no later than 25
March 1994.  Electronic mail submissions in a postscript format are
also acceptable. Papers must not exceed 6000 words in length, with
full-page figures counted as 300 words.  Each paper should include a
300 word abstract. All papers will be refereed and the final choice will
be made by the programme committee on the grounds of relevance,
significance, originality, correctness, clarity and the use of given
benchmark circuits (see below).

The conference proceedings will be published by a major publisher.

BENCHMARK CIRCUITS

A set of benchmarks has been provided by anonymous ftp
at goethe.ira.uka.de (129.13.18.22). The circuits as well as
detailed instructions on how to use them can be found in the directory
/pub/tpcd94/benchmarks.

All authors submitting a regular paper or a proposal for a tutorial are
strongly encouraged to make use of these circuits.

IMPORTANT DATES

The important dates are as follows:

25 March 1994:
	Final deadline for the submission of papers.
20 June 1994:
	Date for notification of acceptance.
8 July 1994:
	Final camera-ready copy due.
26-29 September 1994:
	Conference at Bad Herrenalb.

PROPOSALS FOR TUTORIALS

Proposals are solicited for tutorial presentations on relevant verifica-
tion tools and provers. The intention is that a tutorial will provide an
overview of the basic ideas behind the tool using a completely worked
out example, rather than a detailed instruction on how to use it, hence
the use of benchmark circuits is also suggested.  The tutorials should
include an assessment of strengths and weaknesses of the tools and
should concentrate on general issues such as security, robustness, the
degree of interaction required, the user interface, and the mathemati-
cal skill required of the user.

Proposals for tutorials should not exceed 6000 words in length and
should give a clear indication of the topic and structure of the presen-
tation. The proposals for tutorials will also undergo a review process
and it is proposed to have no more than 6 tutorials during the confe-
rence. Also welcome are proposals for demonstrations of working sy-
stems. Proposals for both tutorials and demonstrations should be sent
to the Tutorials Chair to arrive no later than 25 March 1994. The tuto-
rial papers will also be included in the proceedings.

PROGRAMME

The conference programme will start with a day of tutorials and is fol-
lowed by three days of presentations by contributing authors. The late
afternoon sessions will be reserved for demonstrations. The program-
me will also include invited lectures by prominent researchers in the
field of machine-assisted verification. The names of the invited spea-
kers will be announced in due course.

ORGANIZATION

The conference is organized jointly by the Forschungszentrum Infor-
matik (FZI), Karlsruhe and the Institute of Computer Design and
Fault Tolerance at the University of Karlsruhe, Germany.

The conference organizers are:

Conference Chair:
Ramayya Kumar, FZI Karlsruhe

Programme Chair:
Mike Fourman, Edinburgh University

Tutorials Chair and Benchmarks:
Thomas Kropf, University of Karlsruhe

Local Arrangements:
Hilke Kloss, FZI Karlsruhe

PROGRAMME COMMITTEE

Dominique Borrione (IMAG, France)
Holger Busch (Siemens AG, Germany)
Luc Claesen (IMEC, Belgium)
David Dill (Stanford University, USA)
Hans Eveking (Univ. of Frankfurt, Germany)
Simon Finn (AHL, UK)
Mike Gordon (University of Cambridge, UK)
Keith Hanna (University of Kent, UK)
Warren A. Hunt Jr. (CL Inc. USA)
Paul Loewenstein (SUN, USA)
Miriam Leeser (Cornell Univ., USA)
Tom Melham (University of Glasgow, UK)
Tobias Nipkow (TU Muenchen, Germany)
David Shepherd (Inmos, UK)
Joergen Staunstrup (Lyngby Univ., Denmark)
Victoria Stavridou (Univ. of London, UK)
Pasupati Subrahmanyam (ATT Bell Labs, USA)

ADDRESSES FOR CORRESPONDENCE

The papers and all general correspondence should, in the first in-
stance, be sent to the Conference Chair:

Ramayya Kumar

TPCD Conference Chair
Forschungszentrum Informatik
Department - ACID
Haid-und-Neu Strasse 10-14
76131 Karlsruhe, Germany
Tel: (+49) 721 9654-419
Fax: (+49) 721 9654-459
Email: kumar@fzi.de

Proposals for tutorials, demonstrations and everything related to the
benchmark circuits should be sent to the Tutorials Chair:

Thomas Kropf
TPCD Tutorials Chair
Universitaet Karlsruhe
Inst. f. Rechnerentwurf u. Fehlertoleranz
P.O. Box 6980
76128 Karlsruhe, Germany
Tel: (+49) 721 608-4220
Fax: (+49) 721 370 455
Email: kropf@ira.uka.de

All correspondence should include a return postal address and, if
possible, Fax and email address.

--
Thomas Kropf      Institut fuer Rechnerentwurf und Fehlertoleranz
Universitaet Karlsruhe, Kaiserstr. 12, D-76128 Karlsruhe, Germany
email: kropf@informatik@uni-karlsruhe.de     FAX: +49 721 370 455
Tel.: +49 721 608 4220



From wilhelm@rpal.rockwell.com (wilhelm@rpal.rockwell.com)  Sat Feb 19 08:12:04 1994
Return-Path: <wilhelm@rpal.rockwell.com>
Received: from rpal.rockwell.com by cli.com (4.1/SMI-4.1)
	id AA09027; Sat, 19 Feb 94 08:12:04 CST
Received: by rpal.rockwell.com (4.1/rpal-4.1.0)
	id AA19517; Sat, 19 Feb 94 06:12:02 PST
Date: Sat, 19 Feb 94 06:12:02 PST
From: wilhelm@rpal.rockwell.com (Robert Wilhelm)
Message-Id: <9402191412.AA19517@rpal.rockwell.com>
To: nqthm-users@cli.com
Subject: DELETE ME
Reply-To: wilhelm@rpal.rockwell.com

 DELETE ME

thanks

From peter@informatik.uni-koblenz.de (peter@informatik.uni-koblenz.de)  Wed Feb 23 04:31:51 1994
Return-Path: <peter@informatik.uni-koblenz.de>
Received: from mailhost.uni-koblenz.de by cli.com (4.1/SMI-4.1)
	id AA02011; Wed, 23 Feb 94 04:31:51 CST
From: peter@informatik.uni-koblenz.de
Received: from bax.uni-koblenz.de by mailhost.uni-koblenz.de with smtp
	(Smail3.1.28.1) id m0pZGq2-0001TmC; Wed, 23 Feb 94 11:29 MET
Message-Id: <m0pZGq2-0001TmC@mailhost.uni-koblenz.de>
Received: by bax.uni-koblenz.de (4.1/KO-2.0)
	id AA01395; Wed, 23 Feb 94 11:31:33 +0100
Date: Wed, 23 Feb 94 11:31:33 +0100
To: fg121@inferenzsysteme.informatik.th-darmstadt.de,
        rewriting-list@lorraine.loria.fr, theorem-provers@mc.lcs.mit.edu,
        deduktion@intellektik.informatik.th-darmstadt.de,
        kgs@logic.tuwien.ac.at, aal@anu.edu.au, isabelle-users@cl.cam.ac.uk,
        info-hol@cs.uidaho.edu, nqthm-users@cli.com, howe@research.att.com,
        marek@ms.uky.edu, clp@cis.ohio-state.edu
Subject: CFP: CADE-12 Workshop `Theory Reasoning in Automated Deduction'

+---------------------------------------------------------------+
|								|
| 			2nd ANNOUNCEMENT			|
|								|
|          	Call  for  Workshop  Participation	        |
|						   		|
|						   		|
|           THEORY  REASONING  IN  AUTOMATED  DEDUCTION	   	|
|								|
|								|
|		held in conjunction with CADE-12		|
|								|
|                  Nancy, France, June 27, 1994		   	|
|								|
+---------------------------------------------------------------+


[ LaTeX version included below ]

Theory reasoning offers  the  possibility  of  combining  general
problem  solving  methods with specialized problem dependent rea-
soning systems.  A distinguished feature of theory reasoning sys-
tems is that the interface for the interaction of the two reason-
ing parts has to be designed very carefully.

Examples of such calculi are theory resolution, theory model  el-
imination,  and  constraint  resolution, where the combination of
the two reasoners is done on the literal or formula level. Anoth-
er  approach  offers  unification  based methods by integrating a
specialized theory reasoner at the term level.

Theory reasoning can also be seen as a framework for the integra-
tion  of  different reasoning paradigms.  The topic is of growing
interest and is an example of semantics-based  reasoning  as  op-
posed  to  purely syntactic reasoning.  Theory reasoning offers a
bridge from powerful knowledge representation  systems  to  effi-
cient theorem proving.


Topics of interest: 
--------------------
This workshop is intended to be quite broad; it should bring  to-
gether  interested researchers to exchange ideas, clarify notions
and point out new challenging research problems.  Papers are wel-
come  on all aspects of theory reasoning, including, but not lim-
ited to:

  o Applications of theory reasoning   o Implementation issues
  o Computational aspects              o Interface issues
  o Constraints                        o System descriptions
  o Hybrid systems                     o Theory reasoning calculi


Workshop: 
----------
The workshop is held in conjunction with CADE-12 (Twelth Interna-
tional  Conference on Automated Deduction).  Attendence is by in-
vitation only; authors of accepted papers will be  invited.   In-
formal  proceedings  containing  the accepted papers will be sup-
plied by the CADE organizing committee.  The registration will be
by  standard  CADE registration forms.  Further information about
CADE-12 can be obtained by anonymous ftp from  dream.dai.ed.ac.uk
(192.41.104.168), directory /pub/cade-12.


Submission: 
------------ 
Potential participants should apply by submitting an abstract  of
about  5  pages  to the address listed below. Please include your
postal address, phone number and e-mail address.  Although we ac-
cept hardcopies we strongly prefer e-mail submissions.  If possi-
ble, please send compressed and uuencoded .dvi or .ps-files.

Important dates:

            +-----------------------------------------------+
            | Submission deadline:  	  April  8, 1994    |
            | Notification of acceptance: April 29, 1994    |
            | Camera-ready copy due:      May   20, 1994    |
            +-----------------------------------------------+


Address for submission and further questions:
----------------------------------------------
  Ulrich Furbach   
  University of Koblenz
  Dept. of Computer Science
  Rheinau 1                
  56075 Koblenz            
  Germany                  
                           
  Phone:      +49 261 9119 433
  Fax:        +49 261 9119 499
  uli@informatik.uni-koblenz.de


Program Committee:
-------------------
  Peter Baumgartner              Germany
  Hans-J"urgen B"urckert         Germany
  Hubert Common                  France 
  Alan Frisch                    UK     
  Ulrich Furbach                 Germany
  Neil Murray                    USA    
  Uwe Petermann                  Germany
  Mark Stickel                   USA    


%%%%%%%%%%%%%%%%%%%%%% LaTeX Version %%%%%%%%%%%%%%%%%%%

\documentstyle[11pt]{article} 
\setlength{\oddsidemargin}{0cm}
\setlength{\evensidemargin}{0cm}
\setlength{\textwidth}{16cm}
\setlength{\topmargin}{0cm}
\setlength{\headsep}{0.0in}
\setlength{\textheight}{25cm}
\pagestyle{empty}

\setlength{\parindent}{0cm}

\begin{document}
\begin{center}
{\LARGE Call for Workshop Participation (CADE 12)}\\[3ex]
{\LARGE\bf Theory Reasoning in Automated Deduction} \\[3ex]
{\large \bf Nancy, France, June 27, 1994}
\end{center}
\bigskip

\parbox[t]{6.6cm}{
\setlength{\parskip}{0.5\baselineskip}
{\bf Program Committee:}\\[0.5ex]
\begin{tabular}{ll}
Peter~Baumgartner & Germany\\
Hans-J{\"u}rgen~B{\"u}rckert & Germany\\
Hubert~Common & France\\ 
Alan~Frisch & UK\\	 
Ulrich~Furbach &  Germany\\
Neil~Murray & USA\\
Uwe~Petermann & Germany\\
Mark~Stickel & USA
\end{tabular}
\bigskip

{\bf Submission Address:}\\[0.5ex]
\begin{tabular}{l}
Ulrich~Furbach\\
University of Koblenz\\
Dept.\ of Computer Science\\
Rheinau 1\\
56075 Koblenz\\
Germany\\[2mm]
\hskip-0.5em\begin{tabular}[t]{ll}
Phone: & +49~261~9119~433\\
Fax: &  +49~261~9119~499\\
\multicolumn{2}{l}{\tt uli@informatik.uni-koblenz.de}
\end{tabular}\\
\end{tabular}
%
}
\hfill
\rule[-10cm]{.3mm}{10.5cm}
\hfill
\parbox[t]{8.5cm}{
\setlength{\parskip}{0.5\baselineskip}
{\bf Theory reasoning} offers the possibility of combining general
problem solving methods with specialized problem dependent reasoning
systems.  A distinguished feature of theory reasoning systems is that
the interface for the interaction of the two reasoning parts has to be
designed very carefully.

Examples of such calculi are theory resolution, theory model
elimination, and constraint resolution, where the combination of the
two reasoners is done on the literal or formula level. Another
approach offers unification based methods by integrating a specialized
theory reasoner at the term level.

Theory reasoning can also be seen as a framework for the integration
of different reasoning paradigms.  The topic is of growing interest
and is an example of semantics-based reasoning as opposed to purely
syntactic reasoning. Theory reasoning offers a bridge from powerful
knowledge representation systems to efficient theorem proving.
}\\[2ex]

{\bf Topics of interest:} This workshop is intended to be quite broad;
it should bring together interested researchers to exchange ideas,
clarify notions and point out new challenging research problems.
Papers are welcome on all aspects of theory reasoning, including, but
not limited to:
\begin{quote}
{\em \setlength{\tabcolsep}{2em}
\begin{tabular}{ll}
Applications of theory reasoning & Implementation issues\\
Computational aspects & Interface issues \\
Constraints   & System descriptions\\
Hybrid systems  & Theory reasoning calculi 
\end{tabular}
}
\end{quote}

{\bf Workshop:} 
The workshop is held in conjunction with CADE-12 (Twelth International
Conference on Automated Deduction). Attendence is by invitation only;
authors of accepted papers will be invited. Informal proceedings
containing the accepted papers will be supplied by the CADE organizing
committee.  The registration will be by standard CADE registration
forms.  Further information about CADE-12 can be obtained by anonymous
ftp from {\tt dream.dai.ed.ac.uk} (192.41.104.168), directory {\tt
/pub/cade-12}.
\medskip

{\bf Submission:} Potential participants should apply by submitting an
{\bf abstract} of about {\bf 5 pages} to the address listed above.
Please include your postal address, phone number and e-mail address.
Although we accept hardcopies we {\em strongly\/} prefer {\bf e-mail
  submissions}. If possible, please send {\em compressed\/} and {\em
  uuencoded\/} $\star$.dvi or $\star$.ps-files.  The {\bf deadline}
for the submission is {\bf April 8, 1994}.  {\bf Notification of
  acceptance} will be {\bf April 29, 1994}. {\bf Hardcopies} for the
workshop abstracts are due {\bf May 20, 1994}.
\end{document}



From kaufmann (kaufmann)  Thu Feb 24 11:15:39 1994
Return-Path: <kaufmann>
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA10348; Thu, 24 Feb 94 11:15:39 CST
From: kaufmann (Matt Kaufmann)
Received: by thunder (4.1) id AA19694; Thu, 24 Feb 94 11:15:31 CST
Date: Thu, 24 Feb 94 11:15:31 CST
Message-Id: <9402241715.AA19694@thunder>
To: theorem-provers@mc.lcs.mit.edu, qed@mcs.anl.gov, mind@aisb.ed.ac.uk,
        indus@herky.cs.uiowa.edu, nqthm-users@cli, info-hol@cs.uidaho.edu,
        isabelle-users@cl.cam.ac.uk, dreamers@aisb.ed.ac.uk, risks@csl.sri.com,
        cade-12@aisb.ed.ac.uk, basin@mpi-sb.mpg.de, fausto@irst.it,
        kaufmann@cli
Subject: **REVISION**:  workshop announcement

We have decided to extend the deadline for applications to participate
in the following workshop to Friday, March 25, in order to be more in
line with the other CADE-12 workshop deadlines.

		       CALL FOR WORKSHOP PARTICIPATION:
				       
		  Correctness and Metatheoretic Extensibility
			of Automated Reasoning Systems
				       
			         June 26, 1994
				 Nancy, France
				       
			   Held in conjunction with
				    CADE-12
	   (Twelfth International Conference on Automated Deduction)
				 Nancy, France

Please post/circulate.

This one-day workshop will center around three related themes: 

1) How can we guarantee that the formulas proved by theorem provers
   are actually theorems?
2) How can provers themselves be verified or built in some correct
   way?
3) How can theorem provers be soundly extended with new inference
   rules and procedures?
 
These themes are motivated by problems in applying computers to
machine checked mathematics, for example, formal proofs of program
correctness.  They are central issues in many applications, in
particular in constructing software and hardware which provably meet
formal specifications.

The first two themes will address the question of how we can trust the
system we are using and how we can apply formal methods to the
construction of such systems.  This is an important and difficult
question as modern theorem provers (e.g., Never, Nqthm, Nuprl, HOL)
are quite complex, but yet must be more or less trusted if we are to
trust the correctness of proofs built with them.  Little work has been
done in this area to date.  The problem area encompasses for example,
ways we can verify a system within itself, or bootstrapping complex
verified provers from simpler already trusted ones.  It also
encompasses the problem of building simple trusted proof-checkers.

The third theme is significant as it is desirable to extend provers
with the kinds of rules and procedures that humans have found
effective in constructing proofs.  Hence, some framework for
metatheoretic extensibility is desirable.  The primary traditional
solution to this problem is tactics, but they can be inflexible as
they must construct a justification using primitive inference rules.
Other approaches are the meta-functions of Boyer and Moore and the
work at Cornell (e.g., Constable, Howe, and others) in meta-theoretic
extensibility.

The structure of the workshop will be to alternate presentation of
current and past approaches to these questions with discussion and
comparison.  Of particular interest is work, both existing and
proposed, that has potential for realization in an implementation.

Potential participants should apply by submitting a short statement
that contains both an abstract of their work in this area that they
wish to present, if any, and a short description of their current
interests.  This should be sent by email to David Basin,
basin@mpi-sb.mpg.de, before March 25th.  Include also your address,
email address, phone, and fax information.  Participant notification
will be sent out no later than April.  If there is sufficient
interest, an informal workshop proceedings may appear afterwards, in
which case participants will have a chance to revise their statements
for the proceedings.

Organizers: 
   David Basin,          MPI Saarbruecken, basin@mpi-sb.mpg.de
   Fausto Giunchiglia,   IRST and University of Trento, fausto@irst.it
   Matt Kaufmann,        Computational Logic, Inc., kaufmann@cli.com

Note:  The CADE-12 workshop schedule is tentative at this point,
although unlikely to change.  If the date were to change, it would be
1 day later (June 27, 1994).  A final announcement will be sent when
the date is finalized.


From taltakro@thor.ece.uc.edu (taltakro@thor.ece.uc.edu)  Mon Mar 21 11:40:40 1994
Return-Path: <taltakro@thor.ece.uc.edu>
Received: from thor.ece.uc.edu by cli.com (4.1/SMI-4.1)
	id AA16640; Mon, 21 Mar 94 11:40:40 CST
Received: from miles.ece.uc.edu (taltakro@miles.ece.uc.edu [129.137.8.146]) by thor.ece.uc.edu (8.6.8/8.6.6) with ESMTP id MAA24457 for <nqthm-users@cli.com>; Mon, 21 Mar 1994 12:40:34 -0500
From: Tareq Altakrouri <taltakro@thor.ece.uc.edu>
Received: from localhost (taltakro@localhost) by miles.ece.uc.edu (8.6.4/8.6.4) id MAA12892 for nqthm-users@cli.com; Mon, 21 Mar 1994 12:40:30 -0500
Message-Id: <199403211740.MAA12892@miles.ece.uc.edu>
Subject: Proving lemmas ...
To: nqthm-users@cli.com
Date: Mon, 21 Mar 1994 12:40:29 -0500 (EST)
X-Mailer: ELM [version 2.4 PL22]
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Content-Length: 843       


Hello everybody


Could anybody tell me if there is a difference for the theorem prover nqthm to 
prove a lemma in the following form :

   (prove-lemma fun1-lemma1 (rewrite)
       (implies (and (boolp p1)
                     (boolp p2)
                     (sizep x 16)
                     (sizep y 20))
                (equal (fun1 p1 p2 t x y)
                       (nat-to-bv 504 16))))

or the same lemma in this form :

   (prove-lemma fun1-lemma1 (rewrite)
       (equal (fun1 p1 p2 t x y)
              (nat-to-bv 504 16)))


which form is better to be used if the purpose is to use the lemma in the early
simplification process before going into the induction.  And to do so, do I 
have to use the "use" hint to specify the lemma name, and using the hint, do I
have to assign a term/value to each parameter?  

Thanks.

-Tareq



From young (young)  Mon Mar 21 12:01:08 1994
Return-Path: <young>
Received: from felix (felix.cli.com) by cli.com (4.1/SMI-4.1)
	id AA16759; Mon, 21 Mar 94 12:01:08 CST
From: young (Bill Young)
Received: by felix (4.1) id AA03972; Mon, 21 Mar 94 12:01:07 CST
Date: Mon, 21 Mar 94 12:01:07 CST
Message-Id: <9403211801.AA03972@felix>
To: taltakro@thor.ece.uc.edu
Cc: nqthm-users@cli
In-Reply-To: Tareq Altakrouri's message of Mon, 21 Mar 1994 12:40:29 -0500 (EST) <199403211740.MAA12892@miles.ece.uc.edu>
Subject: Proving lemmas ...


Eliminating unnecessary hyps is almost always desirable because the
lemma is more general and they don't contribute anything to the proof
and take some additional effort to relieve.  

However, I'm surprised the second form of your lemma is valid, since
there is no obvious relation between the left and right hand sides of
the conclusion.  If it is, it suggests that fun1 is merely a
complicated way to compute a constant (at least when it's 3rd
parameter is t).  Also, I presume the rhs is a constant so why not
just have the bit-vector constant there?

   (prove-lemma fun1-lemma1 (rewrite)
       (equal (fun1 p1 p2 t x y)
              (nat-to-bv 504 16)))


From young (young)  Tue Mar 22 10:13:10 1994
Return-Path: <young>
Received: from felix (felix.cli.com) by cli.com (4.1/SMI-4.1)
	id AA23415; Tue, 22 Mar 94 10:13:10 CST
From: young (Bill Young)
Received: by felix (4.1) id AA04052; Tue, 22 Mar 94 10:13:09 CST
Date: Tue, 22 Mar 94 10:13:09 CST
Message-Id: <9403221613.AA04052@felix>
To: nqthm-users
Subject: now that's persistence


I was in the middle of an interactive proof last evening.  I did a
bash and left.  It hadn't returned when I came in this morning.  Some
of the numbers are quite entertaining.  Does that mean it tried
rewriting RLESSP 1.7 billion times?  ...

RLESSP                   1761486292
RLESSP-STRICT            385582893
MEANS-RLEQ               299916131
TRANSITIVITY-OF-RLESSP2  248720477
TRANSITIVITY-OF-RLESSP4  192157030
ITIMES                   158041958
ILESSP                   157394285
NEGATIVEP-NUMERATOR-BETTER
                         112990523
TRANSITIVITY-OF-RLESSP3  101922910
INTEGERP                 82114726
NUMERATOR                79915089
RLESSP-NRATIONALP        78246576
RLESSP-RTIMES-0          78221951
CORRECTNESS-OF-CANCEL-RTIMES-RLESSP
                         77564372
CORRECTNESS-OF-CANCEL-RNEG-TERMS-FROM-INEQUALITY
                         77366325
RLESSP-REDUCE            77360016
ITIMES-IF                77287453
NUMERATOR-REDUCE         73141990
FIX-INT                  71690312
IQUO                     70946830


The 5 Most Persistent Primitive Names:

    name               persistence
IF                       1271025229
EQUAL                    381074110
OR                       306263576
AND                      158576385
NEGATIVEP                130995960

From moore (moore)  Tue Mar 22 11:36:16 1994
Return-Path: <moore>
Received: from rana (rana.cli.com) by cli.com (4.1/SMI-4.1)
	id AA23899; Tue, 22 Mar 94 11:36:16 CST
From: moore (J Strother Moore)
Received: by rana (4.1) id AA15596; Tue, 22 Mar 94 11:36:16 CST
Date: Tue, 22 Mar 94 11:36:16 CST
Message-Id: <9403221736.AA15596@rana>
To: young
Cc: nqthm-users
In-Reply-To: Bill Young's message of Tue, 22 Mar 94 10:13:09 CST <9403221613.AA04052@felix>
Subject: now that's persistence

The accumulated persistence is the number of rewrite frames built after the
indicated rule was begun.  In some sense, all the rules pushed onto the stack
after a given rule has been pushed were tried "because of" the given rule,
i.e., to relieve its hypotheses or rewrite its right-hand side.  But this
notion of "because of" is transitive, i.e., it is not "immediately because of".
Thus if rule FOO is used directly to relieve the hyp of BAR, and rule MUM is
used directly to relieve the hyp of FOO, then both FOO and MUM were used
"because of" BAR.  Thus, 1.7 billion rules were tried "because of" RLESSP.

A friend at SRI, Mike Green, once characterized Nqthm as "hopelessly optimistic".

J

From young (young)  Tue Mar 22 11:54:27 1994
Return-Path: <young>
Received: from felix (felix.cli.com) by cli.com (4.1/SMI-4.1)
	id AA23987; Tue, 22 Mar 94 11:54:27 CST
From: young (Bill Young)
Received: by felix (4.1) id AA04063; Tue, 22 Mar 94 11:54:26 CST
Date: Tue, 22 Mar 94 11:54:26 CST
Message-Id: <9403221754.AA04063@felix>
To: kapur@cs.albany.edu
Cc: nqthm-users
In-Reply-To: Deepak Kapur's message of Tue, 22 Mar 1994 12:44:28 -0500 <199403221744.MAA11214@sutra.cs.albany.edu>
Subject: now that's persistence



  It will be useful to some of us who do not use NQTHM much
  to understand what these predicates and functions stand for.

  Regards,

  Deepak


The numbers were derived by running (accumulated-persistence) after
interrupting the rewriter.   This gives a listing of the most
"expensive" function symbols in the latest round of rewriting.

You've probably already seen J's response. 

  The accumulated persistence is the number of rewrite frames built
  after the indicated rule was begun.  In some sense, all the rules
  pushed onto the stack after a given rule has been pushed were tried
  "because of" the given rule, i.e., to relieve its hypotheses or
  rewrite its right-hand side.  But this notion of "because of" is
  transitive, i.e., it is not "immediately because of".  Thus if rule
  FOO is used directly to relieve the hyp of BAR, and rule MUM is used
  directly to relieve the hyp of FOO, then both FOO and MUM were used
  "because of" BAR.  Thus, 1.7 billion rules were tried "because of"
  RLESSP.

For some context, I'm operating with a rationals library constructed
by Matt Wilding.  He's well aware that this library is not well-tuned
and often leads to some incredibly convoluted rewriting strategies.
In this case, the number of rules and their interactions caused the
rewriter to go off for a really long time (18 hours) trying a bunch of
stuff that was ultimately unproductive. 

By the way, the goal in question was:

(IMPLIES (AND (INTEGERP Z)
              (ILESSP 0 V)
              (RLESSP (RATIONAL 0 1)
                      (RATIONAL Z V)))
         (NUMBERP Z))


From peter@informatik.uni-koblenz.de (peter@informatik.uni-koblenz.de)  Wed Mar 30 02:41:36 1994
Return-Path: <peter@informatik.uni-koblenz.de>
Received: from mailhost.uni-koblenz.de ([141.26.4.3]) by cli.com (4.1/SMI-4.1)
	id AA13007; Wed, 30 Mar 94 02:41:36 CST
From: peter@informatik.uni-koblenz.de
Received: from bax.uni-koblenz.de by mailhost.uni-koblenz.de with smtp
	(Smail3.1.28.1) id m0plvlJ-0001rMC; Wed, 30 Mar 94 09:36 MET
Message-Id: <m0plvlJ-0001rMC@mailhost.uni-koblenz.de>
Received: by bax.uni-koblenz.de (4.1/KO-2.0)
	id AA03210; Wed, 30 Mar 94 10:38:50 +0200
Date: Wed, 30 Mar 94 10:38:50 +0200
To: fg121@inferenzsysteme.informatik.th-darmstadt.de,
        rewriting-list@lorraine.loria.fr, theorem-provers@mc.lcs.mit.edu,
        deduktion@intellektik.informatik.th-darmstadt.de,
        adler@intellektik.informatik.th-darmstadt.de, kgs@logic.tuwien.ac.at,
        aal@anu.edu.au, isabelle-users@cl.cam.ac.uk, info-hol@cs.uidaho.edu,
        nqthm-users@cli.com, howe@research.att.com, clp@cis.ohio-state.edu
Subject: CFP (LAST): CADE Workshop `Theory Reasoning in Automated Deduction'

+---------------------------------------------------------------+
|								|
| 		    3rd (LAST) ANNOUNCEMENT			|
|								|
|          	Call  for  Workshop  Participation	        |
|						   		|
|						   		|
|           THEORY  REASONING  IN  AUTOMATED  DEDUCTION	   	|
|								|
|								|
|		held in conjunction with CADE-12		|
|								|
|                  Nancy, France, June 27, 1994		   	|
|								|
+---------------------------------------------------------------+

[ LaTeX version included below ]

Theory reasoning offers  the  possibility  of  combining  general
problem  solving  methods with specialized problem dependent rea-
soning systems.  A distinguished feature of theory reasoning sys-
tems is that the interface for the interaction of the two reason-
ing parts has to be designed very carefully.

Examples of such calculi are theory resolution, theory model  el-
imination,  and  constraint  resolution, where the combination of
the two reasoners is done on the literal or formula level. Anoth-
er  approach  offers  unification  based methods by integrating a
specialized theory reasoner at the term level.

Theory reasoning can also be seen as a framework for the integra-
tion  of  different reasoning paradigms.  The topic is of growing
interest and is an example of semantics-based  reasoning  as  op-
posed  to  purely syntactic reasoning.  Theory reasoning offers a
bridge from powerful knowledge representation  systems  to  effi-
cient theorem proving.


Topics of interest: 
--------------------
This workshop is intended to be quite broad; it should bring  to-
gether  interested researchers to exchange ideas, clarify notions
and point out new challenging research problems.  Papers are wel-
come  on all aspects of theory reasoning, including, but not lim-
ited to:

  o Applications of theory reasoning   o Implementation issues
  o Computational aspects              o Interface issues
  o Constraints                        o System descriptions
  o Hybrid systems                     o Theory reasoning calculi


Workshop: 
----------
The workshop is held in conjunction with CADE-12 (Twelth Interna-
tional  Conference on Automated Deduction).  Attendence is by in-
vitation only; authors of accepted papers will be  invited.   In-
formal  proceedings  containing  the accepted papers will be sup-
plied by the CADE organizing committee.  The registration will be
by  standard  CADE registration forms.  Further information about
CADE-12 can be obtained by anonymous ftp from  dream.dai.ed.ac.uk
(192.41.104.168), directory /pub/cade-12.


Submission: 
------------ 
Potential participants should apply by submitting an abstract  of
about  5  pages  to the address listed below. Please include your
postal address, phone number and e-mail address.  Although we ac-
cept hardcopies we strongly prefer e-mail submissions.  If possi-
ble, please send compressed and uuencoded .dvi or .ps-files.

Important dates:

            +-----------------------------------------------+
            | Submission deadline:  	  April  8, 1994    |
            | Notification of acceptance: April 29, 1994    |
            | Camera-ready copy due:      May   20, 1994    |
            +-----------------------------------------------+


Address for submission and further questions:
----------------------------------------------
  Ulrich Furbach   
  University of Koblenz
  Dept. of Computer Science
  Rheinau 1                
  56075 Koblenz            
  Germany                  
                           
  Phone:      +49 261 9119 433
  Fax:        +49 261 9119 499
  uli@informatik.uni-koblenz.de


Program Committee:
-------------------
  Peter Baumgartner              Germany
  Hans-J"urgen B"urckert         Germany
  Hubert Common                  France 
  Alan Frisch                    UK     
  Ulrich Furbach                 Germany
  Neil Murray                    USA    
  Uwe Petermann                  Germany
  Mark Stickel                   USA    


%%%%%%%%%%%%%%%%%%%%%% LaTeX Version %%%%%%%%%%%%%%%%%%%

\documentstyle[11pt]{article} 
\setlength{\oddsidemargin}{0cm}
\setlength{\evensidemargin}{0cm}
\setlength{\textwidth}{16cm}
\setlength{\topmargin}{0cm}
\setlength{\headsep}{0.0in}
\setlength{\textheight}{25cm}
\pagestyle{empty}

\setlength{\parindent}{0cm}

\begin{document}
\begin{center}
{\LARGE Call for Workshop Participation (CADE 12)}\\[3ex]
{\LARGE\bf Theory Reasoning in Automated Deduction} \\[3ex]
{\large \bf Nancy, France, June 27, 1994}
\end{center}
\bigskip

\parbox[t]{6.6cm}{
\setlength{\parskip}{0.5\baselineskip}
{\bf Program Committee:}\\[0.5ex]
\begin{tabular}{ll}
Peter~Baumgartner & Germany\\
Hans-J{\"u}rgen~B{\"u}rckert & Germany\\
Hubert~Common & France\\ 
Alan~Frisch & UK\\	 
Ulrich~Furbach &  Germany\\
Neil~Murray & USA\\
Uwe~Petermann & Germany\\
Mark~Stickel & USA
\end{tabular}
\bigskip

{\bf Submission Address:}\\[0.5ex]
\begin{tabular}{l}
Ulrich~Furbach\\
University of Koblenz\\
Dept.\ of Computer Science\\
Rheinau 1\\
56075 Koblenz\\
Germany\\[2mm]
\hskip-0.5em\begin{tabular}[t]{ll}
Phone: & +49~261~9119~433\\
Fax: &  +49~261~9119~499\\
\multicolumn{2}{l}{\tt uli@informatik.uni-koblenz.de}
\end{tabular}\\
\end{tabular}
%
}
\hfill
\rule[-10cm]{.3mm}{10.5cm}
\hfill
\parbox[t]{8.5cm}{
\setlength{\parskip}{0.5\baselineskip}
{\bf Theory reasoning} offers the possibility of combining general
problem solving methods with specialized problem dependent reasoning
systems.  A distinguished feature of theory reasoning systems is that
the interface for the interaction of the two reasoning parts has to be
designed very carefully.

Examples of such calculi are theory resolution, theory model
elimination, and constraint resolution, where the combination of the
two reasoners is done on the literal or formula level. Another
approach offers unification based methods by integrating a specialized
theory reasoner at the term level.

Theory reasoning can also be seen as a framework for the integration
of different reasoning paradigms.  The topic is of growing interest
and is an example of semantics-based reasoning as opposed to purely
syntactic reasoning. Theory reasoning offers a bridge from powerful
knowledge representation systems to efficient theorem proving.
}\\[2ex]

{\bf Topics of interest:} This workshop is intended to be quite broad;
it should bring together interested researchers to exchange ideas,
clarify notions and point out new challenging research problems.
Papers are welcome on all aspects of theory reasoning, including, but
not limited to:
\begin{quote}
{\em \setlength{\tabcolsep}{2em}
\begin{tabular}{ll}
Applications of theory reasoning & Implementation issues\\
Computational aspects & Interface issues \\
Constraints   & System descriptions\\
Hybrid systems  & Theory reasoning calculi 
\end{tabular}
}
\end{quote}

{\bf Workshop:} 
The workshop is held in conjunction with CADE-12 (Twelth International
Conference on Automated Deduction). Attendence is by invitation only;
authors of accepted papers will be invited. Informal proceedings
containing the accepted papers will be supplied by the CADE organizing
committee.  The registration will be by standard CADE registration
forms.  Further information about CADE-12 can be obtained by anonymous
ftp from {\tt dream.dai.ed.ac.uk} (192.41.104.168), directory {\tt
/pub/cade-12}.
\medskip

{\bf Submission:} Potential participants should apply by submitting an
{\bf abstract} of about {\bf 5 pages} to the address listed above.
Please include your postal address, phone number and e-mail address.
Although we accept hardcopies we {\em strongly\/} prefer {\bf e-mail
  submissions}. If possible, please send {\em compressed\/} and {\em
  uuencoded\/} $\star$.dvi or $\star$.ps-files.  The {\bf deadline}
for the submission is {\bf April 8, 1994}.  {\bf Notification of
  acceptance} will be {\bf April 29, 1994}. {\bf Hardcopies} for the
workshop abstracts are due {\bf May 20, 1994}.
\end{document}


From walsh@lorraine.loria.fr (walsh@lorraine.loria.fr)  Wed Apr  6 03:26:16 1994
Return-Path: <walsh@lorraine.loria.fr>
Received: from lorraine.loria.fr by cli.com (4.1/SMI-4.1)
	id AA28135; Wed, 6 Apr 94 03:26:16 CDT
Received: from euler.loria.fr (euler.loria.fr [152.81.6.112]) by lorraine.loria.fr (8.6.5/8.6.5) with ESMTP id KAA00496; Wed, 6 Apr 1994 10:20:02 +0200
From: Toby Walsh <Toby.Walsh@loria.fr>
Received: from localhost (walsh@localhost) by euler.loria.fr (8.6.4/8.6.4) id KAA16290; Wed, 6 Apr 1994 10:20:45 +0200
Date: Wed, 6 Apr 1994 10:20:45 +0200
Message-Id: <199404060820.KAA16290@euler.loria.fr>
To: nqthm-users@cli.com, rewriting-list@poincare.loria.fr,
        theorem-provers@ai.mit.edu
Subject: 2nd and Final CFP: CADE-12 workshop on induction


+---------------------------------------------------------------+
|                                                               |
|                 Call  for  Participation                      |
|                                                               |
|                   CADE-12 Workshop on                         |
|                                                               |
|        Automation  of  Proof  by  Mathematical Induction      |
|                                                               |
|             Nancy, France, Monday 27th June, 1994             |
|                                                               |
+---------------------------------------------------------------+

Mathematical induction is required for reasoning about objects or
events containing repetition, e.g. computer programs with recursion or
iteration, electronic circuits with feedback loops or parameterised 
components. It is thus a vital ingredient in the development of formal
methods for the synthesis, verification and transformation of computer
software and hardware. There are also applications of mathematical
induction in the formation of plans containing repetition and in
explanation based learning of repetitive actions. Thus the automation
of inductive reasoning provides a major opportunity for the
application of AI techniques to design problems in computer science.

This workshop is the third in a series organised by the MInd and IndUS
consortia on the automation of proofs by mathematical induction. Previous
workshops were held in Albany (NY) in conjunction with CADE-11, and in
Washington (DC) in conjunction with AAAI-93. MInd is a European
consortium funded by ESPRIT and IndUS is a United States consortium
funded by NSF. The workshop is open to both members and non-members of
the MInd and IndUS consortia. 

Topics of interest: 
--------------------

The aim of the workshop is to bring together all researchers
interested in automating inductive reasoning. Topics for discussion
may include, but are not limited to, the following:

    o formalisms for inductive inference
    o explicit induction and inductive completion
    o architectures for inductive inference
    o heuristics for controlling inductive proof search
    o mechanisms for choosing induction rules
    o mechanisms for generalisation
    o mechanisms for suggesting lemmas
    o the productive use of failure
    o applications of inductive inference
    o the relationship between recursive programs and inductive
      proofs.

You are invited to suggest other topics and possible speakers.


Format of workshop:
-------------------

The workshop will consist of panel discussions and research
presentations. Each panel discussion will address a "hot topic" in 
inductive proof and will last approximately two hours. Two speakers, who
have made rival and significant contributions to these topics, will
each give a short introduction. The discussion will then be
thrown open to the floor. A combination of technical and
polemical contributions will be encouraged. So as to take
advantage of the most recent developments, we will leave the final
selection of "hot topics" until just before the workshop.
Selected participants will be invited to give short presentations of
their current research. Preference will be given to work that is
novel, promising and not already familiar to the other participants.

The workshop will be held in conjunction with CADE-12 (Twelth International
Conference on Automated Deduction). Attendence is by invitation only.
Registration will be via the standard CADE registration form.  Further
information about CADE-12 can be obtained by anonymous ftp from  
dream.dai.ed.ac.uk (192.41.104.168), directory /pub/cade-12.


Submission: 
------------ 
Persons wishing to attend the workshop should submit three copies of a
1 page summary of research in this area along with a postal address, phone 
number and an electronic mail address (if possible). Applications should be 
sent to Toby Walsh at the address below to arrive by Friday 15th April
1994. As postal services can be slow, we welcome electronic submissions, 
preferably in LaTeX or plain text format. All electronic submissions will
be acknowledged on receipt. The research summaries will 
be circulated to workshop participants.

Important dates:

            +-----------------------------------------------+
            | Submission deadline:        April 15, 1994    |
            | Notification of acceptance: April 29, 1994    |
            +-----------------------------------------------+


Address for submission and any questions:
-----------------------------------------
  
  Toby Walsh
  IRST
  Loc. Pante di Povo
  I38100 Trento
  Italy
                 
  Phone:  (+39) 461 314359
  Fax:    (+39) 461 810851
  Email:  toby@irst.it

Program Committee:
-------------------
  Alan Bundy, Edinburgh
  Michael Rusionwitch, Nancy
  Toby Walsh, Trento


%%%%%%%%%%%%%%%%%%%%%% LaTeX Version %%%%%%%%%%%%%%%%%%%

\documentstyle[11pt]{article} 
\setlength{\oddsidemargin}{0cm}

\setlength{\oddsidemargin}{0cm}
\setlength{\evensidemargin}{0cm}
\setlength{\textwidth}{16cm}
\setlength{\topmargin}{0cm}
\setlength{\headsep}{0.0in}
\setlength{\textheight}{25cm}
\pagestyle{empty}

\setlength{\parindent}{0cm}

\begin{document}
\begin{center}
{\LARGE Call for Workshop Participation (CADE 12)}\\[3ex]
{\LARGE\bf Automation  of  Proof  by  Mathematical Induction} \\[3ex]
{\large \bf Nancy, France, Monday 27th June, 1994}
\end{center}
\bigskip

\parbox[t]{5.6cm}{
\setlength{\parskip}{0.5\baselineskip}
~ \\
{\bf Program Committee:}\\[2ex]
\begin{tabular}{ll}
Alan Bundy & Edinburgh \\
Michael Rusinowitch & Nancy \\
Toby Walsh & Trento
\end{tabular}
\bigskip

{\bf Submission Address:}\\[2ex]
\begin{tabular}{l}
Toby Walsh \\
IRST \\
Loc. Pante di Povo \\
I38100 Trento \\
Italy \\[2mm]
\hskip-0.5em\begin{tabular}[t]{ll}
Phone: & (+39)~461~314359 \\
Fax: &   (+39)~461~810851 \\
Email: & {\tt  toby@irst.it}
\end{tabular}\\
\end{tabular}
%
}
\hfill
\rule[-12cm]{.3mm}{12.5cm}
\hfill
\parbox[t]{8.5cm}{
\setlength{\parskip}{0.5\baselineskip}

Mathematical induction is required for reasoning about objects or
events containing repetition, e.g. computer programs with recursion or
iteration, electronic circuits with feedback loops or parameterised 
components. It is thus a vital ingredient in the development of formal
methods for the synthesis, verification and transformation of computer
software and hardware. There are also applications of mathematical
induction in the formation of plans containing repetition and in
explanation based learning of repetitive actions. Thus the automation
of inductive reasoning provides a major opportunity for the
application of AI techniques to design problems in computer science.

This workshop is the third in a series organised by the MInd and IndUS
consortia on the automation of proofs by mathematical induction. Previous
workshops were held in Albany (NY) in conjunction with CADE-11, and in
Washington (DC) in conjunction with AAAI-93. MInd is a European
consortium funded by ESPRIT and IndUS is a United States consortium
funded by NSF. The workshop is open to both members and non-members of
the MInd and IndUS consortia.}\\[2ex]


{\bf Topics of interest:} 
The aim of the workshop is to bring together all researchers
interested in automating inductive reasoning. Topics for discussion
may include, but are not limited to, the following:

%\begin{quote}
{\em \setlength{\tabcolsep}{2em}
\begin{tabular}{ll}
formalisms for inductive inference & 
explicit induction and inductive completion \\
architectures for inductive inference &
heuristics for controlling search \\
mechanisms for choosing induction rules & 
mechanisms for generalisation \\
mechanisms for suggesting lemmas & 
the productive use of failure \\
applications of inductive inference &
relationship between recursion and induction
\end{tabular}
}
%\end{quote}


You are invited to suggest other topics and possible speakers.

\medskip

{\bf Format of Workshop:} 
The workshop will consist of panel discussions and research
presentations. Each panel discussion will address a ``hot topic'' in 
inductive proof and will last approximately two hours. Two speakers, who
have made rival and significant contributions to these topics, will
each give a short introduction. The discussion will then be
thrown open to the floor. A combination of technical and
polemical contributions will be encouraged. So as to take
advantage of the most recent developments, we will leave the final
selection of ``hot topics'' until just before the workshop.
Selected participants will be invited to give short presentations of
their current research. Preference will be given to work that is
novel, promising and not already familiar to the other participants.

The workshop will be held in conjunction with CADE-12 (Twelth International
Conference on Automated Deduction). Attendence is by invitation only.
Registration will be via the standard CADE registration form.  Further
information about CADE-12 can be obtained by anonymous ftp from  
{\tt dream.dai.ed.ac.uk} (192.41.104.168), directory {\tt /pub/cade-12}.


\medskip

{\bf Submission:}
Persons wishing to attend the workshop should submit three copies of a
1 page summary of research in this area along with a postal address, phone 
number and an electronic mail address (if possible). Applications should be 
sent to Toby Walsh at the address listed above to arrive by {\bf Friday
15th April 1994}.  As postal services can be slow, we
welcome electronic submissions, preferably in LaTeX or plain text
format. All electronic submissions will be acknowledged on receipt.
The research summaries will be circulated to
workshop participants. You will be notified of acceptance by {\bf
Friday 29th April, 1994} at the latest.

\end{document}


%%%%%%%% End LaTeX Version %%%%%%%%%%%%%%%%


From felty@research.att.com  Mon Apr 11 11:25:36 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA00116; Mon, 11 Apr 94 11:25:36 CDT
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA03904; Wed, 6 Apr 94 19:03:01 CDT
Received: by ninet.research.att.com; Wed Apr  6 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0pohRR-0002ZRC@hunny.research.att.com>; Wed, 6 Apr 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0pohRL-0004fcC@lutece.research.att.com>; Wed, 6 Apr 94 19:55 EDT
Message-Id: <m0pohRL-0004fcC@lutece.research.att.com>
Date: Wed, 6 Apr 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: LICS'94 Program and Registration


[This announcement is being sent to email lists.  Our apologies for
multiple copies.]

                   LOGIC IN COMPUTER SCIENCE (LICS)
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

                   
             ADVANCE REGISTRATION AND PROGRAM INFORMATION
             ============================================

[This information is available on the world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]


CONFERENCE OFFICE. 
=================
Please address registration form and inquiries to

        LICS'94 Secretariat
        Claudie Thenault
        INRIA-Rocquencourt
        Relations Exterieures
        Domaine de Voluceau BP 105
        78153 Le Chesnay Cedex
        FRANCE
            Phone: 33 (1) 39 63 56 75
            Fax: 33 (1) 39 63 56 38
            E-mail: symposia@inria.fr 


REGISTRATION
============
The registration form should be sent to the conference
office. Registration without payment (or purchase order) enclosed will
not be considered.  For early registration, payment must be received
by June 5.  Fees will be returned in full for any written cancellation
received before June 24. No refund will be made after this date.

A table of registration fees can be found on the registration form.
The member rate applies to members of ACM, IEEE, EATCS and INRIA,
members of the organizing and program committees and authors of
accepted papers.  The student rate applies to full time students; a
copy of the registrant's 1993-94 student card should be included with
the registration form.

The registration fee includes conference participation, a copy of the
proceedings, coffee breaks and an invitation to the welcome reception.
There is a separate charge for the banquet.

Payment must be in French currency, and can be made by bank cheque,
postal cheque, or foreign draft made payable to "Agent Comptable de
l'INRIA", by bank transfer to Tresorerie Generale des
Yvelines, Versailles, account number 10071-78000-00044009 15389, by
postal transfer to CCP Paris---30041-00001-09099 45 B 020-31, or
by institutional purchase order.  We have applied for permission to
allow registration by credit card, and hope to have confirmation of
this possibility by May 1. Participants wishing to use this facility
should contact our office at that time, preferably by email addressed
to symposia@inria.fr.  Bank transfers should specify registrant's name
and "Conference reference LICS94".


ACCOMMODATION
=============
Reservations can be made through the Wagonlit Travel Agency.  The
accommodation form should be sent with deposit before June 1 to:

        Wagonlit Travel
        Departement Congres &  Evenements
        50 Rue de Londres
        75008 Paris
        FRANCE
            Tel: 33 (1) 44 90 33 10
            Fax: 33 (1) 44 90 33 15

There are two categories of hotels available, as well as inexpensive
student lodging (no age limit) in an international center in Clichy
(north Paris).  Paris is very popular in the summer, so reservations
should be made as soon as possible.

A deposit is compulsory for hotel reservations, and student lodging
must be entirely prepaid.  Payment must be in French currency, and can
be made by bank cheque, Eurocheque, or foreign draft made payable to
"Wagonlit Travel", by bank transfer to the account 00021935201/61
B.N.P. Paris Saint Lazare, bank code 30004, branch code 0819,
"Wagonlit Travel---code comptable 04/670", or by credit card.  Hotel
deposits will be forwarded to the hotel less 60FF for reservation
fees.  The participant's bank charges must be added to the amount
transferred.

For cancellations made before June 1, payments will be refunded less
60FF for fees; no refunds will be made after June 1.


LOCATION
========
The Conference is being hosted by the Conservatoire National des Arts
et Metiers (CNAM) and will be part of its Bicentennial celebration.
CNAM is a well-known engineering school where professionals are taught
by professionals.  It houses the famous Musee National Des Arts et
Techniques, and is located at 292 Rue Saint Martin in the old center
of Paris, on the right bank of the river Seine.  It is walking
distance from Les Halles, the Centre National d'Art et de Culture
Georges-Pompidou (Beaubourg), the Hotel de Ville (City Hall) and the
cathedral Notre-Dame de Paris.  The nearest Metro station is Arts et
Metiers.

Paris normally enjoys pleasant summer weather in early July.  Days are
warm, but nights may be cool.  For general information on Paris,
contact the Paris Tourist Information Office, 127 Champs Elysees,
75008 Paris, phone number 33 (1) 49 52 53 54.


RECEPTIONS
==========
A Welcome Reception will be held on Sunday evening (17:00-19:00) in a
gallery of CNAM.  The Conference Banquet will be held in the palace
housing the Senate, the upper chamber of the French Parliament.  The
palace was built in the beginning of the 17th century for Marie de
Medicis, widow of King Henry IV.  It is located in the well-known
Jardins du Luxembourg.  To reserve a place at the banquet, the
appropriate column on the registration form must be marked; a banquet
reservation on site will not be possible.


LOCAL ARRANGEMENTS
================== 
Lunches are at the participants' own expense.  Participants may eat in
cafes and restaurants in CNAM's vicinity.  Telephone messages will be
delivered to participants during breaks.  Access to email will be
possible from CNAM.

The organizers cannot be held liable to conference participants for
injury, damage or loss of their personal property. It is suggested
that participants make their own insurance arrangements.


REGISTRATION DESK
=================
A registration and information desk located at the conference site
will operate on Sunday, July 3, from 15:00 to 18:00, and on the
remaining conference days from 8:00 to 18:00.


TRAVEL
======
Paris has two airports, Roissy-Charles de Gaulle, 30km north of
Paris, and Orly, 20km south of Paris.  A frequent Air France bus
service goes from Roissy to Place Charles de Gaulle-Etoile or Porte
Maillot in central Paris (the cost is about 48FF); from Orly the bus
goes to Invalides and stops on demand at Montparnasse (32FF).  There
is also train service.  From Roissy, the RER B line goes to Gare du
Nord or Chatelet; from Orly, the Orlyval goes to Antony where there
is a connection to the RER B (32FF).  A taxi from Orly to central
Paris costs about 150FF; from Roissy, 200FF.

The Metro offers a convenient way to get around the city.  Each trip
(with unlimited transfers) costs one ticket.  Tickets can be bought
individually, but a carnet of 10 is more practical.  RER lines
to the suburbs connect with the Metro and cost more.  Both Metro
and RER tickets can be purchased from ticket booths or machines.

A 40-45% discount may be obtained from AIR INTER for French domestic
blue and white flights, depending on the days of departure.  A voucher
can be requested on the registration form.

Participants requiring a visa for entry into France are strongly
advised to make their application in their home countries at least two
months prior to departure date.


                     LICS'94 REGISTRATION FORM
                     *************************

Last Name __________________________________________________

First Name _________________________________________________

Affiliation ________________________________________________

Street Address _____________________________________________

     _______________________________________________________

City _______________________________________________________

State/Zip __________________________________________________

Country ____________________________________________________

Phone(s) ___________________________________________________

Fax ________________________________________________________

E-mail _____________________________________________________


REGISTRATION RATES.  The fees below are in French currency and include
18.6% VAT.  Please circle the applicable fees.

                through June 5    from June 6

Regular              2200           2600
Member               1700           2100
Student              1000           1200
Banquet               300            300

Total Fee ___________________________________________________

Rate justification __________________________________________

Full-time student at ________________________________________

I need an AIR INTER discount form:  Yes / No

Payment (circle one): Cheque (Bank/Foreign Draft)
                      / Purchase Order
                      / Bank Transfer (include copy)


                     LICS'94 ACCOMMODATION FORM
                     **************************
                     to be returned before Jun 1

Last Name __________________________________________________

First Name _________________________________________________

Company ____________________________________________________

Street Address _____________________________________________

     _______________________________________________________

City _______________________________________________________

State/Zip __________________________________________________

Country ____________________________________________________

Phone(s) ___________________________________________________

Fax ________________________________________________________

1A.  HOTEL.  Please reserve:

     *...twin bed room shared by 2 persons

     *...single room

     in a hotel of ________ stars, for ________ nights,

     from _________________ to _________________(a.m.).

     Average rates in French currency, per room and per night,
     room only, taxes and service included:

     Category         Single/Twin       Deposit

     2**                385/500           460

     3***               550/700           760

1B.  YOUTH HOSTEL.  Please reserve:

     *...bed in a twin bed room, bathroom and toilets outside the
     room, compulsory stay of 4 nights (July 3 to 7, 1994),
     continental breakfast included, full prepayment compulsory, fixed
     rate per person 4 nights: 600FF.

2.  PAYMENT.  Deposit/prepayment of ____________ FF

    Circle one:  Visa / Eurocard / Mastercard
                 / Cheque (Bank/Euro/Foreign Draft)
                 / Bank Transfer (include copy)

    Credit card # __________________________ Exp. __________

    Signature _____________________________ Date ___________


                            CONFERENCE PROGRAM
                            ******************

SUNDAY, July 3
==============

REGISTRATION                                            (15:00-18:00)

WELCOME RECEPTION                                       (17:00-19:00)


MONDAY, July 4
==============

REGISTRATION                                              (8:00-9:00)

OPENING ADDRESSES                                         (9:00-9:25)

INVITED LECTURE I                                        (9:25-10:25)
    Chair: Robert Constable (Cornell)
    Rod Burstall (Edinburgh), Lambda-terms, proofs and refinement


SESSION 1: FINITE MODEL THEORY                          (10:50-12:30)
    Chair: Daniel Leivant (Indiana)

10:50 McColm's Conjecture,
    Yuri Gurevich (Michigan), Neil Immerman (U Mass) & Saharon Shelah
    (Hebrew U & Rutgers)

11:15 The expressive power of finitely many generalized quantifiers,
    Anuj Dawar (Swansea) & Lauri Hella (Helsinki)

11:40 Generalized quantifiers for simple properties,
    Martin Otto (RWTH Aachen)

12:05 How to define a linear order on finite models,
    Lauri Hella (Helsinki), Phokion Kolaitis (UC Santa Cruz), & Kerkk
    Luosto (Helsinki)
              

LUNCH                                                   (12:30-14:00)

SESSION 2: CONCURRENCY                                  (14:00-15:15)
    Chair: Vaughan Pratt (Stanford)

14:00 Finitary fairness,
    Rajeev Alur (Bell Labs) & Thomas Henzinger (Cornell)

14:25 Bisimulation is not (first-order) equationally axiomatisable,
    Peter Sewell (Edinburgh)

14:50 Foundations of timed concurrent constraint programming,
    Vijay Saraswat (Xerox PARC), Radha Jagadeesan (Loyola) & Vineet
    Gupta (Stanford)
              

SESSION 3: SEMANTICS I                                  (15:40-16:55)
    Chair: Achim Jung (Darmstadt)

15:40 A fully abstract semantics for concurrent graph reduction,
    Alan Jeffrey (Sussex)

16:05 An axiomatization of computationally adequate domain-theoretic
    models of FPC,
    Marcelo Fiore & Gordon Plotkin (Edinburgh)

16:30 On strong stability and higher-order sequentiality,
    Loic Colson & Thomas Ehrhard (Marne-la-Vallee)


SESSION 4: DOMAIN THEORY                                (17:10-18:00)
    Chair: Carl Gunter (U Penn)

17:10 Linear types, approximation and topology,
    Michael Huth, Achim Jung & Klaus Keimel (Darmstadt)

17:35 Domain theory and integration,
    Abbas Edalat (Imperial Coll.)


BUSINESS MEETING                                              (20:00)


TUESDAY, July 5
===============

TUTORIAL I                                                (8:30-9:45)
    Chair: Moshe Vardi (Rice)
    Ed Clarke (CMU), Model Checking


SESSION 5: CONSTRAINTS                                  (10:00-10:50)
    Chair: Harald Ganzinger (MPI Saarbrucken)

10:00 Negative set constraints with equality: an easy proof of
    decidability,
    Witold Charatonik (Wroclaw) & Leszek Pacholski (Polish Academy of
    Sciences)

10:25 Systems of set constraints with negative constraints are
    NEXPTIME-complete,
    Kjartan Stefansson (Cornell)


SESSION 6: MODAL AND TEMPORAL LOGICS I                  (11:15-12:30)
    Chair: Dexter Kozen (Cornell)

11:15 A compositional proof system for the modal mu-calculus,
    Hendrik Reif Andersen (TU Denmark), Colin Stirling (Edinburgh) &
    Glynn Winskel (Aarhus)

11:40 On the parallel complexity of model-checking in the modal
    mu-calculus,
    Shipei Zhang, Oleg Sokolsky & Scott Smolka (SUNY Stony Brook)

12:05 Complexity transfer for modal logic,
    Edith Hemaspaandra (Le Moyne)


LUNCH                                                   (12:30-14:00)


SESSION 7: TYPES I                                      (14:00-15:15)
    Chair: Paris Kanellakis (Brown)

14:00 Typability and type-checking in the second-order lambda-calculus
    are equivalent and undecidable,
    J.B. Wells (Boston U)

14:25 Efficient inference of object types,
    Jens Palsberg (Northeastern)

14:50 Type inference and extensionality,
    Adolfo Piperno (Roma) & Simona Ronchi della Rocca (Torino)


SESSION 8: CONSTRUCTIVE MATHEMATICS                     (15:40-16:55)
    Chair: Daniel Leivant (Indiana)

15:40 A groupoid model refutes uniqueness of identity types,
    Martin Hofmann (Edinburgh) & Thomas Streicher (LMU Muenchen)

16:05 A non-elementary speed-up in proof length by structural clause
    form transformation,
    Matthias Baaz, Christian Fermueller & Alexander Leitsch (TU Wien)

16:30 Upper and lower bounds for tree-like cutting planes proofs,
    Russell Impagliazzo (UC San Diego), Toniann Pitassi (UC San Diego)
    & Alasdair Urquhart (Toronto)
              

SESSION 9: COMPLEXITY AND DATABASES                     (17:10-18:00)
    Chair: David McAllester (MIT)

17:10 The power of reflective relational machines,
    Serge Abiteboul (INRIA), Christos Papadimitriou (UC San Diego) &
    Victor Vianu (UC San Diego)

17:35 A syntactic characterization of NP-completeness,
    J. Antonio Medina & Neil Immerman (U Mass)


EVENING LECTURE                                         (19:30-20:30)
    Chair: Jean-Pierre Jouannaud (Paris Sud & CNRS)
    Corrado Boehm (Roma), An algebraic view of the lambda-calculus


WEDNESDAY, July 6
=================

TUTORIAL II                                               (8:30-9:45)
    Chair: Samson Abramsky (Imperial Coll.)
    Gerard Berry (CMA),
    The semantics of synchronous concurrent languages


SESSION 10:  LOGIC PROGRAMMING                          (10:00-10:50)
    Chair: Krzysztof Apt (CWI)

10:00 The declarative semantics of the Prolog selection rule,
    Robert Staerk (U Muenchen)

10:25 Semantics of meta-logic in an algebra of programs,
    Antonio Brogi & Franco Turini (Pisa)


SESSION 11: LINEAR LOGIC                                (11:15-12:30)
    Chair: Samson Abramsky (Imperial Coll.)

11:15 A multiple-conclusion meta-logic,
    Dale Miller (U Penn)

11:40 Proof search in first-order linear logic and other cut-free
    sequent calculi,
    Patrick Lincoln & N. Shankar (SRI)

12:05 Linear logic, totality and full completeness,
    Ralph Loader (Oxford)


LUNCH                                                   (12:30-14:00)


SESSION 12: TYPES II                                    (14:00-15:15)
    Chair: Frank Pfenning (CMU)

14:00 The emptiness problem for intersection types,
    Pawel Urzyczyn (Warsaw)

14:25 Subtyping and parametricity,
    Gordon Plotkin (Edinburgh), Martin Abadi (DEC SRC) & Luca Cardelli
    (DEC SRC)

14:50 On the Church-Rosser property for expressive type systems and
    its consequences for their metatheoretic study,
    Herman Geuvers (Nijmegen) & Benjamin Werner (Cornell & INRIA)


SESSION 13: SEMANTICS II                                (15:40-16:55)
    Chair: Prakash Panangaden (McGill)

15:40 A semantics of object types,
    Martin Abadi & Luca Cardelli (DEC SRC)

16:05 Passivity and independence,
    Uday Reddy (Illinois)

16:30 A general semantics for evaluation logic,
    Eugenio Moggi (Genova)


SESSION 14: CATEGORY THEORY                             (17:10-18:00)
    Chair: Glynn Winskel (Aarhus)

17:10 Reflexive graphs and parametric polymorphism,
    Edmund Robinson (Sussex) & Giuseppe Rosolini (Genova)

17:35 Categories, allegories and circuit design,
    Carolyn Brown (Sussex) & Graham Hutton (Chalmers)


BANQUET


THURSDAY, July 7
================

INVITED LECTURE II                                       (9:00-10:00)
    Chair: Gerard Huet (INRIA)
    Henk Barendregt (Nijmegen),
    Results and problems related to proof-checking


SESSION 15: REWRITING                                   (10:00-10:50)
    Chair: Jean-Pierre Jouannaud (Paris Sud & CNRS)

10:00 Rewrite techniques for transitive relations,
    Leo Bachmair & Harald Ganzinger, (Max-Planck-Institut)

10:25 Normalised rewriting and normalised completion,
   Claude Marche (CNRS & INRIA)


SESSION 16: LAMBDA-CALCULUS                             (11:15-12:30)
    Chair: Jean-Jacques Levy (INRIA)

11:15 Modularity of strong normalization and confluence in the
    algebraic lambda-cube,
    Franco Barbanera (Torino), Maribel Fernandez (Paris Sud & CNRS),
    & Herman Geuvers (Nijmegen)

11:40 Cyclic lambda graph rewriting
    Zena Ariola (U Oregon) & Jan Willem Klop (CWI)

12:05 Paths in the lambda-calculus,
    Andrea Asperti (Bologna), Vincent Danos (CNRS & Paris 7), Cosimo
    Laneve (INRIA & CMA), & Laurent Regnier (CNRS)
               

LUNCH                                                   (12:30-14:00)


SESSION 17: MODAL AND TEMPORAL LOGIC II                 (14:00-15:15)
    Chair: Colin Stirling (Edinburgh)

14:00 A trace based extension of linear time temporal logic,
    P.S. Thiagarajan (SPIC Madras)

14:25 Axioms for knowledge and time in distributed systems with
    perfect recall,
    Ron van der Meyden (NTT Tokyo)

14:50 Compositional verification of real-time systems,
    Edward Chang (Stanford), Zohar Manna (Stanford), & Amir Pnueli
    (Weizmann Institute)


SESSION 18: LOGIC IN ARTIFICIAL INTELLIGENCE            (15:40-16:55)
    Chair: Peter Schroeder-Heister (Tuebingen)

15:40 Logical bilattices and inconsistent data,
    Ofer Arieli & Arnon Avron (Tel Aviv)

16:05 A modal logic for subjective default reasoning,
    Shai Ben-David & Rachel Ben-Eliyahu (Technion)

16:30 Language completeness of the Lambek calculus,
    Mati Pentus (Moscow State)


SESSION 19: AUTOMATED DEDUCTION}                        (17:10-18:00)
    Chair: Gerard Huet (INRIA)

17:10 Rigid E-unifiability is NEXPTIME-complete,
    Jean Goubault (Bull)

17:35 Higher-order narrowing,
    Christian Prehofer (TU Muenchen)


END OF CONFERENCE



CONFERENCE ORGANIZATION
***********************

LICS General Chair: Robert L. Constable

1994 Conference Co-chairs: Gerard Huet & Jean-Pierre Jouannaud

1994 Program Chair: Samson Abramsky

Publicity Co-chairs: Amy Felty & Douglas Howe

1994 Local Arrangements: A. Theis-Viemont & C. Thenault

PROGRAM COMMITTEE:
==================
S. Abramsky, K. Apt, H. Ganzinger, C. Gunter, A. Jung, 
P. Kannelakis, D. Kozen, D. Leivant, J.-J. Levy, 
D. McAllester, P. Panangaden, F. Pfenning, V. Pratt, 
P. Schroeder-Heister, C. Stirling, G. Winskel.

ORGANIZING COMMITTEE:
=====================

M. Abadi, S. Abramsky, S. Artemov, A. Borodin, A. Bundy, S. Buss,
E. Clarke, R. Constable (Chair), A. Felty, U. Goltz, Y. Gurevich,
S. Hayashi, D. Howe, G. Huet, J.-P. Jouannaud, D. Kapur, C. Kirchner, 
P. Kolaitis, R. Kosaraju, D. Kozen, D. Leivant, A.R. Meyer, D. Miller,
J. Mitchell, Y. Moschovakis, M. Okada, P. Panangaden, A. Pitts,
G. Plotkin, J. Remmel, S. Ronchi della Rocca, G. Rozenberg, A. Scedrov, 
D. Scott, J. Tiuryn, M.Y. Vardi.

From Erica_Melis@LOAN1.SP.CS.CMU.EDU  Tue Apr 19 16:51:47 1994
Return-Path: <Erica_Melis@LOAN1.SP.CS.CMU.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA01224; Tue, 19 Apr 94 16:51:47 CDT
Received: from LOAN1.SP.CS.CMU.EDU by cli.com (4.1/SMI-4.1)
	id AA27100; Tue, 19 Apr 94 16:12:28 CDT
Received: from LOAN1.SP.CS.CMU.EDU by LOAN1.SP.CS.CMU.EDU id aa03063;
          19 Apr 94 17:12:20 EDT
To: nqthm-users@cli.com
Subject: challenge
Date: Tue, 19 Apr 94 17:11:28 -0400
Message-Id: <3059.766789888@LOAN1.SP.CS.CMU.EDU>
From: Erica_Melis@LOAN1.SP.CS.CMU.EDU

I'd be interested in a proof of the pumping lemma for regular
languages or/and a proof of the pumping lemma for context-free
languages by Nqthm. 
I made an analogy-driven proof and would like to compare the efforts.

ERICA

From gegundez@algebra.us.es  Tue May  3 15:48:48 1994
Return-Path: <gegundez@algebra.us.es>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA00130; Tue, 3 May 94 15:48:48 CDT
Received: from relay.rediris.es by cli.com (4.1/SMI-4.1)
	id AA19507; Tue, 3 May 94 12:34:29 CDT
Received: from rediris.es by relay.rediris.es (PMDF V4.2-14 #4193) id
 <01HBWVGTTCPC8WXWDO@relay.rediris.es>; Tue, 3 May 1994 18:54:05 GMT+1
X400-Received: by mta iris-dcp in /PRMD=iris/ADMD=mensatex/C=es/; Relayed; Tue,
 3 May 1994 18:53:15 UTC+0100
X400-Received: by /PRMD=iris/ADMD=mensatex/C=es/; Relayed; Tue,
 3 May 1994 18:53:33 UTC+0200
X400-Received: by /ADMD=mensatex/C=es/; Relayed; Tue,
 3 May 1994 18:53:20 UTC+0200
X400-Received: by /PRMD=iris/ADMD=mensatex/C=es/; Relayed; Tue,
 3 May 1994 18:51:53 UTC+0200
Date: Tue,  3 May 1994 18:51:53 UTC+0200
From: "M. E. Gegundez Arias" <gegundez@algebra.us.es>
Subject: NQTHM help needed.
To: theorem-provers@mc.lcs.mit.edu
Cc: nqthm-users@cli.com
Message-Id: <9405031651.AA02967@algebra.us.es>
Content-Identifier: NQTHM help ne...
X-Mailer: ELM [version 2.4 PL20]
Content-Type: text
Content-Transfer-Encoding: 7BIT
X400-Content-Type: P2-1984 (2)
X400-Mts-Identifier: 
 [/PRMD=iris/ADMD=mensatex/C=es/;<9405031651.AA02967@algebra.us.e]
X400-Originator: gegundez@algebra.us.es
X400-Recipients: non-disclosure:;
Content-Length: 993




       This is a question about NQTHM ppe function:

       When I apply 'ppe' to a defined function it works Ok, but
       it doesn't work as I would want when I apply it to an AXIOM
       or SHELLs or LEMMAs.


       For example:

       This is a function defined in BOOT-STRAP

       >(ppe 'times)
       
       (DEFN TIMES
             (I J)
             (IF (ZEROP I)
                 0
                 (PLUS J (TIMES (SUB1 I) J))))
       
       (***** TIMES is a satellite of
              (BOOT-STRAP NQTHM))
       NIL


       This is an lemma defined in BOOT-STRAP
       
       >(ppe 'sub1-add1)
       
       (***** SUB1-ADD1 is a satellite of
              (BOOT-STRAP NQTHM))
       NIL



       The question is:  
       
       Is there any function which works for AXIOMs and SHELLs like 
       'ppe' does for defined functions ?

       Any advice would be very wellcome.

       Thanks in advance.

       Please reply me via e-mail to gegundez@mizar.us.es


From kaufmann@cli.com  Fri May  6 12:03:33 1994
Return-Path: <kaufmann@cli.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA00391; Fri, 6 May 94 12:03:33 CDT
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA26306; Fri, 6 May 94 11:21:24 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder (4.1) id AA25886; Fri, 6 May 94 11:21:23 CDT
Date: Fri, 6 May 94 11:21:23 CDT
Message-Id: <9405061621.AA25886@thunder>
To: gegundez@algebra.us.es
Cc: nqthm-users@cli
In-Reply-To: <9405031651.AA02967@algebra.us.es> (gegundez@algebra.us.es)
Subject: Re: NQTHM help needed.

Regarding your question about the use of PPE in Nqthm:

I'm afraid that PPE doesn't work well for some of the built-in rules.  So, I've
written a little function for you, included below, that will print out all the
rewrite rules associated with a given event.  This will NOT print definitions
though -- but for that, PPE seems to work OK.

To invoke this function, type

(print-rewrite-rules)

if you want all rewrite rules present in the initial theory, and type

(print-rewrite-rules '<event>)

if you want all rewrite rules created by an event.  For example, after doing

(add-shell push
           empty-stack
           stackp
           ((top (one-of numberp) zero) (pop (one-of stackp) empty-stack)))

you can invoke

(print-rewrite-rules 'push)

to see all the rewrite rules created by this add-shell event.

Here is the function print-rewrite-rules.

(defun print-rewrite-rules (&optional event-name)
  (setq event-name (or event-name 'ground-zero))
  (iterate
   for x in (cons event-name (data-base 'satellites event-name))
   do (iterate
       for rule in (get x 'lemmas)
       do
       (format t "~&~s:~%" (access rewrite-rule name rule))
       (ppr (let ((hyps (access rewrite-rule hyps rule))
                  (concl (access rewrite-rule concl rule)))
              (untranslate
               (if hyps
                   (fcons-term* 'implies (conjoin hyps t) concl)
                 concl)))
            nil)
       (terpri nil)
       (terpri nil))))

If anyone out there wants other utilities like this, feel free to ask.

It may also help to know that the documentation for the Nqthm logic is in
Chapter 4 of "A Computational Logic Handbook".  A revised version of that
chapter is distributed in the doc subdirectory of the new release.

-- Matt Kaufmann

From taltakro@thor.ece.uc.edu  Sun May 15 11:13:31 1994
Return-Path: <taltakro@thor.ece.uc.edu>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA10304; Sun, 15 May 94 11:13:31 CDT
Received: from babbage.ece.uc.edu by cli.com (4.1/SMI-4.1)
	id AA10970; Sun, 15 May 94 10:40:42 CDT
Received: from thor.ece.uc.edu (root@thor.ece.uc.edu [129.137.8.118]) by babbage.ece.uc.edu (8.6.9/8.6.3) with ESMTP id LAA22830 for <nqthm-users@cli.com>; Sun, 15 May 1994 11:40:25 -0400
Received: from miles.ece.uc.edu (taltakro@miles.ece.uc.edu [129.137.8.146]) by thor.ece.uc.edu (8.6.9/8.6.6) with ESMTP id LAA15101 for <nqthm-users@cli.com>; Sun, 15 May 1994 11:40:23 -0400
From: Tareq Altakrouri <taltakro@thor.ece.uc.edu>
Received: from localhost (taltakro@localhost) by miles.ece.uc.edu (8.6.4/8.6.4) id LAA21767 for nqthm-users@cli.com; Sun, 15 May 1994 11:40:21 -0400
Message-Id: <199405151540.LAA21767@miles.ece.uc.edu>
Subject: FATAL ERROR ...
To: nqthm-users@cli.com
Date: Sun, 15 May 1994 11:40:18 -0400 (EDT)
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Content-Length: 873       

Hello,


While I was trying to prove some lemma that involves so many explicit values and
many recursive calls, I got this error :


"  FATAL ERROR:  SET-DIFF-N called with inappropriate arguments.


   Error: 
   Fast links are on: do (use-fast-links nil) for debugging
   Error signalled by SIMPLIFY-SENT.
   Broken at SIMPLIFY-SENT.  Type :H for Help.  "

Could somebody please explain what that error means, and help to solve the
problem if it is possible?!

I was trying to prove that the result of excuting a very huge function is equal
to the result of another (smaller) function.  The huge function has 31 formal
parameters, and everyone of them is updated at each recursive call.  I expect
that this function needs to do about 1100 recursive calls before terminates.

If any one would like to help, I'll glad to provid more information any time.

Thanks

-Tareq



From kaufmann@cli.com  Mon May 16 00:32:45 1994
Return-Path: <kaufmann@cli.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA10345; Mon, 16 May 94 00:32:45 CDT
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA11251; Sun, 15 May 94 23:58:51 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder (4.1) id AA01843; Sun, 15 May 94 23:58:51 CDT
Date: Sun, 15 May 94 23:58:51 CDT
Message-Id: <9405160458.AA01843@thunder>
To: taltakro@thor.ece.uc.edu
Cc: nqthm-users@cli
In-Reply-To: <199405151540.LAA21767@miles.ece.uc.edu> (message from Tareq Altakrouri on Sun, 15 May 1994 11:40:18 -0400 (EDT))
Subject: Re: FATAL ERROR ...

Regarding your question:

>> While I was trying to prove some lemma that involves so many explicit values and
>> many recursive calls, I got this error :
>> 
>> 
>> "  FATAL ERROR:  SET-DIFF-N called with inappropriate arguments.
>> .....

This message tends to appear when Nqthm has "run out" of variable names for
destructor elimination or generalization.  I think it's fair to say that very
few proofs have ever failed for this reason, that would have succeeded if there
were only more such names "available".  I believe that usually this message is
a sign that there is some kind of infinite loop in progress.  However, since
you have an unusual situation --

>> I was trying to prove that the result of excuting a very huge function is equal
>> to the result of another (smaller) function.  The huge function has 31 formal
>> parameters, and everyone of them is updated at each recursive call. ....

-- I'm not so sure that you're in a loop.  It might be useful for you to
consider how you can break up your specification into smaller pieces.  For
example, instead of

(defn big-f (x1 x2 x3 ... x31)
  (if (test ...)
      (.... (big-f (f1 x1 ... x31) (f2 x1 ... x31) ... (f31 x1 ... x31)))
    ...))

maybe you could use a form more like

(defn big-f (y1 y2 y3)
  (if (test ...)
      (.... (big-f (f1 y1 y2 y3) (f2 y1 y2 y3) (f3 y1 y2 y3)))
    ...))

where y1 represents (list x1 x2 ... x10), y2 represents (list x11 ... x20),
and y3 represents (list x21 ... x31).  Something like that, anyhow.

I don't have any general advice on how to avoid this "SET-DIFF-N" message,
except perhaps for the following very vague advice of an extremely general
nature, which might well not apply in your case.  My impression is that usually
the prover has gone into "extremely" nested generalization and/or elimination
by the time this "SET-DIFF-N" message occurs.  I tend to keep the prover "on a
short leash" so that I abort proofs long before that behavior ever occurs.
Often, if I inspect the output just before the first elimination or
generalization occurs, I can see how to formulate a useful rewrite rule that
would further "normalize" the expressions produced by simplification.  (I have
a documented "checkpoint" tool that helps to locate such goals; anyone reading
this is welcome to a copy.)  Then when I try the proof again, perhaps
elimination and generalization is avoided entirely, or at least the proof gets
"further along" so that I can see how to formulate additional useful rewrite
rules.

I wish I could be more specific, but using this (or any, I think) theorem
prover is still (in 1994) often a delicate process.  Chapter 13 of Boyer and
Moore's "A Computational Logic Handbook" (Academic Press, Boston, 1988) has
some useful hints on how to use Nqthm effectively.

-- Matt Kaufmann

From plaisted@mpi-sb.mpg.de  Wed May 18 05:07:49 1994
Return-Path: <plaisted@mpi-sb.mpg.de>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA10520; Wed, 18 May 94 05:07:49 CDT
Received: from mpi-sb.mpg.de by cli.com (4.1/SMI-4.1)
	id AA15359; Wed, 18 May 94 04:29:01 CDT
From: plaisted@mpi-sb.mpg.de (David Plaisted)
Organization: Max-Planck-Institut fuer Informatik
              D-66123 Saarbruecken, Germany
Received: from mpii02022 with SMTP
          by mpi-sb.mpg.de (5.65/MPISB-1.0/920920)
          id AA14311; Wed, 18 May 94 11:27:07 +0200
Date: Wed, 18 May 94 11:26:59 +0200
Message-Id: <9405180926.AA12345@mpii02022.ag2.mpi-sb.mpg.de>
Received: by mpii02022.ag2.mpi-sb.mpg.de; Wed, 18 May 94 11:26:59 +0200
To: aal@anu.edu.au, deduktion@intellektik.informatik.th-darmstadt.de,
        fg121@inferenzsysteme.informatik.th-darmstadt.de,
        info-hol@cs.uidaho.edu, kgs@csdec1.tuwien.ac.at, nqthm-users@cli.com,
        qed@mcs.anl.gov, rewriting-list@lorraine.loria.fr,
        theorem-provers@mc.lcs.mit.edu
Subject: CADE tutorial on model-directed theorem proving
Cc: plaisted@mpi-sb.mpg.de



		     Call for Participation

			CADE 12 Tutorial

      The Use of Semantics in a Herbrand-Based Proof Procedure

             Heng Chu, Shie-Jue Lee, and David Plaisted

             University of North Carolina at Chapel Hill
               National Sun Yat-Sen University, Taiwan
                         MPI fuer Informatik
                   Universitaet Kaiserslautern 

		       Monday, June 27, 1994
			   Nancy, France


        The clause linking method (CLIN), implemented by Shie-Jue Lee,
and its extension to semantics (CLIN-S), implemented by Heng Chu, are
refutational clause-form theorem provers for first-order logic.  These
methods work by enumerating instances of the input clauses and then
applying a propositional decision procedure similar to the Davis and
Putnam method.  Thus they go back in spirit to the early methods of
Davis, Gilmore and Prawitz.  These methods are an attempt to eliminate
some of the propositional inefficiencies in resolution and other
common theorem proving strategies.  CLIN-S has the additional interest
that it makes use of nontrivial structures, or semantics, to guide the
search.  It demonstrates unsatisfiability by the failure of a
persistent attempt to construct a model of the input clauses.

        These provers have obtained proofs in a number of areas with
little guidance, including propositional calculus, logic puzzles,
simple set theory, temporal logic, and modal logic.  In addition,
CLIN-S has obtained automatic proofs of the intermediate value
theorem, am8, exq1, exq2, exq3, three of Bledsoe's limit theorems,
Andrew's challenge problem, Eder's problems, pelletier 38, and a
version of the unsolvability of the halting problem.  For these, no
switches were set, and the user only chooses a model, which is often a
trivial one.  Many of these problems are difficult for most other
provers without substantial guidance.

        CLIN-S is also interesting because of its combination of two
additional (incomplete) methods with semantic hyper-linking, which is
in itself complete.  One of them is a version of resolution designed
to eliminate large literals from proofs, and another is unit-resulting
(UR) resolution, which eliminates the Horn part of proofs.  What
remains is a proof with small literals and non-Horn clauses; clause
linking with semantics is particularly effective on such problems.  In
addition, this prover uses decision procedures, not to test for
validity, but to test if a clause is satisfied by the user-specified
structure.


        David Plaisted will give an introductory lecture, Shie-Jue Lee
will discuss CLIN, and Heng Chu will discuss CLIN-S.  We will make
CLIN and CLIN-S available by anonymous ftp; user manuals will be
provided to participants in the tutorial and instruction on how to use
the provers will be given.


	Information about registration and accommodations is available
by anonymous ftp on the machine

			     ftp.loria.fr

in the directory

		    pub/loria/conferences/CADE-12

and e-mail queries may be directed to

			   cade-12@loria.fr



From chrisf@logic.tuwien.ac.at  Thu May 19 09:20:42 1994
Return-Path: <chrisf@logic.tuwien.ac.at>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA10621; Thu, 19 May 94 09:20:42 CDT
Received: from csdec1.tuwien.ac.at by cli.com (4.1/SMI-4.1)
	id AA17429; Thu, 19 May 94 08:42:05 CDT
Received: by csdec1.tuwien.ac.at (5.65/DEC-Ultrix/4.3)
	id AA26404; Thu, 19 May 1994 15:39:34 +0200
Message-Id: <9405191339.AA26404@csdec1.tuwien.ac.at>
To: aal@anu.edu.au, deduktion@intellektik.informatik.th-darmstadt.de,
        fg121@inferenzsysteme.informatik.th-darmstadt.de,
        info-hol@cs.uidaho.edu, kgs@logic.tuwien.ac.at, nqthm-users@cli.com,
        qed@mcs.anl.gov, rewriting-list@lorraine.loria.fr,
        theorem-provers@mc.lcs.mit.edu
Subject: CADE tutorial on resolution as decision method
Date: Thu, 19 May 94 15:39:34 +0200
From: chrisf@logic.tuwien.ac.at
X-Mts: smtp

CALL FOR PARTICIPATION:  

                         TUTORIAL

                 RESOLUTION DECISION METHODS

Speakers: C. Fermueller, A. Leitsch, T. Tammet, N. Zamov.
Time: June 26, 1994

CONTENT:

   It is a central problem of logic and computer science to determine
whether a formula in predicate logic is decidable. A thorough 
investigation of decidable classes can be found in the book of Dreben 
and Goldfarb; this approach, however, is model theoretic and does not 
provide feasible algorithms. We present a proof theoretic method, based 
on resolution refinements, to decide a wide range of clause classes. The 
central idea is to use complete resolution refinements and guarantee 
termination on decidable clause classes. Besides the applications to the 
decision problem resolution decision methods provide a tool for designing 
efficient general theorem provers for first order clause logic and 
methods for automated model building. Based on approaches of Joyner 
and of the Maslov school our approach is method oriented; that means we 
investigate several types of resolution refinements w.r.t. their 
potential of deciding clause classes. Recent work of this type has been 
summarized by the speakers mentioned above in [FLTZ93].
The presentation will (roughly) consists of three parts:

1. Hyperresolution as decision procedure.
2. Ordering resolution as decision procedure.
3. Finite model building based on resolution decision procedures.

AD 1.)
  We define the classes PVD, OCC1N (PVD is a strong generalization 
of DATALOG to non-Horn functional classes) and characterize termination 
of hyperresolution by abstract atom complexity measures. Moreover we 
indicate how termination sets of hyperresolution can be turned into 
representations of Herbrand models. In case of PVD and OCC1N these 
Herbrand models can be transformed into finite models by filtration.
The decision classes suggest a selection strategy for refinements 
resulting in a prover generator. Finally it is pointed out that 
significant speed-ups of ATP-programs may be achieved by selecting 
decision refinements as theorem provers.

AD 2.) 
  We present A-ordering, Pi-ordering and ordering methods without 
ground lifting. We introduce the concept of covering and weakly 
covering terms and show, how to obtain decidable classes properly 
containing the one-variable class; e.g. we show that the method of 
A-ordering combined with saturation yields a method to decide 
extensions of the initially-extended Skolem class. The saturation 
principle is shown to be of importance to decide the Bernays- 
Schoenfinkel class. It is demonstrated how Maslov's K-class (this 
class contains many of the well-known decidable classes) can be 
decided by a non-liftable ordering refinement.

AD 3.)
  We present a post-processing of termination sets (under ordering 
refinements) defined by decision procedures on the Ackermann- and 
monadic class resulting in representations of finite models. The 
method essentially consists in pruning term trees via ground rewrite 
rules and in applying narrowing. The method is purely syntactic and 
yields full interpretations of the function symbols over the domain 
of the finite model. This method has already been shown powerful in 
experiments with implementations.

[FLTZ93] C.Fermueller, A.Leitsch, T.Tammet, N.Zamov: Resolution 
  Methods for the Decision Problem, Lecture Notes in AI 679 (1993).

 

From kaufmann@cli.com  Thu May 19 11:06:33 1994
Return-Path: <kaufmann@cli.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA10633; Thu, 19 May 94 11:06:33 CDT
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA17587; Thu, 19 May 94 10:25:49 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder (4.1) id AA04880; Thu, 19 May 94 10:25:48 CDT
Date: Thu, 19 May 94 10:25:48 CDT
Message-Id: <9405191525.AA04880@thunder>
To: nqthm-users@cli
Subject: [gegundez@mizar.us.es: NQTHM help needed]

I'm forwarding this at the request of the author.

Return-Path: <gegundez@mizar.us.es>
X400-Received: by mta iris-dcp in /PRMD=iris/ADMD=mensatex/C=es/; Relayed; Wed,
 11 May 1994 13:22:02 UTC+0100
X400-Received: by /PRMD=iris/ADMD=mensatex/C=es/; Relayed; Wed,
 11 May 1994 13:21:46 UTC+0200
X400-Received: by /ADMD=mensatex/C=es/; Relayed; Wed,
 11 May 1994 13:21:25 UTC+0200
X400-Received: by /PRMD=iris/ADMD=mensatex/C=es/; Relayed; Wed,
 11 May 1994 13:21:29 UTC+0200
Date: Wed, 11 May 1994 13:21:29 UTC+0200
From: "M. E. Gegundez Arias" <gegundez@mizar.us.es>
Subject: NQTHM help needed
To: kaufmann@cli.com
Content-Identifier: NQTHM help ne...
X-Mailer: ELM [version 2.4 PL20]
Content-Type: text
Content-Transfer-Encoding: 7BIT
X400-Content-Type: P2-1984 (2)
X400-Mts-Identifier: 
 [/PRMD=iris/ADMD=mensatex/C=es/;<9405111121.AA19619@mizar.us.es>]
X400-Originator: gegundez@mizar.us.es
X400-Recipients: kaufmann@cli.com
Content-Length: 1852



    	I have modified your function with some cuts and now it works 
    on a global variable named   *M*LISTA-DE-SHELLS  (List of shells) 
    where it looks for the parameter lemma-name; to initialize 
    *M*LISTA-DE-SHELLS do:

   (setq *M*LISTA-DE-SHELLS '(ground-zero))

	If you want to append a new name of shell when you are defining 
    it, you can use the function M-ADD-SHELL in this way:

   (m-add-shell push
              empty-stack
              stackp
              ((top (one-of numberp) zero) (pop (one-of stackp) empty-stack)))


	To ask for a lemma definition do:


   (m-describe 'sub1-add1) or (m-describe 'plus) or (m-describe 'lemma-name)


	The two used functions are:


(defun M-DESCRIBE (lemma-name)
 (terpri nil)
 (setq *m*temp T)
 (if (null *m*temp) T  
   (iterate for Y in *M*LISTA-DE-SHELLS
     do (if (null *m*temp) (return T)
	  (iterate for x in (cons Y (data-base 'satellites Y))
	    do (if (null *m*temp) (return T)
		 (iterate for rule in (get x 'lemmas)
		   do (if (equal lemma-name (access rewrite-rule name rule))
			  (progn 
			    (setq *m*temp ()) 
			    (format t "~&~s:~%" (access rewrite-rule name rule))
			    (ppr (let ((hyps (access rewrite-rule hyps rule))
				       (concl (access rewrite-rule concl rule)))
				   (untranslate
				    (if hyps
				        (fcons-term* 'implies (conjoin hyps t) concl)
				      concl)))
		 		 nil)
			    (return))
		        ())))))))
 (if *m*temp (progn (format t "~& Using PPE function") 
 		    (terpri nil)
		    (ppe lemma-name)
		    (terpri nil)) 
	     T))


(defmacro M-ADD-SHELL (const base r ac-descriptors)
  (let ((a (setq *m*lista-de-shells (cons const *m*lista-de-shells))))
  `(add-shell ,const ,base ,r ,ac-descriptors)))



	Thank you for your function, it has been very useful for me.


	Manuel E. Gegundez Arias		gegundez@mizar.us.es



From weberwu@sun12.tfh-berlin.de  Fri May 27 03:17:59 1994
Return-Path: <weberwu@sun12.tfh-berlin.de>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11250; Fri, 27 May 94 03:17:59 CDT
Received: from sun12.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA03065; Fri, 27 May 94 02:34:51 CDT
Received: by sun12.tfh-berlin.de (4.1/SMI-4.1)
	id AA00636; Fri, 27 May 94 09:30:57 +0200
Date: Fri, 27 May 94 09:30:57 +0200
From: weberwu@sun12.tfh-berlin.de (Prof_Weber-Wulff)
Message-Id: <9405270730.AA00636@sun12.tfh-berlin.de>
To: nqthm-users@sun12.tfh-berlin.de

Change of address for NQTHM-users mailing list
----------------------------------------------

I'm going to risk moving the NQTHM-users mailing list to another
machine at a different college. I hope to have prepared everything, but Murphy
will see to there being something missing. I have put in a forward at
the old address so that it is still valid, but please post to the
following addresses in the future:

      nqthm-users@sun12.tfh-berlin.de          for posting to all members of the list
      nqthm-users-request@sun12.tfh-berlin.de  for administration questions

I can also be reached at my normal email address weberwu@tfh-berlin.de for any
further problems.

Gopher server for NQTHM documents
---------------------------------

Our college is building up a gopher server at the same site. I am 
considering putting in an NQTHM entry with information on obtaining
the prover, a bibliography in BibTeX format, the etudes and solutions,
and any other useful information. If you have something (paper, nice
proof, training materials, etc) you would like to add to the gopher,
please contact me at nqthm-users-request *NOT* at nqthm-users. When we
have the gopher built I will inform you how to point your local gophers
to the entry.

Debora Weber-Wulff
TFH Berlin


From shahbaz@iri02.tfh-berlin.de  Fri May 27 04:43:45 1994
Return-Path: <shahbaz@iri02.tfh-berlin.de>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11258; Fri, 27 May 94 04:43:45 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA03079; Fri, 27 May 94 04:02:00 CDT
Received: by iri02.tfh-berlin.de (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA18436; Fri, 27 May 94 10:59:41 +0100
Date: Fri, 27 May 94 10:59:41 +0100
From: shahbaz@iri02.tfh-berlin.de (Mahmood_Shahbaz(HRZ))
Message-Id: <9405270959.AA18436@iri02.tfh-berlin.de>
To: nqthm-users@tfh-berlin.de
Subject: TEST

bitte ignorieren, das ist nur ein Test

Address:    Technische Fachhochschule Berlin
            Haus Bauwesen/Rechenzentrum
            Luxemburger Str. 9  
            13353 Berlin          
                 
Phone  :    +49 30  4504 2004
Fax    :    +49-30  4504 2774
E-mail :    shahbaz@tfh-berlin.de


From weberwu@sun12.tfh-berlin.de  Fri May 27 05:04:07 1994
Return-Path: <weberwu@sun12.tfh-berlin.de>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11263; Fri, 27 May 94 05:04:07 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA03096; Fri, 27 May 94 04:22:33 CDT
Received: from sun12.tfh-berlin.de by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA18683; Fri, 27 May 94 11:21:29 +0100
Received: by sun12.tfh-berlin.de (4.1/SMI-4.1)
	id AA01503; Fri, 27 May 94 11:18:05 +0200
Date: Fri, 27 May 94 11:18:05 +0200
From: weberwu@sun12.tfh-berlin.de (Prof_Weber-Wulff)
Message-Id: <9405270918.AA01503@sun12.tfh-berlin.de>
To: nqthm-users@tfh-berlin.de

Change of address for NQTHM-users mailing list
----------------------------------------------

I'm going to risk moving the NQTHM-users mailing list to a machine at
a different college. I hope to have prepared everything, but Murphy
will see to there being something missing. I have put in a forward at
the old address so that it is still valid, but please post to the
following addresses in the future:

      nqthm-users@tfh-berlin.de          for posting to all members of the list
or    nqthm-users@cli.com                if you are in North America       
      nqthm-users-request@tfh-berlin.de  for administration questions

I can also be reached at my normal email address weberwu@tfh-berlin.de for any
further problems.

Gopher server for NQTHM documents
---------------------------------

Our college is building up a gopher server at the same site. I am 
considering putting in an NQTHM entry with information on obtaining
the prover, a bibliography in BibTeX format, the etudes and solutions,
and any other useful information. If you have something (paper, nice
proof, training materials, etc) you would like to add to the gopher,
please contact me at nqthm-users-request *NOT* at nqthm-users. When we
have the gopher built I will inform you how to point your local gophers
to the entry.

Debora Weber-Wulff
TFH Berlin



From felty@research.att.com  Mon May 30 19:38:07 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11652; Mon, 30 May 94 19:38:07 CDT
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA06554; Mon, 30 May 94 18:56:03 CDT
Received: by ninet.research.att.com; Mon May 30 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0q8HAw-0000HlC@hunny.research.att.com>; Mon, 30 May 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0q8HAp-0005fhC@lutece.research.att.com>; Mon, 30 May 94 19:55 EDT
Message-Id: <m0q8HAp-0005fhC@lutece.research.att.com>
Date: Mon, 30 May 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: Reminder: LICS'94 Registration


REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.


                      LOGIC IN COMPUTER SCIENCE                   
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM.  In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard.  If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.

Other forms of payment (as stated in the brochure, but with some
clarification) are as follows.  Payment must be in French currency.

1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.

2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]

3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.

4. Institutional Purchase Order.

[Complete program and registration information is available on the
 world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]

From felty@research.att.com  Mon May 30 20:15:34 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11685; Mon, 30 May 94 20:15:34 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06573; Mon, 30 May 94 19:38:09 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08134; Tue, 31 May 94 02:38:06 +0100
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA06554; Mon, 30 May 94 18:56:03 CDT
Received: by ninet.research.att.com; Mon May 30 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0q8HAw-0000HlC@hunny.research.att.com>; Mon, 30 May 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0q8HAp-0005fhC@lutece.research.att.com>; Mon, 30 May 94 19:55 EDT
Message-Id: <m0q8HAp-0005fhC@lutece.research.att.com>
Date: Mon, 30 May 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: Reminder: LICS'94 Registration


REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.


                      LOGIC IN COMPUTER SCIENCE                   
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM.  In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard.  If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.

Other forms of payment (as stated in the brochure, but with some
clarification) are as follows.  Payment must be in French currency.

1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.

2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]

3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.

4. Institutional Purchase Order.

[Complete program and registration information is available on the
 world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]


From felty@research.att.com  Mon May 30 20:51:54 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11689; Mon, 30 May 94 20:51:54 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06587; Mon, 30 May 94 20:15:37 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08250; Tue, 31 May 94 03:15:53 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06573; Mon, 30 May 94 19:38:09 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08134; Tue, 31 May 94 02:38:06 +0100
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA06554; Mon, 30 May 94 18:56:03 CDT
Received: by ninet.research.att.com; Mon May 30 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0q8HAw-0000HlC@hunny.research.att.com>; Mon, 30 May 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0q8HAp-0005fhC@lutece.research.att.com>; Mon, 30 May 94 19:55 EDT
Message-Id: <m0q8HAp-0005fhC@lutece.research.att.com>
Date: Mon, 30 May 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: Reminder: LICS'94 Registration


REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.


                      LOGIC IN COMPUTER SCIENCE                   
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM.  In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard.  If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.

Other forms of payment (as stated in the brochure, but with some
clarification) are as follows.  Payment must be in French currency.

1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.

2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]

3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.

4. Institutional Purchase Order.

[Complete program and registration information is available on the
 world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]



From felty@research.att.com  Mon May 30 21:32:25 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11712; Mon, 30 May 94 21:32:25 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06613; Mon, 30 May 94 20:51:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08332; Tue, 31 May 94 03:52:14 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06587; Mon, 30 May 94 20:15:37 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08250; Tue, 31 May 94 03:15:53 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06573; Mon, 30 May 94 19:38:09 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08134; Tue, 31 May 94 02:38:06 +0100
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA06554; Mon, 30 May 94 18:56:03 CDT
Received: by ninet.research.att.com; Mon May 30 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0q8HAw-0000HlC@hunny.research.att.com>; Mon, 30 May 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0q8HAp-0005fhC@lutece.research.att.com>; Mon, 30 May 94 19:55 EDT
Message-Id: <m0q8HAp-0005fhC@lutece.research.att.com>
Date: Mon, 30 May 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: Reminder: LICS'94 Registration


REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.


                      LOGIC IN COMPUTER SCIENCE                   
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM.  In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard.  If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.

Other forms of payment (as stated in the brochure, but with some
clarification) are as follows.  Payment must be in French currency.

1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.

2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]

3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.

4. Institutional Purchase Order.

[Complete program and registration information is available on the
 world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]




From felty@research.att.com  Mon May 30 22:12:38 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11729; Mon, 30 May 94 22:12:38 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06624; Mon, 30 May 94 21:32:27 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08467; Tue, 31 May 94 04:32:50 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06613; Mon, 30 May 94 20:51:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08332; Tue, 31 May 94 03:52:14 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06587; Mon, 30 May 94 20:15:37 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08250; Tue, 31 May 94 03:15:53 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06573; Mon, 30 May 94 19:38:09 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08134; Tue, 31 May 94 02:38:06 +0100
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA06554; Mon, 30 May 94 18:56:03 CDT
Received: by ninet.research.att.com; Mon May 30 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0q8HAw-0000HlC@hunny.research.att.com>; Mon, 30 May 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0q8HAp-0005fhC@lutece.research.att.com>; Mon, 30 May 94 19:55 EDT
Message-Id: <m0q8HAp-0005fhC@lutece.research.att.com>
Date: Mon, 30 May 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: Reminder: LICS'94 Registration


REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.


                      LOGIC IN COMPUTER SCIENCE                   
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM.  In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard.  If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.

Other forms of payment (as stated in the brochure, but with some
clarification) are as follows.  Payment must be in French currency.

1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.

2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]

3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.

4. Institutional Purchase Order.

[Complete program and registration information is available on the
 world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]





From felty@research.att.com  Mon May 30 22:52:01 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11733; Mon, 30 May 94 22:52:01 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06713; Mon, 30 May 94 22:12:40 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08595; Tue, 31 May 94 05:13:01 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06624; Mon, 30 May 94 21:32:27 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08467; Tue, 31 May 94 04:32:50 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06613; Mon, 30 May 94 20:51:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08332; Tue, 31 May 94 03:52:14 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06587; Mon, 30 May 94 20:15:37 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08250; Tue, 31 May 94 03:15:53 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06573; Mon, 30 May 94 19:38:09 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08134; Tue, 31 May 94 02:38:06 +0100
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA06554; Mon, 30 May 94 18:56:03 CDT
Received: by ninet.research.att.com; Mon May 30 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0q8HAw-0000HlC@hunny.research.att.com>; Mon, 30 May 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0q8HAp-0005fhC@lutece.research.att.com>; Mon, 30 May 94 19:55 EDT
Message-Id: <m0q8HAp-0005fhC@lutece.research.att.com>
Date: Mon, 30 May 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: Reminder: LICS'94 Registration


REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.


                      LOGIC IN COMPUTER SCIENCE                   
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM.  In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard.  If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.

Other forms of payment (as stated in the brochure, but with some
clarification) are as follows.  Payment must be in French currency.

1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.

2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]

3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.

4. Institutional Purchase Order.

[Complete program and registration information is available on the
 world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]






From felty@research.att.com  Mon May 30 23:33:03 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11738; Mon, 30 May 94 23:33:03 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06752; Mon, 30 May 94 22:52:02 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08685; Tue, 31 May 94 05:52:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06713; Mon, 30 May 94 22:12:40 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08595; Tue, 31 May 94 05:13:01 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06624; Mon, 30 May 94 21:32:27 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08467; Tue, 31 May 94 04:32:50 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06613; Mon, 30 May 94 20:51:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08332; Tue, 31 May 94 03:52:14 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06587; Mon, 30 May 94 20:15:37 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08250; Tue, 31 May 94 03:15:53 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06573; Mon, 30 May 94 19:38:09 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08134; Tue, 31 May 94 02:38:06 +0100
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA06554; Mon, 30 May 94 18:56:03 CDT
Received: by ninet.research.att.com; Mon May 30 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0q8HAw-0000HlC@hunny.research.att.com>; Mon, 30 May 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0q8HAp-0005fhC@lutece.research.att.com>; Mon, 30 May 94 19:55 EDT
Message-Id: <m0q8HAp-0005fhC@lutece.research.att.com>
Date: Mon, 30 May 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: Reminder: LICS'94 Registration


REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.


                      LOGIC IN COMPUTER SCIENCE                   
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM.  In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard.  If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.

Other forms of payment (as stated in the brochure, but with some
clarification) are as follows.  Payment must be in French currency.

1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.

2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]

3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.

4. Institutional Purchase Order.

[Complete program and registration information is available on the
 world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]







From timh@dcs.ed.ac.uk  Mon May 30 23:46:56 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11748; Mon, 30 May 94 23:46:56 CDT
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.

From clt@SAIL.Stanford.EDU  Tue May 31 00:13:00 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11753; Tue, 31 May 94 00:13:00 CDT
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list

From felty@research.att.com  Tue May 31 00:13:10 1994
Return-Path: <felty@research.att.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11757; Tue, 31 May 94 00:13:10 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06777; Mon, 30 May 94 23:33:05 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08818; Tue, 31 May 94 06:33:28 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06752; Mon, 30 May 94 22:52:02 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08685; Tue, 31 May 94 05:52:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06713; Mon, 30 May 94 22:12:40 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08595; Tue, 31 May 94 05:13:01 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06624; Mon, 30 May 94 21:32:27 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08467; Tue, 31 May 94 04:32:50 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06613; Mon, 30 May 94 20:51:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08332; Tue, 31 May 94 03:52:14 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06587; Mon, 30 May 94 20:15:37 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08250; Tue, 31 May 94 03:15:53 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06573; Mon, 30 May 94 19:38:09 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08134; Tue, 31 May 94 02:38:06 +0100
Received: from research.att.com (ninet.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA06554; Mon, 30 May 94 18:56:03 CDT
Received: by ninet.research.att.com; Mon May 30 19:55 EDT 1994
Received: by hunny.research.att.com (/\==/\ Smail3.1.25.1 #25.11)
	id <m0q8HAw-0000HlC@hunny.research.att.com>; Mon, 30 May 94 19:55 EDT
Received: by lutece.research.att.com (/\==/\ Smail3.1.25.1 #25.1)
	id <m0q8HAp-0005fhC@lutece.research.att.com>; Mon, 30 May 94 19:55 EDT
Message-Id: <m0q8HAp-0005fhC@lutece.research.att.com>
Date: Mon, 30 May 94 19:55 EDT
From: felty@research.att.com (Amy Felty)
To: nqthm-users@cli.com
Subject: Reminder: LICS'94 Registration


REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.


                      LOGIC IN COMPUTER SCIENCE                   
                   ********************************
                     Ninth Annual IEEE Symposium
                    July 3-7, 1994, Paris, France

NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM.  In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard.  If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.

Other forms of payment (as stated in the brochure, but with some
clarification) are as follows.  Payment must be in French currency.

1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.

2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]

3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.

4. Institutional Purchase Order.

[Complete program and registration information is available on the
 world-wide web at
        http://www.research.att.com/lics/
 Postscript, dvi, latex and plain text versions of the conference
 brochure are available via anonymous ftp from research.att.com in
 directory /dist/lics.]








From timh@dcs.ed.ac.uk  Tue May 31 00:31:40 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11761; Tue, 31 May 94 00:31:40 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.


From clt@SAIL.Stanford.EDU  Tue May 31 00:53:04 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11765; Tue, 31 May 94 00:53:04 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list


From timh@dcs.ed.ac.uk  Tue May 31 01:13:23 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11775; Tue, 31 May 94 01:13:23 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.



From clt@SAIL.Stanford.EDU  Tue May 31 01:33:59 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11779; Tue, 31 May 94 01:33:59 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07005; Tue, 31 May 94 00:53:07 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09077; Tue, 31 May 94 07:52:54 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list



From timh@dcs.ed.ac.uk  Tue May 31 01:59:40 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11785; Tue, 31 May 94 01:59:40 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.




From clt@SAIL.Stanford.EDU  Tue May 31 02:13:50 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11799; Tue, 31 May 94 02:13:50 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07017; Tue, 31 May 94 01:34:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09347; Tue, 31 May 94 08:33:55 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07005; Tue, 31 May 94 00:53:07 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09077; Tue, 31 May 94 07:52:54 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list




From timh@dcs.ed.ac.uk  Tue May 31 02:46:16 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11807; Tue, 31 May 94 02:46:16 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07026; Tue, 31 May 94 01:59:38 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09538; Tue, 31 May 94 08:58:31 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.





From clt@SAIL.Stanford.EDU  Tue May 31 03:00:03 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11817; Tue, 31 May 94 03:00:03 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07032; Tue, 31 May 94 02:13:53 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09719; Tue, 31 May 94 09:14:05 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07017; Tue, 31 May 94 01:34:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09347; Tue, 31 May 94 08:33:55 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07005; Tue, 31 May 94 00:53:07 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09077; Tue, 31 May 94 07:52:54 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list





From timh@dcs.ed.ac.uk  Tue May 31 03:37:20 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11827; Tue, 31 May 94 03:37:20 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07042; Tue, 31 May 94 02:47:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09940; Tue, 31 May 94 09:45:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07026; Tue, 31 May 94 01:59:38 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09538; Tue, 31 May 94 08:58:31 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.






From clt@SAIL.Stanford.EDU  Tue May 31 03:42:52 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11833; Tue, 31 May 94 03:42:52 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07047; Tue, 31 May 94 03:00:10 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10008; Tue, 31 May 94 09:56:59 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07032; Tue, 31 May 94 02:13:53 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09719; Tue, 31 May 94 09:14:05 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07017; Tue, 31 May 94 01:34:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09347; Tue, 31 May 94 08:33:55 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07005; Tue, 31 May 94 00:53:07 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09077; Tue, 31 May 94 07:52:54 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list






From timh@dcs.ed.ac.uk  Tue May 31 04:26:50 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11841; Tue, 31 May 94 04:26:50 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07068; Tue, 31 May 94 03:37:40 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10242; Tue, 31 May 94 10:36:44 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07042; Tue, 31 May 94 02:47:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09940; Tue, 31 May 94 09:45:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07026; Tue, 31 May 94 01:59:38 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09538; Tue, 31 May 94 08:58:31 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.







From clt@SAIL.Stanford.EDU  Tue May 31 04:26:53 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11842; Tue, 31 May 94 04:26:53 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07071; Tue, 31 May 94 03:42:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10290; Tue, 31 May 94 10:42:47 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07047; Tue, 31 May 94 03:00:10 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10008; Tue, 31 May 94 09:56:59 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07032; Tue, 31 May 94 02:13:53 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09719; Tue, 31 May 94 09:14:05 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07017; Tue, 31 May 94 01:34:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09347; Tue, 31 May 94 08:33:55 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07005; Tue, 31 May 94 00:53:07 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09077; Tue, 31 May 94 07:52:54 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list







From clt@SAIL.Stanford.EDU  Tue May 31 05:12:53 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11855; Tue, 31 May 94 05:12:53 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07087; Tue, 31 May 94 04:27:16 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10574; Tue, 31 May 94 11:25:30 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07071; Tue, 31 May 94 03:42:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10290; Tue, 31 May 94 10:42:47 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07047; Tue, 31 May 94 03:00:10 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10008; Tue, 31 May 94 09:56:59 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07032; Tue, 31 May 94 02:13:53 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09719; Tue, 31 May 94 09:14:05 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07017; Tue, 31 May 94 01:34:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09347; Tue, 31 May 94 08:33:55 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07005; Tue, 31 May 94 00:53:07 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09077; Tue, 31 May 94 07:52:54 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list








From timh@dcs.ed.ac.uk  Tue May 31 05:15:12 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11859; Tue, 31 May 94 05:15:12 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07088; Tue, 31 May 94 04:27:05 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10562; Tue, 31 May 94 11:24:23 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07068; Tue, 31 May 94 03:37:40 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10242; Tue, 31 May 94 10:36:44 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07042; Tue, 31 May 94 02:47:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09940; Tue, 31 May 94 09:45:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07026; Tue, 31 May 94 01:59:38 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09538; Tue, 31 May 94 08:58:31 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.








From timh@dcs.ed.ac.uk  Tue May 31 05:18:31 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11863; Tue, 31 May 94 05:18:31 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07089; Tue, 31 May 94 04:28:06 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	 id AA10242; Tue, 31 May 94 10:36:44 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07042; Tue, 31 May 94 02:47:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09940; Tue, 31 May 94 09:45:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07026; Tue, 31 May 94 01:59:38 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09538; Tue, 31 May 94 08:58:31 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.







From clt@SAIL.Stanford.EDU  Tue May 31 06:00:14 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11874; Tue, 31 May 94 06:00:14 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07108; Tue, 31 May 94 05:12:56 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10936; Tue, 31 May 94 12:13:09 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07087; Tue, 31 May 94 04:27:16 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10574; Tue, 31 May 94 11:25:30 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07071; Tue, 31 May 94 03:42:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10290; Tue, 31 May 94 10:42:47 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07047; Tue, 31 May 94 03:00:10 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10008; Tue, 31 May 94 09:56:59 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07032; Tue, 31 May 94 02:13:53 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09719; Tue, 31 May 94 09:14:05 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07017; Tue, 31 May 94 01:34:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09347; Tue, 31 May 94 08:33:55 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07005; Tue, 31 May 94 00:53:07 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09077; Tue, 31 May 94 07:52:54 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list









From timh@dcs.ed.ac.uk  Tue May 31 06:04:33 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11878; Tue, 31 May 94 06:04:33 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07114; Tue, 31 May 94 05:18:29 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10987; Tue, 31 May 94 12:18:28 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07089; Tue, 31 May 94 04:28:06 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	 id AA10242; Tue, 31 May 94 10:36:44 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07042; Tue, 31 May 94 02:47:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09940; Tue, 31 May 94 09:45:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07026; Tue, 31 May 94 01:59:38 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09538; Tue, 31 May 94 08:58:31 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.








From timh@dcs.ed.ac.uk  Tue May 31 06:05:44 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11882; Tue, 31 May 94 06:05:44 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07109; Tue, 31 May 94 05:15:22 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10960; Tue, 31 May 94 12:14:48 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07088; Tue, 31 May 94 04:27:05 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10562; Tue, 31 May 94 11:24:23 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07068; Tue, 31 May 94 03:37:40 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10242; Tue, 31 May 94 10:36:44 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07042; Tue, 31 May 94 02:47:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09940; Tue, 31 May 94 09:45:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07026; Tue, 31 May 94 01:59:38 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09538; Tue, 31 May 94 08:58:31 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.









From clt@SAIL.Stanford.EDU  Tue May 31 06:26:17 1994
Return-Path: <clt@SAIL.Stanford.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11886; Tue, 31 May 94 06:26:17 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07128; Tue, 31 May 94 05:40:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	 id AA10936; Tue, 31 May 94 12:13:09 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07087; Tue, 31 May 94 04:27:16 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10574; Tue, 31 May 94 11:25:30 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07071; Tue, 31 May 94 03:42:55 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10290; Tue, 31 May 94 10:42:47 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07047; Tue, 31 May 94 03:00:10 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10008; Tue, 31 May 94 09:56:59 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07032; Tue, 31 May 94 02:13:53 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09719; Tue, 31 May 94 09:14:05 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07017; Tue, 31 May 94 01:34:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09347; Tue, 31 May 94 08:33:55 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07005; Tue, 31 May 94 00:53:07 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09077; Tue, 31 May 94 07:52:54 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06977; Tue, 31 May 94 00:13:01 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08964; Tue, 31 May 94 07:13:23 +0100
Received: from SAIL.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA06776; Mon, 30 May 94 23:32:03 CDT
Received:  by SAIL.Stanford.EDU (5.57/25-eef) id AA02801; Mon, 30 May 94 21:31:44 -0700
Date: Mon, 30 May 94 21:31:44 -0700
From: Carolyn Talcott <clt@sail.stanford.edu>
Message-Id: <9405310431.AA02801@SAIL.Stanford.EDU>
To: timh@dcs.ed.ac.uk
Cc: felty@research.att.com, nqthm-users@cli.com
In-Reply-To: Tim Heap's message of Tue, 31 May 94 05:01:47 BST <4545.9405310401@fara.dcs.ed.ac.uk>
Subject: Reminder: LICS'94 Registration
Reply-To: clt@sail.stanford.edu

now my 7th -- no need to cc such messages to the entire list









From timh@dcs.ed.ac.uk  Tue May 31 07:09:44 1994
Return-Path: <timh@dcs.ed.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11902; Tue, 31 May 94 07:09:44 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07143; Tue, 31 May 94 06:04:50 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA11314; Tue, 31 May 94 13:03:36 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07114; Tue, 31 May 94 05:18:29 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA10987; Tue, 31 May 94 12:18:28 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07089; Tue, 31 May 94 04:28:06 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	 id AA10242; Tue, 31 May 94 10:36:44 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07042; Tue, 31 May 94 02:47:08 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09940; Tue, 31 May 94 09:45:17 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07026; Tue, 31 May 94 01:59:38 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09538; Tue, 31 May 94 08:58:31 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA07011; Tue, 31 May 94 01:13:26 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09213; Tue, 31 May 94 08:13:24 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06996; Tue, 31 May 94 00:31:42 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA09022; Tue, 31 May 94 07:32:03 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06836; Mon, 30 May 94 23:46:59 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA08857; Tue, 31 May 94 06:47:21 +0100
Received: from stroma.dcs.ed.ac.uk ([129.215.160.108]) by cli.com (4.1/SMI-4.1)
	id AA06760; Mon, 30 May 94 23:04:25 CDT
Received: from fara.dcs.ed.ac.uk by dcs.ed.ac.uk id aa15004; 31 May 94 5:01 BST
Date: Tue, 31 May 94 05:01:47 BST
Message-Id: <4545.9405310401@fara.dcs.ed.ac.uk>
From: Tim Heap <timh@dcs.ed.ac.uk>
Sender: timh@dcs.ed.ac.uk
To: felty@research.att.com
Cc: nqthm-users@cli.com
In-Reply-To: <m0q8HAp-0005fhC@lutece.research.att.com> (felty@research.att.com)
Subject: Reminder: LICS'94 Registration



   >Date: Mon, 30 May 94 19:55 EDT
   >From: Amy Felty <felty@research.att.com>
   >
   >
   >REMINDER:  THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
   >
   >
   >                      LOGIC IN COMPUTER SCIENCE                   
   >                   ********************************
   >                     Ninth Annual IEEE Symposium
   >                    July 3-7, 1994, Paris, France
   >
   >NOTE: Advance payment for registration by credit card is not possible.
   >However, it is possible to pay by credit card or cash in French Francs
   >on location at CNAM.  In order to get the early registration rate,
   >send the registration form so that it is received before June 6,
   >circle the reduced rate (and the banquet fee if you wish to attend the
   >banquet), and indicate that you will pay on site with cash or one of
   >the following authorized cards: Visa international, Eurocard,
   >MasterCard.  If you choose to pay by this method and are subsequently
   >unable to attend, you are requested to send mail to symposia@inria.fr.
   >
   >Other forms of payment (as stated in the brochure, but with some
   >clarification) are as follows.  Payment must be in French currency.
   >
   >1. Bank check (also called foreign draft in the US) or postal check
   >made payable to Agent Comptable de l'INRIA.
   >
   >2. Bank transfer.
   >Beneficiary: Agent Comptable de l'INRIA
   >Bank Name: Tresorierie Generale des Yvelines
   >Bank Address: Versailles
   >Bank Code: 10071
   >Branch Code: 78000
   >Account Number: 00044009 15389
   >Specify your name and "Conference reference LICS94"
   >[Note that the account number as stated in the brochure is divided
   >into bank code, branch code, and account number here.]
   >
   >3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
   >
   >4. Institutional Purchase Order.
   >
   >[Complete program and registration information is available on the
   > world-wide web at
   >        http://www.research.att.com/lics/
   > Postscript, dvi, latex and plain text versions of the conference
   > brochure are available via anonymous ftp from research.att.com in
   > directory /dist/lics.]
   >
   >
   >
   >
   >
   >

Hi. Thanks for the reminder, but as this is my sixth copy of the message
i don't think i'm likely to forget!
					;?>
	tim h.









From cday@tartarus.uwa.edu.au  Tue May 31 12:59:54 1994
Return-Path: <cday@tartarus.uwa.edu.au>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11952; Tue, 31 May 94 12:59:54 CDT
Received: from lethe.uwa.edu.au by cli.com (4.1/SMI-4.1)
	id AA07897; Tue, 31 May 94 12:03:45 CDT
Received: (cday@localhost) by lethe.uwa.edu.au (8.6.8/8.6.2) id BAA13838 for nqthm-users@cli.com; Wed, 1 Jun 1994 01:03:20 +0800
From: Craig Day <cday@tartarus.uwa.edu.au>
Message-Id: <199405311703.BAA13838@lethe.uwa.edu.au>
Subject: unsubscribe
To: nqthm-users@cli.com
Date: Wed, 1 Jun 1994 01:03:19 +0800 (WST)
X-Mailer: ELM [version 2.4 PL11]
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Content-Length: 12        

unsubscribe

From cday@tartarus.uwa.edu.au  Tue May 31 13:46:53 1994
Return-Path: <cday@tartarus.uwa.edu.au>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11964; Tue, 31 May 94 13:46:53 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA08050; Tue, 31 May 94 12:59:56 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA13830; Tue, 31 May 94 19:59:17 +0100
Received: from lethe.uwa.edu.au by cli.com (4.1/SMI-4.1)
	id AA07897; Tue, 31 May 94 12:03:45 CDT
Received: (cday@localhost) by lethe.uwa.edu.au (8.6.8/8.6.2) id BAA13838 for nqthm-users@cli.com; Wed, 1 Jun 1994 01:03:20 +0800
From: Craig Day <cday@tartarus.uwa.edu.au>
Message-Id: <199405311703.BAA13838@lethe.uwa.edu.au>
Subject: unsubscribe
To: nqthm-users@cli.com
Date: Wed, 1 Jun 1994 01:03:19 +0800 (WST)
X-Mailer: ELM [version 2.4 PL11]
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Content-Length: 12        

unsubscribe


From cday@tartarus.uwa.edu.au  Tue May 31 14:35:16 1994
Return-Path: <cday@tartarus.uwa.edu.au>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA11971; Tue, 31 May 94 14:35:16 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA08141; Tue, 31 May 94 13:46:54 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA14028; Tue, 31 May 94 20:46:23 +0100
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA08050; Tue, 31 May 94 12:59:56 CDT
Received: from cli.com by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA13830; Tue, 31 May 94 19:59:17 +0100
Received: from lethe.uwa.edu.au by cli.com (4.1/SMI-4.1)
	id AA07897; Tue, 31 May 94 12:03:45 CDT
Received: (cday@localhost) by lethe.uwa.edu.au (8.6.8/8.6.2) id BAA13838 for nqthm-users@cli.com; Wed, 1 Jun 1994 01:03:20 +0800
From: Craig Day <cday@tartarus.uwa.edu.au>
Message-Id: <199405311703.BAA13838@lethe.uwa.edu.au>
Subject: unsubscribe
To: nqthm-users@cli.com
Date: Wed, 1 Jun 1994 01:03:19 +0800 (WST)
X-Mailer: ELM [version 2.4 PL11]
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Content-Length: 12        

unsubscribe



From gegundez@algebra.us.es  Wed Jun 22 12:04:16 1994
Return-Path: <gegundez@algebra.us.es>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA01472; Wed, 22 Jun 94 12:04:16 CDT
Received: from iri02.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA27999; Wed, 22 Jun 94 11:34:19 CDT
Received: from ixgate01.dfnrelay.d400.de by iri02.tfh-berlin.de via SMTP (920330.SGI/920502.SGI)
	for nqthm-users-fab@cli.com id AA12772; Wed, 22 Jun 94 18:32:51 +0100
X400-Received: by mta d400relay in /PRMD=dfnrelay/ADMD=d400/C=de/; Relayed;
               Wed, 22 Jun 1994 18:32:22 +0200
X400-Received: by /PRMD=iris/ADMD=mensatex/C=es/; Relayed;
               Wed, 22 Jun 1994 18:24:13 +0200
X400-Received: by /ADMD=mensatex/C=es/; Relayed; Wed, 22 Jun 1994 18:23:56 +0200
X400-Received: by /PRMD=iris/ADMD=mensatex/C=es/; Relayed;
               Wed, 22 Jun 1994 18:20:11 +0200
Date: Wed, 22 Jun 1994 18:20:11 +0200
X400-Originator: gegundez@algebra.us.es
X400-Recipients: non-disclosure:;
X400-Mts-Identifier: [/PRMD=iris/ADMD=mensatex/C=es/;<9406221620.AA01552@algebra.us.e]
X400-Content-Type: P2-1984 (2)
Content-Identifier: TEST
Alternate-Recipient: Allowed
From: "M." "E." Gegundez Arias <gegundez@algebra.us.es>
Message-Id: <9406221620.AA01552@algebra.us.es>
To: nqthm-users@tfh-berlin.de (Non Receipt Notification Requested)
Subject: TEST
Content-Transfer-Encoding: 7BIT



	This is only a test.


	Manuel Emilio Gegundez Arias   gegundez@mizar.us.es


From kaufmann@cli.com  Thu Aug  4 16:34:48 1994
Return-Path: <kaufmann@cli.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA01170; Thu, 4 Aug 94 16:34:48 CDT
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA27307; Thu, 4 Aug 94 15:21:07 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder (4.1) id AA29678; Thu, 4 Aug 94 15:21:06 CDT
Date: Thu, 4 Aug 94 15:21:06 CDT
Message-Id: <9408042021.AA29678@thunder>
To: nqthm-users@cli.com
Cc: peck@frege.mrg.dist.unige.it
Subject: Volunteers solicited for Nqthm tutorial:  a draft coming soon...

Would anyone be interested in reading a draft of a tutorial paper on the use of
Nqthm?  PLEASE do not say "yes" just to be nice -- I think I can probably find
at least one volunteer who actually wants to read this.

If you might be interested, read on for more information.....

When I was in Italy last month, I spent two or three days doing an example in
Nqthm and keeping careful notes as I did it, as a way of teaching someone there
how to use Nqthm.  Actually, that person (Paolo Pecchiari) is doing his
dissertation on a topic that involves "explaining" the Nqthm simplifier, so he
knows more about parts of the Nqthm implementation than I do -- but he was
fairly new to actually using Nqthm, and he asked questions (and made
suggestions, too) as we did the exercise.  Anyhow, we agreed to write up the
result as a joint paper, to submit for publication in the Special Issue of the
JAR on ``Automation of Proof by Mathematical Induction.''  There will
*probably* be two versions of this paper:  one that's about 30 pages that we'll
submit to the JAR, and another (a tech report) that adds a 75-page (or so)
appendix explaining a lot of the details.

The due date for the JAR is August 25, and my co-author is currently modifying
the paper.  We expect to have something that's ready for proofreading by late
next week.  In order to meet the submission deadline, we'll need feedback
fairly quickly.  That's why I'm sending this note out now -- i.e., to give some
advance notice -- probably nearly a week in advance of when the draft will
become available by ftp.

Thank you!

-- Matt Kaufmann [and Paolo Pecchiari]


From bill@cs.man.ac.uk  Thu Aug 18 11:37:36 1994
Return-Path: <bill@cs.man.ac.uk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA00134; Thu, 18 Aug 94 11:37:36 CDT
Received: from m1.cs.man.ac.uk by cli.com (4.1/SMI-4.1)
	id AA26762; Thu, 18 Aug 94 09:15:24 CDT
Received: from r8k.cs.man.ac.uk by m1.cs.man.ac.uk (4.1/SMI-4.1:AL5l)
	id AA00423; Thu, 18 Aug 94 15:15:09 BST
Date: Thu, 18 Aug 94 15:15:03 BST
From: Bill Mitchell <bill@cs.man.ac.uk>
Message-Id: <9408181415.AA23387@r8k.cs.man.ac.uk>
To: nqthm-users@cli.com
Subject: irrelevant hypotheses

Would anyone out there please explain how elimination of irrelevance
works in the following example.

Whilst working through a small example nqthm-1992 generated the
following subgoal (in fact lots of subgoals just like this one). It is
not important what the following functions mean, just note that the
goal is of the form A => B and that V is present in A and not B.

(IMPLIES (AND (LITATOM X)
              (NOT (LITATOM V))
              (NOT (EQUAL (TT) V))
              (NOT (EQUAL (FF) V))
              (PEXPRP Y)
              (PEXPRP V))
         (PEXPRP (E-AND Y X)))

I had thought that the system would remove the irrelevant stuff
and try to prove

(IMPLIES (AND (LITATOM X)
              (PEXPRP Y))
         (PEXPRP (E-AND Y X)))

which would have been a trivial result. Instead it proved the original
subgoal by induction. 

Any help much appreciated

                                       | Bill Mitchell
			   ___         | Computer Science Department
			  /   )        | The University
			 /---<   o / / | Manchester M13 9PL
			/___ / _(_/_/  | England
				       |
				       | Janet: bill@cs.man.ac.uk
				       | tel:   (+44)61-275-6117

From kaufmann@cli.com  Thu Aug 18 11:39:39 1994
Return-Path: <kaufmann@cli.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA00138; Thu, 18 Aug 94 11:39:39 CDT
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA25714; Wed, 17 Aug 94 19:59:42 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder (4.1) id AA11630; Wed, 17 Aug 94 19:59:41 CDT
Date: Wed, 17 Aug 94 19:59:41 CDT
Message-Id: <9408180059.AA11630@thunder>
To: nqthm-users@cli
Cc: peck@frege.mrg.dist.unige.it
Subject: oh well....

Regarding the request I made earlier for volunteers to read a draft Nqthm
tutorial:  well, it was a bigger job than we thought, so we probably won't have
it ready till next week, and it will be too late for feedback then.  But we'll
announce it when it's ready!  Thanks --

-- Matt Kaufmann

From chou@CS.UCLA.EDU  Mon Aug 29 10:07:07 1994
Return-Path: <chou@CS.UCLA.EDU>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA00135; Mon, 29 Aug 94 10:07:07 CDT
Errors-To: sandel@CS.UCLA.EDU
Received: from maui.cs.ucla.edu by cli.com (4.1/SMI-4.1)
	id AA17619; Sun, 28 Aug 94 19:36:17 CDT
Errors-To: sandel@CS.UCLA.EDU
Received: from LocalHost.cs.ucla.edu by maui.cs.ucla.edu
	(Sendmail 4.1/3.26) id AA01472;
	Sun, 28 Aug 94 17:33:16 PDT
Message-Id: <9408290033.AA01472@maui.cs.ucla.edu>
To: coq@margaux.inria.fr, isabelle-users@cl.cam.ac.uk, podc@nova.bellcore.com,
        nqthm-users@cli.com, theorem-provers@mc.lcs.mit.edu,
        imps@linus.mitre.org
Subject: WANTED: Examples of correctness proofs of distributed algorithms
Date: Sun, 28 Aug 94 17:33:15 PDT
From: chou@CS.UCLA.EDU


I would like to collect examples of correctness proofs of
distributed algorithms.  In particular, I am interested in
proofs of "realistic" distributed algorithms, ie, NOT those
toy examples cooked up to demonstrate some proof techniques.

Please send your reply to: chou@cs.ucla.edu
I will post a summary.  Many, many thanks in advance!!!

Cheers,
Ching-Tsun Chou



From kaufmann@cli.com  Tue Aug 30 18:27:05 1994
Return-Path: <kaufmann@cli.com>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA00291; Tue, 30 Aug 94 18:27:05 CDT
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA22915; Tue, 30 Aug 94 17:43:01 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder (4.1) id AA18938; Tue, 30 Aug 94 17:41:36 CDT
Date: Tue, 30 Aug 94 17:41:36 CDT
Message-Id: <9408302241.AA18938@thunder>
To: nqthm-users@cli, induc@cs.uiowa.edu, mind@aisb.ed.ac.uk,
        theorem-provers@mc.lcs.mit.edu
Cc: peck@frege.mrg.dist.unige.it
Subject: Nqthm tutorial

Announcing the following tech report from Computational Logic, Inc. and IRST:

``Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the
Arithmetic-Geometric Mean Theorem''
  by
Matt Kaufmann
(Computational Logic, Inc., Austin, TX, USA)
  and
Paolo Pecchiari
(IRST - Povo, 38100 Trento, Italy and DIST - University of Genoa - Genoa, Italy)

An abstract appears at the end of this message.

To obtain a compressed postscript copy of this tech report from internet host
ftp.cli.com (Austin, TX, USA):

* ftp to ftp.cli.com (192.31.85.129)
* give the login name `anonymous'
* cd to pub/kaufmann/nqthm-tutorial
* give the command `binary'
* get report-100-tutorial.ps.Z

Contact elster@cli.com if you wish to order a hardcopy.  Note that in the same
directory there is also a shorter version of this paper, together with gzipped
versions of each.  This is explained in the README file in that directory.

The same technical report (except for minor packaging) will be available within
a couple of days from IRST (Povo, Italy) -- full version only.  Follow a
procedure similar to the one above:  ftp to ftp.mrg.dist.unige.it
(130.251.7.2), give the login name 'anonymous' and your e-mail address as the
password, then change directory to /pub/mrg-ftp and get the file 9409-01.ps.Z
after invoking `binary'.

ABSTRACT

There are many papers describing problems solved using the Boyer-Moore
theorem prover, as well as papers describing new tools and
functionalities added to it.  Unfortunately, so far, there has been no
tutorial paper describing typical interactions that a user has with
this system when trying to solve a nontrivial problem, including a
discussion of issues that arise in these situations.  In this paper we
aim to fill this gap by illustrating how we have proved an interesting
theorem with the Boyer-Moore theorem prover:  a formalization of the
assertion that the arithmetic mean of a sequence of natural numbers is
greater than or equal to their geometric mean.  We hope that this
report will be of value not only for (non-expert) users of this
system, who can learn some approaches (and tricks) to use when proving
theorems with it, but also for implementors of automated deduction
systems.  Perhaps our main point is that, at least in the case of
Nqthm, the user can interact with the system without knowing much
about how it works inside.  This perspective suggests the development
of theorem provers that allow interaction that is user oriented and
{\em not} system developer oriented.

From bojsen@ithil.id.dtu.dk  Mon Sep  5 11:40:16 1994
Return-Path: <bojsen@ithil.id.dtu.dk>
Received: from cli.com by jingles.cli.com.cliftp (4.1/SMI-4.1)
	id AA00155; Mon, 5 Sep 94 11:40:16 CDT
Errors-To: sandel@ithil.id.dtu.dk
Received: from iddth.id.dth.dk (iddth.id.dtu.dk) by cli.com (4.1/SMI-4.1)
	id AA00438; Sat, 3 Sep 94 15:14:44 CDT
Errors-To: sandel@ithil.id.dtu.dk
Received: from ithil.id.dtu.dk by iddth.id.dth.dk (5.65c+/1.34)
	id AA02112; Sat, 3 Sep 1994 22:12:25 +0200
Received: by ithil.id.dtu.dk (4.1/SMI-4.1-PB1.0)
	id AA00497; Sat, 3 Sep 94 22:08:54 MED
Date: Sat, 3 Sep 94 22:08:54 MED
From: bojsen@ithil.id.dtu.dk (Per Bojsen)
Message-Id: <9409032008.AA00497@ithil.id.dtu.dk>
To: nqthm-users@cli.com
Subject: Gathering Statistics of Proofs [Repost]
Reply-To: bojsen@ithil.id.dtu.dk

[I'm reposting this message to nqthm-users@cli.com because the
 European address nqthm-users@tfh-berlin.de does not work!]

Hi!

For my Ph.D. dissertation I want to collect some statistics about one
of the theorems I proved using NQTHM.  In appendix III of the Handbook
Boyer and Moore lists several different statistics about some proofs
and I was wondering if there is some LISP code available to collect
such statistics?  I already wrote code to calculate depth of proof,
and the number of supporters seems to be easy to obtain using the
database commands.  But I would like to collect the `concept depth of
statement' and `max concept depth in proof' statistics, also.
`Number of lines in understandable statement' and `lines of
supporters' seem to be harder to collect automatically, but perhaps
there are ways?

Thanks in advance for any and all help!

-- 
Per Bojsen         The Design Automation Group     Email: bojsen@ithil.id.dtu.dk
MoDAG            Technical University of Denmark          bojsen@id.dtu.dk


From getfol@frege.mrg.dist.unige.it  Mon Oct  3 14:27:09 1994
Return-Path: <getfol@frege.mrg.dist.unige.it>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA05289; Mon, 3 Oct 94 14:27:09 CDT
Received: from frege.mrg.dist.unige.it by cli.com (4.1/SMI-4.1)
	id AA03026; Mon, 3 Oct 94 13:20:15 CDT
Received: from skolem.mrg.dist.unige.it by frege.mrg.dist.unige.it with SMTP id AA10761
  (5.65c/IDA-1.4.4 for <nqthm-users@cli.com>); Mon, 3 Oct 1994 19:03:28 +0100
Date: Mon, 3 Oct 1994 19:03:28 +0100
From: GETFOL Manager <getfol@frege.mrg.dist.unige.it>
Message-Id: <199410031803.AA10761@frege.mrg.dist.unige.it>
Received: by skolem.mrg.dist.unige.it (4.1/SMI-4.1)
	id AA02845; Mon, 3 Oct 94 19:01:59 +0100
To: massacci@assi.dis.uniroma1.it, nirad@cs.uq.oz.au,
        schumann@informatik.tu-muenchen.de, musto@iei.pi.cnr.it,
        freitag@informatik.tu-muenchen.de, treur@cs.vu.nl,
        frankh@swi.psy.uva.nl, smaill@aisb.ed.ac.uk, agc@ai.leeds.ac.uk,
        staples@cs.uq.oz.au, kerber@cs.uni-sb.de, e_motta@vax4.open.ac.uk,
        ruess@informatik.uni-ulm.de, laublet@laforia.ibp.fr,
        goerz@informatik.uni-erlangen.de, w.jonker@ecrc.de, jfp@laforia.ibp.fr,
        grosof@watson.ibm.com
Cc: theorem-provers@mc.lcs.mit.edu, qed@mcs.anl.gov, mind@aisb.ed.ac.uk,
        indus@aisb.ed.ac.uk, nqthm-users@cli.com, info-hol@cs.uidaho.edu,
        isabelle-users@cl.cam.ac.uk, dreamers@aisb.ed.ac.uk, risks@csl.sri.COM,
        mrg@frege.mrg.dist.unige.it.October.3, 1994@frege.mrg.dist.unige.it


             *** ANNOUNCING A NEW RELEASE OF THE GETFOL SYSTEM ***

The Mechanized Reasoning Group is pleased to announce release 2.001 of the
GETFOL system.

  GETFOL is  an interactive  reasoning system running  on  top  of a  complete
  reimplementation of the FOL system  (FOL was itself  developed by Richard W.
  Weyhrauch). GETFOL  can be used in many  ways, for instance as a programming
  language for building intelligent systems, as  an interactive theorem prover
  for first order logic or as an environment for the study of the mathematical
  theory of computation.  

  GETFOL has  a first  order sorted  language,   theory and axiom  declaration
  commands,   multiple  proofs,   natural  deduction   inference  rules  (with
  extensions to deal  with sorts), equality  rules, conditional rules (termif,
  wffif), structural rules (weaken, contract),  deciders for propositional and
  predicate logic,  semantic and  syntactic simplification, multiple contexts,
  meta-reasoning.


CHANGES FROM PREVIOUS RELEASE

   * Complete re-implementation of the deciders
   * Minor improvements to the administration commands
   * Bug fixes



GETFOL 2.001 can be obtained via ftp from the following address:

    Network address: frege.mrg.dist.unige.it (130.251.7.2)
    Login:           ftp (anonymous)
    Passwd:          <your full e-mail address>
    Directory:       pub/GETFOL
    File:            GETFOL2.001.tar.Z

GETFOL2.001.tar.Z  is  a compressed,  tar file  containing the  source code
and the documentation needed to run the system.


NEXT RELEASE

    * backward reasoning integrated with forward reasoning
    * tactic language
    * definitions mechanism
    * emacs interface
    * export of proofs to LaTeX source code


DISTRIBUTION POLICY

    * GETFOL is not guaranteed in any way.  It is provided "as is",
      without express or implied warranty.  We accept no responsibility
      for any damage that may result from its use. GETFOL is purely an
      experimental program.
    * GETFOL is maintained by Fausto Giunchiglia as a service to
      researchers interested in logic based representation theory. We
      hope to contribute to the development, sharing and spreading of 
      new ideas.


SYSTEM REQUIREMENTS

  GETFOL is implemented in HGKM, a language built on top of Common Lisp.
  GETFOL has been  successfully compiled  with KCL  (Kyoto Common  Lisp), AKCL
  (Austin Kyoto Common Lisp) Version(1.623) and Lucid (version 3.0.0) on Unix.


----------------------------------------------------------------------------
    If you have comments, requests, suggestions, please send e-mail to:

                        getfol@frege.mrg.dist.unige.it

From aaa@cs.st-andrews.ac.uk  Thu Oct 13 06:16:02 1994
Return-Path: <aaa@cs.st-andrews.ac.uk>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01445; Thu, 13 Oct 94 06:16:02 CDT
Received: from cha01.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06363; Thu, 13 Oct 94 04:52:52 CDT
Received: from sun12.tfh-berlin.de by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@cli.com id AA22979; Thu, 13 Oct 94 10:51:52 GMT
Received: from cha01.tfh-berlin.de by sun12.tfh-berlin.de (5.0/SMI-SVR4)
	id AA14162; Thu, 13 Oct 1994 10:52:51 --100
Received: from ixgate01.dfnrelay.d400.de by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@sun12.tfh-berlin.de id AA22964; Thu, 13 Oct 94 10:51:08 GMT
X400-Received: by mta d400relay in /PRMD=dfnrelay/ADMD=d400/C=de/; Relayed;
               Thu, 13 Oct 1994 10:51:23 +0100
X400-Received: by /PRMD=uk.ac/ADMD= /C=gb/; Relayed;
               Thu, 13 Oct 1994 10:49:14 +0100
X400-Received: by /PRMD=UK.AC/ADMD= /C=GB/; Relayed;
               Thu, 13 Oct 1994 10:50:09 +0100
X400-Received: by /PRMD=UK.AC/ADMD= /C=GB/; Relayed;
               Thu, 13 Oct 1994 10:50:16 +0100
Date: Thu, 13 Oct 1994 10:50:16 +0100
X400-Originator: aaa@cs.st-andrews.ac.uk
X400-Recipients: non-disclosure:;
X400-Mts-Identifier: [/PRMD=UK.AC/ADMD= /C=GB/;<27511.9410130950@keith.cs.st-an]
X400-Content-Type: P2-1984 (2)
Content-Identifier: Code from Sha...
Alternate-Recipient: Allowed
From: deveron <aaa@cs.st-andrews.ac.uk>
Message-Id: <27511.9410130950@keith.cs.st-andrews.ac.uk>
To: nqthm-users@sun12.tfh-berlin.de
Subject: Code from Shankar's Metamathematics, Machines, and G?"odel's Proof.
Content-Length: 2397

I'm working my way through the above book, including going through the code
listings. Shankar's work seems to have been on a much older version of
nqthm than the ones I have available (nqthm-1987 and nqthm-1992). In
both these versions I get a problem with the definition of eql (p.41):

(add-shell forsome () forsomep ((bind (one-of numberp) zero)
				(body1 (none-of) zero)))

;;body is already in use in nqthm-1992 so it is replaced by body1.

(defn eql (x y)
  (if (listp x)
      (if (listp y)
	  (and (eql (car x) (car y))
	       (eql (cdr x) (cdr y)))
	  f)
      (if (listp y)
	  f
	  (if (f-notp x)
	      (if (f-notp y)
		  (eql (arg x) (arg y))
		  f)
	      (if (f-notp y)
		  f
		  (if (f-orp x)
		      (if (f-orp y)
			  (and (eql (arg1 x) (arg1 y))
			       (eql (arg2 x) (arg2 y)))
			  f)
		      (if (f-orp y)
			  f
			  (if (forsomep x)
			      (if (forsomep y)
				  (and (eql (bind x) (bind y))
				       (eql (body1 x) (body1 y)))
				  f)
			      (if (forsomep y)
				  f
				  (equal (fix1 x) (fix1 y)))))))))))


The error I get from this is:

ERROR:  The admissibility of this definition has not been established.  The
simplifier could not prove that the measure(s) tried decrease in each
recursive call.  The definition is rejected.  Below are listed the relations
and measures tried and the unproved goals for each.

Relation:  LESSP
Measure:   (COUNT Y)
Unproved goals:
      (IMPLIES (AND (FORSOMEP X) (FORSOMEP Y))
			      (LESSP (BIND Y) (COUNT Y)))

Relation:  LESSP
Measure:   (COUNT X)
Unproved goals:
      (IMPLIES (AND (FORSOMEP X) (FORSOMEP Y))
			      (LESSP (BIND X) (COUNT X)))


The lemma (implies (forsomep x) (lessp (count (bind x)) (count x)))
is easily proved, but makes no difference to the error. I think the problem
may be that (numberp (bind x)) is stated as a type-restriction in the
shell definition for forsome, thus (count (bind x)) is always immediately
rewritten to (bind x) before the above lemma can be used. Any suggestions
as to how to re-formulate the definitionof eql or is there an earlier 
version of nqthm available that will accept this definition.

Thanks for any help.

*E-mail*aaa@dcs.st-and.ac.uk*******    Andrew A Adams
**snail*45 Fife Park, St Andrews***  Division of Computer Science
***mail*Fife KY16 9UE, UK**********  School of Maths and Comp Sci
****Tel*UK-0334-463268*************  University of St Andrews



From young@cli.com  Thu Oct 13 09:50:41 1994
Return-Path: <young@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01465; Thu, 13 Oct 94 09:50:41 CDT
Received: from cha01.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06647; Thu, 13 Oct 94 08:46:53 CDT
Received: from sun12.tfh-berlin.de by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@cli.com id AA26012; Thu, 13 Oct 94 14:46:48 GMT
Received: from cha01.tfh-berlin.de by sun12.tfh-berlin.de (5.0/SMI-SVR4)
	id AA18623; Thu, 13 Oct 1994 14:48:01 --100
Received: from cli.com by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@sun12.tfh-berlin.de id AA26007; Thu, 13 Oct 94 14:46:31 GMT
Received: from habir (habir.cli.com) by cli.com (4.1/SMI-4.1)
	id AA06644; Thu, 13 Oct 94 08:46:25 CDT
From: young@cli.com (Bill Young)
Received: by habir (4.1) id AA02577; Thu, 13 Oct 94 08:46:25 CDT
Date: Thu, 13 Oct 94 08:46:25 CDT
Message-Id: <9410131346.AA02577@habir>
To: aaa@cs.st-andrews.ac.uk
Cc: nqthm-users@sun12.tfh-berlin.de
In-Reply-To: deveron's message of Thu, 13 Oct 1994 10:50:16 +0100 <27511.9410130950@keith.cs.st-andrews.ac.uk>
Subject: Code from Shankar's Metamathematics, Machines, and G?"odel's Proof.
Content-Length: 410


Why not just prove the lemma:

(prove-lemma foo2 (rewrite)
  (implies (forsomep x) (lessp (bind x) (count x))))

rather than:

(prove-lemma foo2 (rewrite)
  (implies (forsomep x) (lessp (count (bind x)) (count x))))

Each proves easily and foo2 should directly apply.  I couldn't
actually try it on your definition because I don't have the
definitions of all for f-orp, f-notp, etc. functions.

--Bill Young



From boyer@cli.com  Thu Oct 13 09:56:56 1994
Return-Path: <boyer@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01481; Thu, 13 Oct 94 09:56:56 CDT
Received: from rita (rita.cli.com) by cli.com (4.1/SMI-4.1)
	id AA06629; Thu, 13 Oct 94 08:43:02 CDT
From: boyer@cli.com (Robert S. Boyer)
Received: by rita (4.1) id AA20922; Thu, 13 Oct 94 08:43:02 CDT
Date: Thu, 13 Oct 94 08:43:02 CDT
Message-Id: <9410131343.AA20922@rita>
To: aaa@cs.st-andrews.ac.uk
Cc: nqthm-users@cli
Subject: Code from Shankar's Metamathematics, Machines, and G?"odel's Proof.

I am sorry to hear of the difficulty you are encountering.  I don't
have quite enough information from your message to be certain I know
what is causing your problems, but I can guess pretty well what is the
source of your difficulties.

First of all, Shankar's file goedel.events is one of those distributed
with Nqthm-1992, so if you have the Nqthm-1992 distribution, you'll be
able to find it as the file examples/shankar/goedel.events.  You can
run this script through Nqthm-1992 by running all the examples, if you
have a free 200mb or so, or by running (prove-file-out "goedel") when
connected to examples/shankar/, which takes about 10 mb and about 4
hours on a fast Sparc.

Second, please note that the first form in that file is the command
(boot-strap).  That command has the same meaning as (boot-strap thm),
which you will see from the documentation, enters the "THM" logic as
opposed to the "NQTHM" logic.  Among the various differences mentioned
in the documentation is that "In particular, ASSOC, PAIRLIST,
FIX-COST, STRIP-CARS, SUM-CDRS, SUBRP, APPLY-SUBR, FORMALS, BODY,
V&C$, and V&C-APPLY$ are defined in NQTHM but are not defined in THM."
So that is why Shankar could legally use BODY in the ADD-SHELL of
FORSOME that he gave.

Third, as for why your definition of EQL was not being accepted, I
suspect that the problem arises from the fact that you use EQL where
the file goedel.events uses EQUAL, in particular in the phrase "(eql
(bind x) (bind y))" of your message.  The following script, which is
extracted from goedel.events, replays ok in Nqthm-1992.

(BOOT-STRAP THM)

(DEFN FIX1 (X) (IF (NUMBERP X) X NIL))

(ADD-SHELL F-NOT NIL F-NOTP ((ARG (NONE-OF) ZERO)))

(ADD-SHELL F-OR NIL F-ORP ((ARG1 (NONE-OF) ZERO) (ARG2 (NONE-OF) ZERO)))

(ADD-SHELL FORSOME NIL FORSOMEP ((BIND (ONE-OF NUMBERP) ZERO)
                                 (BODY (NONE-OF) ZERO)))

(DEFN EQL (X Y)
 (IF (LISTP X)
     (IF (LISTP Y)
         (AND (EQL (CAR X) (CAR Y))
              (EQL (CDR X) (CDR Y)))
         F)
     (IF (LISTP Y)
         F
         (IF (F-NOTP X)
             (IF (F-NOTP Y) (EQL (ARG X) (ARG Y)) F)
             (IF (F-NOTP Y)
                 F
                 (IF (F-ORP X)
                     (IF (F-ORP Y)
                         (AND (EQL (ARG1 X) (ARG1 Y))
                              (EQL (ARG2 X) (ARG2 Y)))
                         F)
                     (IF (F-ORP Y)
                         F
                         (IF (FORSOMEP X)
                             (IF (FORSOMEP Y)
                                 (AND (EQUAL (BIND X) (BIND Y))
                                      (EQL (BODY X) (BODY Y)))
                                 F)
                             (IF (FORSOMEP Y)
                                 F
                                 (EQUAL (FIX1 X) (FIX1 Y)))))))))))

Bob

P. S. Should you wish to get admitted exactly the definition of EQL
that you had in your message, with the "(EQUAL (BIND X) (BIND Y))",
you should first prove this lemma:

(PROVE-LEMMA FOO (REWRITE)
  (IMPLIES (FORSOMEP Y)
           (LESSP (BIND Y) (COUNT Y))))

From kaufmann@cli.com  Thu Oct 13 10:10:22 1994
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01485; Thu, 13 Oct 94 10:10:22 CDT
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA06713; Thu, 13 Oct 94 09:02:26 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder (4.1) id AA06902; Thu, 13 Oct 94 09:02:26 CDT
Date: Thu, 13 Oct 94 09:02:26 CDT
Message-Id: <9410131402.AA06902@thunder>
To: nqthm-users@cli
Subject: [kaufmann: Re: Code from Shankar's Metamathematics, Machines, and G?"odel's Proof.]

I'm re-sending this -- I think there *may* be some problems with the
nqthm-users address at nqthm-users@sun12.tfh-berlin.de, though I don't know.

Date: Thu, 13 Oct 94 08:57:01 CDT
From: kaufmann (Matt Kaufmann)
To: aaa@cs.st-andrews.ac.uk
CC: nqthm-users@sun12.tfh-berlin.de
In-reply-to: <27511.9410130950@keith.cs.st-andrews.ac.uk> (message from deveron on Thu, 13 Oct 1994 10:50:16 +0100)
Subject: Re: Code from Shankar's Metamathematics, Machines, and G?"odel's Proof.

Here is a solution that works in nqthm-1992.  I guess the key is noticing that
the two goals you displayed,

Relation:  LESSP
Measure:   (COUNT Y)
Unproved goals:
      (IMPLIES (AND (FORSOMEP X) (FORSOMEP Y))
			      (LESSP (BIND Y) (COUNT Y)))

Relation:  LESSP
Measure:   (COUNT X)
Unproved goals:
      (IMPLIES (AND (FORSOMEP X) (FORSOMEP Y))
			      (LESSP (BIND X) (COUNT X)))

both follow from the first lemma below.  If you prove them exactly as shown
above, the prover prints a "free variable" warning -- in the first one above X
is free -- it's nowhere to be found in the conclusion, so it's hard for the
rewriter to know how to relieve the hypothesis (FORSOMEP X) -- and similarly
for the second one.  By stating the single lemma EQL-ACCEPTANCE-HELPER below I
avoid that problem.

Since you didn't include the definitions of f-notp etc., I simply declare them
below and assume axioms that I imagine are immediate consequences of your
definitions.

-- Matt Kaufmann [events follow below]

(add-shell forsome () forsomep ((bind (one-of numberp) zero)
				(body1 (none-of) zero)))

;;; Here is the key lemma.
(prove-lemma eql-acceptance-helper (rewrite)
   (implies (forsomep y)
	    (lessp (bind y) (count y))))

(dcl f-notp (x))

(dcl f-orp (y))

(dcl arg1 (x))

(dcl arg2 (x))

(add-axiom arg1-less-than (rewrite)
   (implies (f-orp x)
	    (lessp (count (arg1 x))
		   (count x))))

(add-axiom arg2-less-than (rewrite)
   (implies (f-orp x)
	    (lessp (count (arg2 x))
		   (count x))))

(dcl arg (x))

(add-axiom arg-less-than (rewrite)
   (implies (f-notp x)
	    (lessp (count (arg x))
		   (count x))))

(dcl fix1 (x))

(defn eql (x y)
  (if (listp x)
      (if (listp y)
	  (and (eql (car x) (car y))
	       (eql (cdr x) (cdr y)))
	  f)
      (if (listp y)
	  f
	  (if (f-notp x)
	      (if (f-notp y)
		  (eql (arg x) (arg y))
		  f)
	      (if (f-notp y)
		  f
		  (if (f-orp x)
		      (if (f-orp y)
			  (and (eql (arg1 x) (arg1 y))
			       (eql (arg2 x) (arg2 y)))
			  f)
		      (if (f-orp y)
			  f
			  (if (forsomep x)
			      (if (forsomep y)
				  (and (eql (bind x) (bind y))
				       (eql (body1 x) (body1 y)))
				  f)
			      (if (forsomep y)
				  f
				  (equal (fix1 x) (fix1 y)))))))))))


From kaufmann@cli.com  Thu Oct 13 10:16:05 1994
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01489; Thu, 13 Oct 94 10:16:05 CDT
Received: from cha01.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06677; Thu, 13 Oct 94 08:57:41 CDT
Received: from sun12.tfh-berlin.de by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@cli.com id AA26304; Thu, 13 Oct 94 14:57:31 GMT
Received: from cha01.tfh-berlin.de by sun12.tfh-berlin.de (5.0/SMI-SVR4)
	id AA18731; Thu, 13 Oct 1994 14:58:42 --100
Received: from cli.com by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@sun12.tfh-berlin.de id AA26300; Thu, 13 Oct 94 14:57:14 GMT
Received: from thunder (thunder.cli.com) by cli.com (4.1/SMI-4.1)
	id AA06673; Thu, 13 Oct 94 08:57:03 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder (4.1) id AA06886; Thu, 13 Oct 94 08:57:02 CDT
Date: Thu, 13 Oct 94 08:57:02 CDT
Message-Id: <9410131357.AA06886@thunder>
To: aaa@cs.st-andrews.ac.uk
Cc: nqthm-users@sun12.tfh-berlin.de
In-Reply-To: <27511.9410130950@keith.cs.st-andrews.ac.uk> (message from deveron on Thu, 13 Oct 1994 10:50:16 +0100)
Subject: Re: Code from Shankar's Metamathematics, Machines, and G?"odel's Proof.
Content-Length: 2237

Here is a solution that works in nqthm-1992.  I guess the key is noticing that
the two goals you displayed,

Relation:  LESSP
Measure:   (COUNT Y)
Unproved goals:
      (IMPLIES (AND (FORSOMEP X) (FORSOMEP Y))
			      (LESSP (BIND Y) (COUNT Y)))

Relation:  LESSP
Measure:   (COUNT X)
Unproved goals:
      (IMPLIES (AND (FORSOMEP X) (FORSOMEP Y))
			      (LESSP (BIND X) (COUNT X)))

both follow from the first lemma below.  If you prove them exactly as shown
above, the prover prints a "free variable" warning -- in the first one above X
is free -- it's nowhere to be found in the conclusion, so it's hard for the
rewriter to know how to relieve the hypothesis (FORSOMEP X) -- and similarly
for the second one.  By stating the single lemma EQL-ACCEPTANCE-HELPER below I
avoid that problem.

Since you didn't include the definitions of f-notp etc., I simply declare them
below and assume axioms that I imagine are immediate consequences of your
definitions.

-- Matt Kaufmann [events follow below]

(add-shell forsome () forsomep ((bind (one-of numberp) zero)
				(body1 (none-of) zero)))

;;; Here is the key lemma.
(prove-lemma eql-acceptance-helper (rewrite)
   (implies (forsomep y)
	    (lessp (bind y) (count y))))

(dcl f-notp (x))

(dcl f-orp (y))

(dcl arg1 (x))

(dcl arg2 (x))

(add-axiom arg1-less-than (rewrite)
   (implies (f-orp x)
	    (lessp (count (arg1 x))
		   (count x))))

(add-axiom arg2-less-than (rewrite)
   (implies (f-orp x)
	    (lessp (count (arg2 x))
		   (count x))))

(dcl arg (x))

(add-axiom arg-less-than (rewrite)
   (implies (f-notp x)
	    (lessp (count (arg x))
		   (count x))))

(dcl fix1 (x))

(defn eql (x y)
  (if (listp x)
      (if (listp y)
	  (and (eql (car x) (car y))
	       (eql (cdr x) (cdr y)))
	  f)
      (if (listp y)
	  f
	  (if (f-notp x)
	      (if (f-notp y)
		  (eql (arg x) (arg y))
		  f)
	      (if (f-notp y)
		  f
		  (if (f-orp x)
		      (if (f-orp y)
			  (and (eql (arg1 x) (arg1 y))
			       (eql (arg2 x) (arg2 y)))
			  f)
		      (if (f-orp y)
			  f
			  (if (forsomep x)
			      (if (forsomep y)
				  (and (eql (bind x) (bind y))
				       (eql (body1 x) (body1 y)))
				  f)
			      (if (forsomep y)
				  f
				  (equal (fix1 x) (fix1 y)))))))))))



From boyer@cli.com  Thu Oct 13 10:42:38 1994
Return-Path: <boyer@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01511; Thu, 13 Oct 94 10:42:38 CDT
Received: from rita (rita.cli.com) by cli.com (4.1/SMI-4.1)
	id AA06783; Thu, 13 Oct 94 09:31:20 CDT
From: boyer@cli.com (Robert S. Boyer)
Received: by rita (4.1) id AA20971; Thu, 13 Oct 94 09:31:20 CDT
Date: Thu, 13 Oct 94 09:31:20 CDT
Message-Id: <9410131431.AA20971@rita>
To: nqthm-users@cli
Subject: nqthm-users mailing list address

Throughout the world, please use the address nqthm-users@cli.com for
mail to the nqthm-users mailing list.

We recently quit trying to minimize packet distances by maintaining
two lists; it was too confusing.  So all of the email addresses that
were on the European list were moved over to the one consolidated list
kept at cli.com.

Please send all requests for addition to and deletion from the mailing
list to nqthm-users-request@cli.com.

Thanks,

Bob



From boyer@cli.com  Thu Oct 13 10:54:05 1994
Return-Path: <boyer@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01522; Thu, 13 Oct 94 10:54:05 CDT
Received: from rita (rita.cli.com) by cli.com (4.1/SMI-4.1)
	id AA06840; Thu, 13 Oct 94 09:46:18 CDT
From: boyer@cli.com (Robert S. Boyer)
Received: by rita (4.1) id AA20982; Thu, 13 Oct 94 09:46:17 CDT
Date: Thu, 13 Oct 94 09:46:17 CDT
Message-Id: <9410131446.AA20982@rita>
To: aaa@cs.st-andrews.ac.uk
Cc: nqthm-users@cli
Subject: EQL

I note that on p. 41 of Shankar's new book "Metamathematics, Machines,
and Goedel's Proof", EQL is defined the same way it is in the
Nqthm-1992 distribution file examples/shankar/goedel.events, which is
what I would have expected.  So I now believe that the root of your
problem was in not typing in the definition of EQL accurately.  You
typed the phrase "(eql (bind x) (bind y))" where Shankar had "(equal
(bind x) (bind y))", and Nqthm wasn't "smart enough" to prove
termination of your revised definition, which introduces two new
recursive calls, without the help of an additional lemma, e.g., such
as Young, Kaufmann, and I suggested.

Bob

From aaa@cs.st-andrews.ac.uk  Thu Oct 13 10:56:12 1994
Return-Path: <aaa@cs.st-andrews.ac.uk>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01526; Thu, 13 Oct 94 10:56:12 CDT
Received: from cha01.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA06788; Thu, 13 Oct 94 09:32:22 CDT
Received: from sun12.tfh-berlin.de by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@cli.com id AA27077; Thu, 13 Oct 94 15:32:14 GMT
Received: from cha01.tfh-berlin.de by sun12.tfh-berlin.de (5.0/SMI-SVR4)
	id AA19591; Thu, 13 Oct 1994 15:33:23 --100
Received: from ixgate01.dfnrelay.d400.de by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@sun12.tfh-berlin.de id AA27058; Thu, 13 Oct 94 15:31:56 GMT
X400-Received: by mta d400relay in /PRMD=dfnrelay/ADMD=d400/C=de/; Relayed;
               Thu, 13 Oct 1994 15:33:11 +0100
X400-Received: by /PRMD=uk.ac/ADMD= /C=gb/; Relayed;
               Thu, 13 Oct 1994 15:31:26 +0100
X400-Received: by /PRMD=UK.AC/ADMD= /C=GB/; Relayed;
               Thu, 13 Oct 1994 15:32:19 +0100
X400-Received: by /PRMD=UK.AC/ADMD= /C=GB/; Relayed;
               Thu, 13 Oct 1994 15:32:27 +0100
Date: Thu, 13 Oct 1994 15:32:27 +0100
X400-Originator: aaa@cs.st-andrews.ac.uk
X400-Recipients: non-disclosure:;
X400-Mts-Identifier: [/PRMD=UK.AC/ADMD= /C=GB/;<5866.9410131432@keith.cs.st-and]
X400-Content-Type: P2-1984 (2)
Content-Identifier: Re: Code from...
Alternate-Recipient: Allowed
From: deveron <aaa@cs.st-andrews.ac.uk>
Message-Id: <5866.9410131432@keith.cs.st-andrews.ac.uk>
To: nqthm-users@sun12.tfh-berlin.de
Subject: Re: Code from Shankar's Metamathematics, Machines, and G?"odel's Proof.
Content-Length: 149

Thanks to all who've replied. I had incorrectly copied down one of the expressions
in Shankar's book (substituting an 'eql' for an 'equal'). 

AAA.



From shankar@csl.sri.com  Thu Oct 13 16:05:04 1994
Return-Path: <shankar@csl.sri.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01559; Thu, 13 Oct 94 16:05:04 CDT
Received: from krypton.csl.sri.com by cli.com (4.1/SMI-4.1)
	id AA08093; Thu, 13 Oct 94 14:37:51 CDT
Received: from LOCALHOST.csl.sri.com by krypton.csl.sri.com with SMTP id AA00585
  (5.65b/IDA-1.4.3 for nqthm-users@cli.com); Thu, 13 Oct 94 12:37:41 -0700
Message-Id: <9410131937.AA00585@krypton.csl.sri.com>
To: nqthm-users@cli.com
Subject: Revised Index for "Metamathematics,..." available via WWW
Date: Thu, 13 Oct 94 12:37:40 -0700
From: shankar@krypton.csl.sri.com


The Index in the book "Metamathematics, Machines, and Goedel's Proof"
is incorrect.  An accurate Index can be obtained from the URL:
 http://www.csl.sri.com/shankar/Index.{ps.gz, dvi.Z}

Sorry for the inconvenience,
Shankar

From olumide@adsznet.com  Mon Oct 17 03:30:21 1994
Return-Path: <olumide@adsznet.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01995; Mon, 17 Oct 94 03:30:21 CDT
Received: from holonet.net (marvin.holonet.net) by cli.com (4.1/SMI-4.1)
	id AA16186; Mon, 17 Oct 94 02:14:55 CDT
Received: from adsznet.com (uucp@localhost) by holonet.net with UUCP
	id MAA25806; Sun, 16 Oct 1994 12:32:43 -0700
Received: by adsznet.com (UUPM-1.51)
	id D8479vT Wed, Oct 12, 1994 20:09:12 EDT
From: olumide@adsznet.com
Message-Id: <9410122009.D8479vT@adsznet.com>
X-Mailer: UUPlus Mail 1.51
To: nqthm-users@cli.com
Subject: $$$ Internet Card
Organization: Automated Data Sciences
Date: Wed, 12 Oct 94 20:09:12 EST


$$$$WWW - This is an unsolicited mail. Please you do not have tomread
it. Thanks.


We market a quick reference Internet Card. If you are interested please
send your name and mailing address PLUS your Internet Address and a $10
fee to:

Internet Card
P.O.Box 1825
Woodbridge, VA 22193


Thanks.

Oolumide Ola

From boyer@cli.com  Fri Oct 21 13:25:22 1994
Return-Path: <boyer@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA03796; Fri, 21 Oct 94 13:25:22 CDT
Received: from rita (rita.cli.com) by cli.com (4.1/SMI-4.1)
	id AA00759; Fri, 21 Oct 94 12:17:13 CDT
From: boyer@cli.com (Robert S. Boyer)
Received: by rita (4.1) id AA11522; Fri, 21 Oct 94 12:17:13 CDT
Date: Fri, 21 Oct 94 12:17:13 CDT
Message-Id: <9410211717.AA11522@rita>
To: nqthm-users@cli, gcl@cli
Subject: anonymous ftp access to ftp.cli.com is impossible for some

In the past, some software such as GCL and Nqthm has been advertised
as being available through anonymous ftp from ftp.cli.com.  Yesterday
I learned, however, that anonymous ftp to ftp.cli.com does not work
from some Internet sites, namely from any site whose IP number cannot
be resolved into a hostname.

Until yesterday, people encountering such difficulties simply had
their attempted connections broken, without explanation, immediately
after supplying the "anonymous" login name.  Now at least they should
receive a message that suggests that they try to initiate the ftp
connection from some machine whose hostname is published in some way
that ftp.cli.com can detect.

I regret that this restriction exists.  It is certainly not something
I favor.

I apologize to those who have been disconnected without explanation.

Bob



From @vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be  Thu Nov 10 17:48:44 1994
Return-Path: <@vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA11374; Thu, 10 Nov 94 17:48:44 CST
Received: from vm1.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA22587; Thu, 10 Nov 94 16:52:47 CST
Received: from georges.montefiore.ulg.ac.be by vm1.ulg.ac.be (IBM VM SMTP V2R2)
   with TCP; Thu, 10 Nov 94 23:51:30 +0100
Received: from bbaguett@localhost
	  by georges.montefiore.ulg.ac.be (8.6.9/ULG-7.0) id XAA06440
	  for nqthm-users@cli.com
	  at Thu, 10 Nov 1994 23:52:43 +0100
Date: Thu, 10 Nov 1994 23:52:43 +0100
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199411102252.XAA06440@georges.montefiore.ulg.ac.be>
To: nqthm-users@cli.com
Subject: concurrent_programs

can you send me all you know about the verification systems for concurrent programs based on the Boyer-Moore prover (abstracts,books,examples,...)

thank you

From boyer@cli.com  Sun Nov 13 21:16:35 1994
Return-Path: <boyer@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA00257; Sun, 13 Nov 94 21:16:35 CST
Received: from rita (rita.cli.com) by cli.com (4.1/SMI-4.1)
	id AA01208; Sun, 13 Nov 94 20:33:09 CST
From: boyer@cli.com (Robert S. Boyer)
Received: by rita (4.1) id AA00330; Sun, 13 Nov 94 20:33:10 CST
Date: Sun, 13 Nov 94 20:33:10 CST
Message-Id: <9411140233.AA00330@rita>
To: nqthm-users@cli
Subject: WWW Page

http://www.cli.com is Computational Logic's new WWW page.  It points
to our technical reports (some about Nqthm usage), descriptions of
research underway, and other information about Computational Logic.

Bob



From dix@mailhost.uni-koblenz.de  Mon Nov 14 07:15:34 1994
Return-Path: <dix@mailhost.uni-koblenz.de>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA00428; Mon, 14 Nov 94 07:15:34 CST
Received: from infko.uni-koblenz.de (mailhost.uni-koblenz.de) by cli.com (4.1/SMI-4.1)
	id AA01833; Mon, 14 Nov 94 06:16:25 CST
Received: from yun.uni-koblenz.de (yun.uni-koblenz.de [141.26.5.35]) by infko.uni-koblenz.de (8.6.9/8.6.9) with SMTP id NAA28035; Mon, 14 Nov 1994 13:09:56 +0100
From: Juergen Dix <dix@informatik.uni-koblenz.de>
Message-Id: <199411141209.NAA28035@infko.uni-koblenz.de>
Received: by yun.uni-koblenz.de (4.1/KO-2.0)
	id AA18257; Mon, 14 Nov 94 13:09:52 +0100
Date: Mon, 14 Nov 94 13:09:52 +0100
To: fg121@inferenzsysteme.informatik.th-darmstadt.de,
        rewriting-list@lorraine.loria.fr, theorem-provers@mc.lcs.mit.edu,
        deduktion@intellektik.informatik.th-darmstadt.de,
        kgs@csdec1.tuwien.ac.at, aal@anu.edu.au, isabelle-users@cl.cam.ac.uk,
        info-hol@cs.uidaho.edu, nqthm-users@cli.com, howe@research.att.com,
        marek@ms.uky.edu, clp@cis.ohio-state.edu
Subject: CFP-Extension

Several individuals requested that, in view of recent LiCS and ILPS
deadline extensions, LPNMR submission date be moved forward. We decided to
change the date by 8 days. Please find the new announcement with the
extension.

3rd Logic Programming and Non-Monotonic Reasoning Conference
Lexington, KY, USA
June 26-28, 1995

Sponsored by Association for Logic Programming and the University of
Kentucky.

This is the third in the series of international meetings 
on the relationship between logic programming and 
non-monotonic reasoning. Two previous meetings were held 
in Washington, DC, in 1991, and in Lisbon, 
Portugal, in 1993. The series was started in response to the growing
evidence of synergy between the two areas and was meant as a vehicle
to facilitate interactions and interdisciplinary research.

Papers are invited on all aspects of logic programming and  
non-monotonic reasoning. Papers on the relationship between 
logic programming and non-monotonic reasoning are especially encouraged.
The following is a non-exhaustive list of topics of interest:

+ Semantics for logic programs + Default logic and its versions
+ Modal non-monotonic logics + Non-monotonic rule systems + Abduction
+ Diagnosis + Non-monotonic reasoning in databases + Theory of 
updates and belief revision + Constraint satisfaction + Algorithms 
and complexity + Implementations and applications

GENERAL CO-CHAIRS:   Victor Marek and Miroslaw Truszczynski,
Department of Computer Science, University of Kentucky, Lexington, KY
40506, USA, e-mail: marek@ms.uky.edu, mirek@ms.uky.edu, tel:
+1-606-257-3961, fax: +1-606-323-1971

PROGRAM CHAIR: Anil Nerode, Mathematical Sciences Institute, Cornell 
University, 407 College Ave., Ithaca, NY 14850, USA, e-mail:
nerode@msiadmin.cit.cornell.edu, tel: +1-607-255-7752, fax:
+1-607-255-9003.

PROGRAM COMMITTEE:
Krzysztof Apt, Howard Blair, Pham Minh Dung, Michael Gelfond, Georg 
Gottlob, Anthony Kakas, Vladimir Lifschitz, Victor Marek, Anil Nerode,
Luis Pereira, Teodor Przymusinski, Yehoshua Sagiv, V.S. Subrahmanian, 
Miroslaw Truszczynski, David Warren.

SUBMISSION DETAILS:
Send four copies (double-spaced, 12 point font) of a full paper of 20
pages or less to Program Chair.

IMPORTANT DATES:
Submission deadline: Wednesday, December 14, 1994
Acceptance/rejection notification: January 23, 1995
Camera-ready version: February 27, 1995

\documentstyle{article}
\textwidth 6.5in
\textheight 9.0in
\hoffset=-.75in
\voffset=-1.2in
\parskip=.1in

\begin{document}
\thispagestyle{empty}
\begin{center}
3rd International Conference on\\
\vspace*{0.1in}
{\large\bf LOGIC PROGRAMMING and NON-MONOTONIC REASONING}\\
\vspace*{0.1in}
Sponsored by: Association for Logic Programming and University of
Kentucky\\
Lexington, KY, USA\\
June 26-28, 1995\\
\ \\
{\it ANNOUNCEMENT and CALL for PAPERS}
\end{center}
\ \\
\noindent
This is the third in the series of international meetings 
on the relationship between logic programming and non-monotonic reasoning.
Two previous meetings were held in Washington, DC, in 1991, and in Lisbon, 
Portugal, in 1993. The series was started in response to the growing
evidence of synergy between the two areas and was meant as a vehicle
to facilitate interactions and interdisciplinary research.

\noindent
Papers are invited on all aspects of logic programming and  
non-monotonic reasoning. Papers on the relationship between Logic Programming
and Nonmonotonic Reasoning are especially encouraged.

\noindent
The following is a non-exhaustive list of topics of interest.
\begin{tabbing}
\hspace*{0.4in}$\bullet\ $Semantics for logic programs\hspace{1in} \=$\bullet\ $Default logic and its versions\\
\hspace*{0.4in}$\bullet\ $Modal nonmonotnic logics\>$\bullet\ $Nonmonotonic rule systems \\
\hspace*{0.4in}$\bullet\ $Abduction\>$\bullet\ $Diagnosis \\
\hspace*{0.4in}$\bullet\ $Nonmonotonic reasoning in databases\>$\bullet\ $Theory of updates and belief revision \\
\hspace*{0.4in}$\bullet\ $Constraint satisfaction\>$\bullet\ $Algorithms and complexity \\
\hspace*{0.4in}$\bullet\ $Implementations and applications\>\  \\
\end{tabbing}

\noindent
{\bf GENERAL CO-CHAIRS:}   Victor Marek and Miroslaw Truszczynski,
Department of Computer Science, University of Kentucky, Lexington, KY
40506, USA, {\bf e-mail:} marek@ms.uky.edu, mirek@ms.uky.edu, {\bf
fax:} +1-606-323-1971\\
\ \\
{\bf PROGRAM CHAIR:}  Anil Nerode, Mathematical Sciences Institute, Cornell 
University, 407 College Ave., Ithaca, NY 14850, USA, {\bf e-mail:}
nerode@msiadmin.cit.cornell.edu, {\bf fax:}
+1-607-255-8005 \\
\ \\
{\bf PROGRAM COMMITTEE:}
\begin{tabbing}
\hspace*{0.8in} Krzysztof Apt \hspace{0.6in} \= Howard Blair \hspace{0.8in} \= 
Pham Minh Dung\\
\hspace*{0.8in} Michael Gelfond \> Georg Gottlob \> Anthony Kakas\\
\hspace*{0.8in} Vladimir Lifschitz \> Victor Marek \> Anil Nerode\\
\hspace*{0.8in} Luis Pereira \> Teodor Przymusinski \> Yehoshua Sagiv\\
\hspace*{0.8in} V.S. Subrahmanian \> Miroslaw Truszczynski \> David Warren\\
\end{tabbing}
\ \\
\noindent
{\bf SUBMISSION DETAILS:}\\
Send four copies (double-spaced, 12 point font) of a full paper of 20
pages or less to Program Chair.\\
\ \\
\noindent
{\bf IMPORTANT DATES:}
\begin{tabbing}
\hspace*{0.8in} {\em Submission deadline:}\hspace{0.8in} \= {\bf Wednesday, December 14, 1994}\\
\hspace*{0.8in} {\em Acceptance/rejection notification:} \> {\bf January 23, 1995}\\
\hspace*{0.8in} {\em Camera-ready version:} \> {\bf February 27, 1995}
\end{tabbing}

\end{document}


From laurence@gyptis.univ-mrs.fr  Tue Nov 22 12:01:17 1994
Return-Path: <laurence@gyptis.univ-mrs.fr>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA02981; Tue, 22 Nov 94 12:01:17 CST
Received: from gyptis.univ-mrs.fr by cli.com (4.1/SMI-4.1)
	id AA27423; Tue, 22 Nov 94 10:57:11 CST
Received: by gyptis.univ-mrs.fr (4.1/1.34)
	id AA11341; Tue, 22 Nov 94 17:50:05 GMT 
Date: Tue, 22 Nov 94 17:50:05 GMT
From: laurence@gyptis.univ-mrs.fr (Laurence Pierre)
Message-Id: <9411221750.AA11341@gyptis.univ-mrs.fr>
To: nqthm-users@cli.com
Subject: Nqthm and process algebras



    Dear Nqthm users,

I would like to know if you are aware of some work on defining a semantics
of CCS or CSP in Nqthm (or some more or less related works).
Please could you send me some references, if any ?

Thanks,

Laurence PIERRE
CMI/Universite de Provence
Technopole de Chateau-Gombert
39 Rue Joliot Curie
13453 Marseille cedex 13 - France
e-mail : laurence@gyptis.univ-mrs.fr



From boyer@cli.com  Wed Dec  7 15:40:57 1994
Return-Path: <boyer@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA02874; Wed, 7 Dec 94 15:40:57 CST
Received: from rita (rita.cli.com) by cli.com (4.1/SMI-4.1)
	id AA06589; Wed, 7 Dec 94 14:39:13 CST
From: boyer@cli.com (Robert S. Boyer)
Received: by rita (4.1) id AA03169; Wed, 7 Dec 94 14:39:09 CST
Date: Wed, 7 Dec 94 14:39:09 CST
Message-Id: <9412072039.AA03169@rita>
To: nqthm-users@cli, qed@mcs.anl.gov, theorem-provers@mc.lcs.mit.edu
Subject: Otter Web Page on Results


  http://www.mcs.anl.gov/home/mccune/ar/new_results/index.html

contains a summary of many of the cases in which Bill McCune's
automated reasoning system Otter, and other Argonne provers, have been
used to help settle open mathematical questions.  Quite remarkable.

I hope that those who make disparaging remarks about the prospects for
the automation of mathematical reasoning get pointed to that summary.

Bob

From actuary@ix.netcom.com  Tue Dec 13 04:37:31 1994
Return-Path: <actuary@ix.netcom.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA04085; Tue, 13 Dec 94 04:37:31 CST
Received: from ix.ix.netcom.com by cli.com (4.1/SMI-4.1)
	id AA19901; Tue, 13 Dec 94 03:39:28 CST
Received: from  by ix.ix.netcom.com (8.6.9/SMI-4.1/Netcom)
	id BAA00419; Tue, 13 Dec 1994 01:28:21 -0800
Date: Tue, 13 Dec 1994 01:28:21 -0800
Message-Id: <199412130928.BAA00419@ix.ix.netcom.com>
From: actuary@ix.netcom.com (LIONEL GOLDBERG)
Subject: Court Ordered Liquidation - Computer Memory - CPU's & Hdsk Drives
To: NOTABENE%TAUNIVM.bitnet@CUNYVM.CUNY.EDU

Choice Trading Company, Court Appointed Liquidators, have 
been assigned to liquidate the following Multi-Million Dollar 
inventory of computer Memory Chips, CPU's and Hard Disk Drives.  
All items are new and come with applicable manufactures warranty. 
Prices quoted include all state and local taxes plus shipping and 
handling.

Order                                                 Cost
Number   Mfg.       Description                      (EACH)

Memory

1524    Toshiba    30 Pin Simms 1x3     70ns  1 meg  $ 25.00
1525    Toshiba    30 Pin Simms 1x9     70ns  1 meg    25.00
1526    Toshiba    30 Pin Simms 4x9     70ns  4 meg   100.00

1527    Toshiba    30 Pin Simms 1x3     60ns  1 meg    26.00
1528    Toshiba    30 Pin Simms 1x9     60ns  1 meg    26.00
1529    Toshiba    30 Pin Simms 4x9     60ns  4 meg   106.00

1624    Toshiba    72 Pin Simms 512x36  70ns  2  meg   50.00
1625    Toshiba    72 Pin Simms 1x36    70ns  4  meg  100.00
1626    Toshiba    72 Pin Simms 2x36    70ns  8  meg  200.00
1627    Toshiba    72 Pin Simms 4x36    70ns  16 meg  400.00
1628    Toshiba    72 Pin Simms 8x36    70ns  32 meg  800.00
                                                    
1624    Toshiba    72 Pin Simms 512x36  60ns  2  meg   52.00
1625    Toshiba    72 Pin Simms 1x36    60ns  4  meg  104.00
1626    Toshiba    72 Pin Simms 2x36    60ns  8  meg  208.00
1627    Toshiba    72 Pin Simms 4x36    60ns  16 meg  416.00
1628    Toshiba    72 Pin Simms 8x36    60ns  32 meg  832.00

Memory for the Macintosh

1122    Toshiba    1 meg x 8 Simm Module 70ns  1 meg   31.00
1123    Toshiba    2 meg x 8 Simm Module 70ns  2 meg   62.00
1124    Toshiba    4 meg x 8 Simm Module 70ns  4 meg  109.00

CPU's

1276    Intel      80486 DX/33                        115.00
1277    Intel      80486 DX/50                        188.00
1278    Intel      80486 DX-2/66                      156.00
1279    Intel      80486 DX-4/75                      358.00
1280    Intel      80486 DX-4/100                     498.00
1281    Intel      Pentium 80501-60                   366.00
1282    Intel      Pentium 80501-66                   453.00
1283    Intel      Pentium 80502-90                   558.00

Hard Disk Drives

Seagate Barracuda Drives
1351    Seagate    ST11950N 8ms  3.5" 1.69 GB SCSI    658.00
1352    Seagate    ST12550N 8ms  3.5" 2.1  GB SCSI    899.00
1353    Seagate    ST15150N 8ms  3.5" 4.2  GB SCSI  1,526.00
1354    Seagate    ST31200N 11ms 3.5" 1.05 GB SCSI    538.00
1355    Seagate    ST11900N  9ms 3.5" 1.7  GB SCSI    628.00
1366    Seagate    ST2400A   9ms 3.5" 2.1  GB SCSI    856.00
1367    Seagate    ST15230N  9ms 3.5" 4.29 GB SCSI  1,454.00
1368    Seagate    ST41080N 11ms 5.5" 9.08 GB SCSI  2,848.00

Western Digital
1366    Western    AC2340 12ms  3.5"  340  MB IDE     122.00
1367    Western    AC2420 12ms  3.5"  420  MB IDE     136.00
1368    Western    AC2540 12ms  3.5"  540  MB IDE     160.00
1369    Western    AC2700 12ms  3.5"  731  MB IDE     230.00

Conner
1372    Connor     CFS420A  14ms  3.5"  420  MB  IDE  138.00
1373    Connor     CFA540A  10ms  3.5"  540  MB  IDE  168.00
1374    Connor     CFA1080A 10ms  3.5"  1080 MB  IDE  408.00

ORDERING INFORMATION

To order please use a company order form/letterhead or if for
personal use, use a plain white sheet of paper with your return 
address. List the items desired by order number, the quantity
and total cost.  Send your order with check or money order 
payable to Choice Trading Company to:

Choice Trading Company
Order Processing  Lot #1776
86228 Terminal Annex
Los Angeles, Ca. 90086-0228

Orders are processed on a first come basis.  Adjustments and 
refunds will be made immediately for items that have sold out. 
Please allow 2 to 3 Weeks for shipping.  Due to court ordered 
restrictions we are unable to accept COD, phone or credit card 
orders.  

This public offering is valid through December 30, 1994. Any 
unsold inventories will be auctioned.  For auction information
please send a self addressed stamped enveloped to: 

Choice Trading Company
Lot #1776
202 So. Broadway
Los Angeles, Ca. 90012
(213) 856 6172

If you are unable to use this information, please pass it on to 
someone who may.
 
Lionel M. Goldberg
Actuary



From 75672.1174@compuserve.com  Fri Dec 30 00:21:35 1994
Return-Path: <75672.1174@compuserve.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA06885; Fri, 30 Dec 94 00:21:35 CST
Received: from arl-img-1.compuserve.com by cli.com (4.1/SMI-4.1)
	id AA24711; Thu, 29 Dec 94 23:34:51 CST
Received: by arl-img-1.compuserve.com (8.6.9/5.941228sam)
	id AAA22996; Fri, 30 Dec 1994 00:17:30 -0500
Date: 30 Dec 94 00:12:11 EST
From: "HERBERT D. KING" <75672.1174@compuserve.com>
To: <dewey-fields@ifi.uio.no>
Subject: incense 20 sticks per pack.
Message-Id: <941230051210_75672.1174_FHN78-2@CompuServe.COM>

the best incense 20 sticks per pack $1. minimum purchase 5 packs.
rose, opium, black love, nag champa, vanilla, cinnamon, patchouli
sandalwood, blue nile, egyptian musk, coconut, rain.  free incense
holder with 12 packs.  add $3. for shipping.  ca residents add 8.25%
sales tax.  send check or money order to cynthia wiley, p.o. box 91098,
los angeles, ca 90009-1098.            int'l orders add $6. for shipping


From 75672.1174@compuserve.com  Tue Jan  3 23:15:58 1995
Return-Path: <75672.1174@compuserve.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA07868; Tue, 3 Jan 95 23:15:58 CST
Received: from dub-img-1.compuserve.com by cli.com (4.1/SMI-4.1)
	id AA04443; Tue, 3 Jan 95 21:51:52 CST
Received: by dub-img-1.compuserve.com (8.6.9/5.941228sam)
	id WAA14983; Tue, 3 Jan 1995 22:50:38 -0500
Date: 03 Jan 95 22:44:52 EST
From: "HERBERT D. KING" <75672.1174@compuserve.com>
To: <amend2-info@cs.colorado.edu>
Subject: incense 20 sticks for $1.
Message-Id: <950104034451_75672.1174_FHN114-1@CompuServe.COM>

the best incense 20 sticks for $1. minimum purchase 5 packs.			
rose, opium, black love, nag champa, vanilla, cinnamon, patchouli,		
sandalwood, blue nile, egyptian musk, coconut, rain, free incense		
holder with 12 packs. add $3 for shipping. ca residents add 8.25%		
sales tax. send check or money to cynthia wiley, p.o. box 91098,		
los angeles, ca.  90009-1098.      int'l orders add $6 for shipping		
										
										
										
							


From 75672.1174@compuserve.com  Wed Jan  4 19:45:09 1995
Return-Path: <75672.1174@compuserve.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA08208; Wed, 4 Jan 95 19:45:09 CST
Received: from dub-img-3.compuserve.com by cli.com (4.1/SMI-4.1)
	id AA07672; Wed, 4 Jan 95 18:40:50 CST
Received: by dub-img-3.compuserve.com (8.6.9/5.941228sam)
	id TAA17582; Wed, 4 Jan 1995 19:19:09 -0500
Date: 04 Jan 95 19:11:52 EST
From: "HERBERT D. KING" <75672.1174@compuserve.com>
To: <beloved@phoenix.oulu.fi>
Subject: incense 20 sticks per pack $1.
Message-Id: <950105001151_75672.1174_FHN69-3@CompuServe.COM>

the best incense 20 sticks per pack $1.  minimum purchase 5 packs.	
rose, opium, black love, nag champa, cinnamon, vanilla, patchouli,
sandalwood, blue nile, egyptian musk, coconut, rain.  free incense
holder with 12 packs.  add $3. for shipping.  ca residents add 8.25%
sales tax.  send check or money order to cynthia wiley, po box 91098,
los angeles, ca 90009-1098.           int'l orders send $6. for shipping
	


From dix@mailhost.uni-koblenz.de  Tue Jan 17 07:41:52 1995
Return-Path: <dix@mailhost.uni-koblenz.de>
Received: from cli (cli.com) by ftp.cli.com (4.1/SMI-4.1)
	id AA10547; Tue, 17 Jan 95 07:41:52 CST
Received: from infko.uni-koblenz.de (mailhost.uni-koblenz.de) by cli (4.1/SMI-4.1)
	id AA01556; Tue, 17 Jan 95 06:35:38 CST
Received: from yun.uni-koblenz.de (yun.uni-koblenz.de [141.26.5.35]) by infko.uni-koblenz.de (8.6.9/8.6.9) with SMTP id NAA00919; Tue, 17 Jan 1995 13:27:52 +0100
From: Juergen Dix <dix@informatik.uni-koblenz.de>
Message-Id: <199501171227.NAA00919@infko.uni-koblenz.de>
Received: by yun.uni-koblenz.de (4.1/KO-2.0)
	id AA12974; Tue, 17 Jan 95 13:28:03 +0100
Date: Tue, 17 Jan 95 13:28:03 +0100
To: fg121@inferenzsysteme.informatik.th-darmstadt.de,
        theorem-provers@mc.lcs.mit.edu,
        deduktion@intellektik.informatik.th-darmstadt.de,
        kgs@csdec1.tuwien.ac.at, aal@anu.edu.au, isabelle-users@cl.cam.ac.uk,
        info-hol@cs.uidaho.edu, nqthm-users@cli.com, howe@research.att.com,
        clp@cis.ohio-state.edu, flprog@informatik.uni-muenchen.de,
        clp@cis.ohio-state.edu
Cc: dix@mailhost.uni-koblenz.de
Subject: 2 Research Positions

\documentstyle[12pt]{article}
\pagestyle{empty}
\parindent 0cm
\topmargin-2cm
\textheight28cm
\addtolength{\textwidth}{2cm}
\addtolength{\oddsidemargin}{-1cm}
\begin{document}

\begin{center}

{\large \bf 2 RESEARCH POSITIONS}\\                      

\vspace{3mm}

{\bf in the Research Group ARTIFICIAL INTELLIGENCE\\
Department of Computer Science\\
University of Koblenz-Landau}\\

\end{center}

Our group consists (by now) of 4 researchers (Head: Prof.~U.~Furbach) who  
are engaged in basic research and application-oriented development 
in the areas of ``AUTOMATED REASONING'', ``NON-MONOTONIC REASONING'' 
and ``DEDUCTIVE DATABASES''.
  

We are searching outstanding scientific staff for the  
new research project on {\em Disjunctive Logic Programming\/},
(headed by Dr.~J.~Dix and Prof.~U.~Furbach)
funded by the DFG (German Research Council). 
Both research positions will be available from 
March 1, 1995, for at least 2 years. An extension for another 2
years is very likely.
Salaries are payed according to BAT IIa (approx. 66 000 DM).\\


{\em  The research topic of the project is the development of a programming
system which realizes various semantics for (extended) disjunctive
logic programs with negation. 
The underlying idea is that this goal can be achieved 
by combining {\em classical theorem proving\/}-technology
with methods from {\em nonmonotonic reasoning\/} in knowledge
representation.
In particular we want to  (1) extend  PROLOG-like languages
by disjunction and various sorts of negation, (2) develop  efficient implementations 
that can be applied  in practice, (3) investigate their use for
nontrivial applications.


The basis of the
system to be developed is PROTEIN, a first-order PTTP-like theorem
prover based on model-elimination without contrapositives. 
}\\

Minimum demand is a Master's degree in Computer Science or a comparable
qualification. Previous experience in either {\em Automated Theorem Proving\/}
or {\em Nonmonotonic Reasoning\/} is  indispensable (knowledge in both
fields is even better). 

Applicants without Ph.D. should achieve a Ph.D. in the course
of their research tasks. 

\vspace{.4cm}

Please send before February 5, 1995, your application documents to: \\
                                                                          
Dr.~J\"{u}rgen Dix\\
Institut f\"ur Informatik\\
Universit\"at Koblenz-Landau\\
Rheinau 1\\
56075 Koblenz\\
{\em Fax:\/} +49-261-9119-496\\
{\em E-mail:\/} dix@informatik.uni-koblenz.de\\

We would appreciate to receive from applicants as soon as
possible a short notification of interest (preferably by e-mail)
containing a short description of the applicant's qualification: e.g.
short CV, a list of publications, summary of master thesis or of Ph.D.
thesis, etc. Although knowledge of German is not presupposed, basic
knowledge will be appreciated. 

\end{document}

From tab95@mailhost.uni-koblenz.de  Fri Feb  3 13:32:18 1995
Return-Path: <tab95@mailhost.uni-koblenz.de>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA14134; Fri, 3 Feb 95 13:32:18 CST
Received: from infko.uni-koblenz.de (mailhost.uni-koblenz.de) by cli.com (4.1/SMI-4.1)
	id AA21059; Fri, 3 Feb 95 12:03:19 CST
Received: from verdi.uni-koblenz.de (tab95@verdi.uni-koblenz.de [141.26.4.25]) by infko.uni-koblenz.de (8.6.9/8.6.9) with SMTP id RAA11509; Fri, 3 Feb 1995 17:09:01 +0100
From: Tableaux Workshop 95 <tab95@informatik.uni-koblenz.de>
Message-Id: <199502031609.RAA11509@infko.uni-koblenz.de>
Received: by verdi.uni-koblenz.de (4.1/KO-2.0)
	id AA25410; Fri, 3 Feb 95 17:09:31 +0100
Date: Fri, 3 Feb 95 17:09:31 +0100
To: fg121@inferenzsysteme.informatik.th-darmstadt.de,
        rewriting-list@lorraine.loria.fr, theorem-provers@mc.lcs.mit.edu,
        deduktion@intellektik.informatik.th-darmstadt.de,
        kgs@csdec1.tuwien.ac.at, aal@anu.edu.au, isabelle-users@cl.cam.ac.uk,
        info-hol@cs.uidaho.edu, nqthm-users@cli.com, howe@research.att.com,
        marek@ms.uky.edu, clp@cis.ohio-state.edu
Subject: Call For Participation: Tableaux Workshop 95 
Organization: University of Koblenz, Germany

[A LaTeX version of this announcement is included below.  
 Postscript and HTML versions are available through the WWW page at
 http://www.uni-koblenz.de/~tab95/CallForParticipation.html
 This page also contains an interactive WWW registration form.]


                              preliminary

                       Call for Participation and
                            Registration form


                          Fourth  Workshop  on
               Theorem  Proving  with  Analytic  Tableaux
                         and  Related  Methods

                            May  7-10  1995

     Schloss-Hotel, castle Rheinfels, St. Goar am Rhein, Germany

This workshop is a continuation  of workshops on the  same topic held in
Lautenbach near Karlsruhe (1992),   Marseille (1993), and  Abingdon near
Oxford (1994).  Each had a wide international participation.

Scope of the Workshop
---------------------
The workshop intends to bring together researchers interested in the
mechanisation of reasoning with tableaux and related systems (analytic
tableaux, model elimination, connection method, sequent
calculi). Covered are theoretical aspects of classical and
non-classical logics, as well as topics related to practical
implementations.


Conference Site
---------------
The conference will be held in Germany at the Schloss-Hotel Rheinfels
in St. Goar, a small town founded in 1264 in the scenic Rhine valley
nearby the Loreley.  The hotel is attached to the castle Rheinfels,
which was built in the mid-16th century for defending the town of
St. Goar.

Transport
---------

St. Goar can be easily reached by train.  The trip from Frankfurt
International Airport takes about 90 minutes and trains run on the
hour. A timetable will be sent together with the registration 
confirmation.

Invited speakers
----------------
- Wolfgang Bibel, Technische Universitat Darmstadt, Germany 
- Ricardo Caferra, LIFIA-IMAG, Grenoble, France 

Registration
------------
o The registration fee is DM 260 (approx. US$ 156)
  for early registration, to be paid  in advance before March,
  15, 1995. The late registration fee is DM 350 (approx. US$ 210).

  The registration fee includes: admission to the entire conference
  program including technical sessions and poster sessions, the
  conference dinner, and a copy  of the proceedings (Springer LNAI) 
  of the conference.

o Accomodation will be about DM 160,-- (approx. US$ 100) per person
  and day, including all meals and coffee breaks. 
  The exact amount depends on the number of participants.
  Accomodation is to be paid on site.

o The rooms are assigned on a first-come-first-served basis. In case
  the conference site accomodation capabilities are exhausted we will 
  reserve rooms in a hotel within walking distance.

o We will be able to give a reduction on the registration fee and
  accomodation to a limited number of students and colleagues from Eastern
  Europe. Applicants should contact the registration address (see
  below).

o For registration please either use the registration form at the WWW
  page accessible through 
        http://www.uni-koblenz.de/~tab95/CallForParticipation.html
  or the registration form included below.


Program Committee
-----------------
Peter Baumgartner, Univ. of Koblenz, Germany
Krysia Broda, Imperial College London, U.K.
Marcello D'Agostino,Imperial College London, U.K.
Melvin Fitting, CUNY, New York City, U.S.A.
Ulrich Furbach, Univ. of Koblenz, Germany
Dov Gabbay, Imperial College London, U.K.
Rajeev Gore', Australian National University, Australia
Jean Goubault, Bull Research Paris, France
Reiner H"ahnle, Univ. of Karlsruhe, Germany
Ryuzo Hasegawa, ICOT, Tokyo, Japan
Rob Johnson, Manchester Metrop. Univ., U.K.
Thomas K"aufl, Univ. of Karlsruhe, Germany
Reinhold Letz, Technical Univ. of Munich, Germany
Neil Murray, SUNY at Albany, U.S.A.
Ugo Moscato, Univ. of Milano, Italy
Joachim Posegga, Univ. of Karlsruhe, Germany
Peter Schmitt, Univ. of Karlsruhe, Germany
Camilla Schwind, LIM-CNRS, Univ. of Marseille, France
Graham Wrightson, Univ. of Newcastle, Australia

Organising Committee
--------------------
Peter Baumgartner, Univ. of Koblenz, Germany
Ulrich Furbach, Univ. of Koblenz, Germany
Reiner H"ahnle, Univ. of Karlsruhe, Germany
Joachim Posegga, Univ. of Karlsruhe, Germany

Local arrangements and registration address
-------------------------------------------

Ulrich Furbach
Computer Science Institute
University of Koblenz
Rheinau 1
56075 Koblenz, Germany

Fax:  ++ 49  261  9119  499
Phone: ++ 49  261  9119  433
E-mail:  tab95@informatik.uni-koblenz.de



Programme (preliminary -- no time table yet)
-------------------------------------------

Beginning of Conference: Monday,    May,  8, 9 am
End  of Conference:      Wednesday, May, 10, noon

That is, arrival is recommended at Sunday, May, 7.

Social events:
 - Conference dinner, medieval style, at Monday evening.
 - Guided tour through the medieval castle. 

Invited talks will be given by Wolfgang Bibel (Technische Universitat
Darmstadt) and Ricardo Caferra (LIFIA-IMAG, Grenoble, France); 
a banquet speech will be held.

We will have 21 talks presenting full papers and 4 talks presenting
short papers. Additionally, we will organize a poster session.

Full papers to be presented:
--------------------------------------------

Matthias Baaz and Christian G. Fermueller: 
	Nonelementary Speedups between Different Versions of Tableaux

Peter Baumgartner and Frieder Stolzenburg: 
	Constraint Model Elimination and a PTTP-Implementation

Stephane Demri: 
	Using Connection Method in Modal Logics: Some dvantages

Guido Governatori: Labelled Tableaux for Multi-Modal Logics

Philippe de Groote: 
	Linear Logic with Isabelle: Pruning the Proof Search Tree

Alain Heuerding, Gerhard Jaeger, Stefan Schwendimann and Michael
	Seyfried: Propositional Logics on the Computer

Joerg Hudelmaier and Peter Schroeder-Heister: 
	Classical Lambek Logic

Stefan Klingenbeck: 
	Generating Finite Counter Examples with Semantic  Tableaux

Eric de Kogel: Rigid E-Unification Simplified

Michael Kohlhase: Higher-Order Tableaux

Jan Komara and Paul J. Voda: 
	Syntactic Reduction of Predicate Tableaux to Propositional
	Tableaux.  

Klaus Mayr: Link Deletion in Model Elimination

Robert K. Meyer, Michael A. McRobbie and Nuel D. Belnap, Jr: 
	Linear analytic tableaux

Ugo Moscato: Refutation systems for propositional modal logics.

Gerd Neugebauer and Uwe Petermann: 
	Specification of Inference Rules  and their Automatic Translation

Ingrid Neumann: Semantic Tableaux for Inheritance Nets

Jens Otten and Christoph Kreitz: 
	A Connection Based Proof Method for Intuitionistic  Logic
        
Jeremy Pitt: 
	MacKE: Yet Another Proof Assistant & Automated  Pedagogic Tool

Stephan Schmitt and Christoph Kreitz: 
	On Transforming Intuitionistic Matrix Proofs into Standard 
	Sequent Proofs

Johann Schumann: 
	Using the Theorem Prover SETHEO for verifying the
        development of a Communication Protocol in FOCUS 
        --- a case study ---

Judith Underwood: 
	Tableau for Intuitionistic Predicate Logic as  Metatheory


Short papers to be presented:
-----------------------------
Peter B. Andrews: 
	An Example of Proof Search in TPS: A Theorem  Proving System
	for Classical Type Theory. 

Didier Galmiche and Jean-Yves Marion: 
	Semantic Proof Search Methods for ALL --- A First Approach
	--- 

Rajeev Gore:  
	Intuitionistic Logic Redisplayed.

N. Murray, A. Ramesh and E. Rosenthal: 
	Semi-Resolution: An Inference Rule and its Application to
	Prime Implicate Problems.


Posters to be presented:
------------------------
Robert Johnson: Communicating Agents for Concurrent Temporal Tableaux.
Paula Gouveia and Cristina Sernadas: Abduction in Object Specification
        using Tableaux.
Krysia Broda and Marcelo Finger: The KE-tableau Method applied to
        Linear Logic Theorem Proving.
J. M. Coldwell and Graham Wrightson: Link Inheritance in Tableaux.
Kevin Wallace and Graham Wrightson: Truncation Techniques in
        First-Order Clausal Tableaux.
Anatoli Degtyarev and Andrei Voronkov: Equality elimination for
        semantic tableaux.
Daniel S. Korn and Christoph Kreitz: On Testing Irreflexivity of
        Reduction Orderings for Combined Substitutions in Intuitionistic
        Matrix Proofs.
Roderick A. Girle: Tableau for Ternary Semantics.
A. Gavilanes, J. Leach and S. Nieva: Reasoning with Preorders using Free
        Variable Semantic Tableaux.


------- end of list ----------------------------------------------------


Workshop sponsors:
-----------------
Deutsche Forschungsgemeinschaft (DFG), University of Karlsruhe, 
University of Koblenz, Gesellschaft fuer Informatik (GI),
Ministry of Trade and Commerce Rheinland-Pfalz.



Registration Form
-----------------

-------------------------------- cut here ------------------------------


                        Conference and Accomodation
               Registration form for T A B L E A U X - 9 5


To be returned to the REGISTRATION ADDRESS: 
  Ulrich Furbach, Computer Science Institute, University of Koblenz,
  Rheinau 1, 56075 Koblenz, Germany, E-mail: tab95@informatik.uni-koblenz.de


Personal Information:

Family name: ................................ First name: ..............

Affiliation: ...........................................................

             ...........................................................

Address:     ...........................................................

             ...........................................................

             ...........................................................

E-mail:      ...........................................................

Tel.:        .......................... Fax.: ..........................

Accompanying person(s): ................................................


Accomodation:

My arrival date will be:   .............................................

My departure date will be: .............................................

Please reserve for me:  

First choice accomodation type:

                        ..... single room(s)
                        ..... double room(s) to be shared with

             ...........................................................


Second choice accomodation type:

                        ..... single room(s)
                        ..... double room(s) to be shared with

             ...........................................................


Special dietary requirements: None       [ ]
                              Vegetarian [ ]
                              Kosher     [ ]


Registration fee payment
------------------------
DM 260 -- early (i.e. before March 15), DM 350 --late.
Please tick one:

[ ] Payment by credit card:

    Credit Card Company: Eurocard/Mastercard      [ ]
    (tick one)           VISA                     [ ]
                         American Express         [ ]

    Cardholders Name:    ...................................................

    Credit card number:  ...................................................

    Expiration date:     ...................................................

[ ] Payment by cheque in German currency (DM) drawn on a German bank;
    please make cheques payable to "Ulrich Furbach, Tableau-Workshop",
    indicate your name and return it to the registration address.

    IMPORTANT NOTE: all extra fees emerging from cheque payment must be 
                    covered by the applicant!

[ ] Payment by money order in German currency (DM) to this bank account:

       Bank:           Sparkasse Koblenz
       Bank Code       57050120
       (Bankleitzahl)   

       Account Holder: Ulrich Furbach, Tableau-Workshop
       Account:        41003518

    IMPORTANT NOTE: all extra fees emerging from money order  payment 
                    must be covered by the applicant!


Signature
---------


     ..................             ..............................
           Date                               Signature



For any administrative queries regarding registration or bookings
please contact Ulrich Furbach, E-mail: tab95@informatik.uni-koblenz.de Tel:
+49-(0)261-9119-426 Fax: +49-(0)261-9119-499


------------- cut here ---------------------------

%%%% LaTeX version follows:
\documentstyle[11pt]{article}
\pagestyle{empty}
\nonstopmode\parindent=0pt\parskip=0pt\topsep=0pt\itemsep=0pt
\textheight=660pt\textwidth=470pt\topmargin=0pt
\oddsidemargin=0pt\evensidemargin=0pt\abovedisplayskip=0pt
\belowdisplayskip=0pt\leftmargin=.4cm
\begin{document}
\vspace*{-1cm}
\begin{quote}
  \small  Postscript and HTML versions of this call for participation 
are available through the  WWW page at 
 \verb|http://www.uni-koblenz.de/~tab95/CallForParticipation.html|
 This page also contains an interactive WWW registration form.
\end{quote}

\begin{center}
{preliminary}\\[5mm]

 {\large\bf Call for Participation and \\ Registration form}\\[5mm]

 {\Large\bf Fourth Workshop on\\[2mm]

 \Large\bf Theorem Proving
 with Analytic Tableaux \\[2mm]

 \Large\bf and Related Methods\\[5mm]{\bf May 7--10 1995}}\\[5mm]

 Schlo{\ss}-Hotel, castle ``Rheinfels'',
 St.~Goar am Rhein, Germany
\end{center}

This workshop is a continuation of workshops on the same topic held in
Lautenbach near Karlsruhe (1992), Marseille (1993), and Abingdon near
Oxford (1994). Each had a wide international participation. 

\subsection*{Scope of the Workshop}
The workshop intends to bring together researchers interested in the
mechanisation of reasoning with tableaux and related systems (analytic
tableaux, model elimination, connection method, sequent
calculi). Covered are theoretical aspects of classical and
non-classical logics, as well as topics related to practical
implementations.

\subsection*{Conference Site} The conference will be held in Germany at the
Schlo{\ss}-Hotel Rheinfels in St.~Goar, a small town founded in 1264 in
the scenic Rhine valley nearby the Loreley. The hotel is attached to the
castle Rheinfels, which was built in the mid-$16^{\mbox{th}}$ century
for defending the town of St.~Goar.

\subsection*{Transport} St.~Goar can be easily reached by train.  
The trip from Frankfurt
International Airport takes about 90 minutes and trains run on the
hour. A timetable will be sent together with the registration 
confirmation.


\subsection*{Registration}
\begin{itemize}
\item The registration fee is DM 260 (approx. US\$ 156)
  for early registration, to be paid  in advance before March,
  15, 1995. The late registration fee is DM 350 (approx. US\$ 210).

  The registration fee includes: admission to the entire conference
  program, including technical sessions and poster sessions, the
  conference dinner, and a copy of the proceedings (Springer LNAI) of
  the conference.

\item Accomodation will be about DM 160,-- (approx. US\$ 100) per person
  and day, including all meals and coffee breaks. 
  The exact amount depends on the number of participants.
  Accomodation is to be paid on site.

\item The rooms are assigned on a first-come-first-served basis. In case
  the conference site accomodation capabilities are exhausted we will 
  reserve rooms in a hotel within walking distance.

\item We will be able to give a reduction on the registration fee and
  accomodation to a limited number of students and colleagues from Eastern
  Europe. Applicants should contact the registration address (see
  below).

\item For registration please either use the registration form at the WWW
  page accessible through \\
        \verb|http://www.uni-koblenz.de/~tab95/CallForParticipation.html|
  or the registration form included below.
\end{itemize}

\subsection*{Invited speakers}
Wolfgang Bibel, Technische Universit\"{a}t Darmstadt, Germany \\
Ricardo Caferra, LIFIA-IMAG, Grenoble, France


\subsection*{Program Committee}

\begin{tabular}{@{}p{8cm}p{8cm}@{}}
Peter Baumgartner, Univ.~of Koblenz, Germany &
Krysia Broda, Imperial College London, U.K.\\
Marcello D'Agostino, \flushright Imperial College London, U.K. &
Melvin Fitting, CUNY, New York City, U.S.A.\\
Ulrich Furbach, Univ.~of Koblenz, Germany &
Dov Gabbay, Imperial College London, U.K.\\
Rajeev Gor\'e, \flushright
Australian National University, Australia &
Jean Goubault, Bull Research Paris, France\\
Reiner H\"ahnle, Univ.~of Karlsruhe, Germany &
Ryuzo Hasegawa, ICOT, Tokyo, Japan\\
Rob Johnson, Manchester Metrop.~Univ., U.K. &
Thomas K\"aufl, Univ.~of Karlsruhe, Germany\\
Reinhold Letz,\flushright Technical Univ.~of Munich, Germany &
Neil Murray, SUNY at Albany, U.S.A. \\
Ugo Moscato, Univ.~of Milano, Italy &
Joachim Posegga, Univ.~of Karlsruhe, Germany\\
Peter Schmitt, Univ.~of Karlsruhe, Germany &
Camilla Schwind,{\flushright \mbox{}\hfill LIM-CNRS, Univ.~of Marseille, France}\\
Graham Wrightson,\flushright  Univ.~of Newcastle, Australia &\\
\end{tabular}

\subsection*{Organising Committee}

\begin{tabular}{@{}p{8cm}p{8cm}@{}}
Peter Baumgartner, Univ.~of Koblenz, Germany &
Ulrich Furbach, Univ.~of Koblenz, Germany\\
Reiner H\"ahnle, Univ.~of Karlsruhe, Germany &
Joachim Posegga, Univ.~of Karlsruhe, Germany
\end{tabular}

\subsection*{Local arrangements and registration address}
\parbox[t]{8cm}{%
{\bf Ulrich Furbach} \\
Computer Science Institute\\
University of Koblenz\\
Rheinau 1\\
56075 Koblenz,
Germany}
\parbox[t]{7cm}{%
Fax: ${\scriptstyle ++}49-261-9119-499$\\
Phone:\,${\scriptstyle ++}49-261-9119-433$\\
E-mail: {\tt tab95}@{\tt informatik.uni-koblenz.de}}
\newpage 

\section*{Programme}
Preliminary --- no time table yet.

\begin{description}
\item[\em Beginning of Conference:] Monday,~May,~8,~9~am
\item[\em End of Conference:] Wednesday,~May,~10,~noon\\
That is, arrival is recommended at Sunday, May, 7.

\item[\em Social events:] Conference dinner, medieval style, 
at Monday evening.\\
Guided tour through the medieval castle. 

\item[\em Invited talks] will be given by Wolfgang Bibel
 (Technische Universitat
Darmstadt, Germany) and Ricardo Caferra (LIFIA-IMAG, Grenoble, France); 
a banquet speech will be held.
\end{description}

We will have 21 talks presenting full papers and 4 talks presenting
short papers. Additionally, we will organize a poster session.

\subsection*{Full papers to be presented:}
\begin{description}
\item[\rm Matthias Baaz and Christian G.~Ferm\"{u}ller:]
	Nonelementary Speedups between Different Versions of Tableaux.

\item[\rm Peter Baumgartner and Frieder Stolzenburg:]
	Constraint Model Elimination and a {PTTP}-Implementation.

\item[\rm St\'{e}phane Demri:]
	Using Connection Method in Modal Logics: Some dvantages.

\item[\rm Guido Governatori:]
Labelled Tableaux for Multi-Modal Logics.

\item[\rm Philippe de Groote:]
	Linear Logic with {I}sabelle: Pruning the Proof Search Tree.

\item[\rm Alain Heuerding, Gerhard J\"{a}ger, Stefan Schwendimann and 
Michael Seyfried:]
Pro\-po\-si\-tio\-nal Logics on the Computer.

\item[\rm J\"{o}rg Hudelmaier and Peter Schroeder-Heister:]
	Classical {L}ambek Logic.

\item[\rm Stefan Klingenbeck:]
	Generating Finite Counter Examples with Semantic  Tableaux.

\item[\rm Eric de Kogel:] Rigid $E$-Unification Simplified.

\item[\rm Michael Kohlhase:]
Higher-Order Tableaux.

\item[\rm J\'{a}n Komara and Paul J.~Voda: ]
	Syntactic Reduction of Predicate Tableaux to Propositional
	Tableaux.  

\item[\rm Klaus Mayr: ]
Link Deletion in Model Elimination.

\item[\rm Robert K. Meyer, Michael A. McRobbie and Nuel D. Belnap, Jr: ]
	Linear analytic tab\-le\-aux.

\item[\rm Ugo Moscato:] Refutation systems for propositional modal logics.

\item[\rm Gerd Neugebauer and Uwe Petermann: ]
	Specification of Inference Rules  and their Automatic Translation.

\item[\rm Ingrid Neumann: ]
Semantic Tableaux for Inheritance Nets.

\item[\rm Jens Otten and Christoph Kreitz: ]
	A Connection Based Proof Method for Intuitionistic  Logic.
        
\item[\rm Jeremy Pitt: ]
	Mac{KE}: Yet Another Proof Assistant \& Automated  Pedagogic Tool.

\item[\rm Stephan Schmitt and Christoph Kreitz: ]
	On Transforming Intuitionistic Matrix Proofs into Standard 
	Sequent Proofs.

\item[\rm Johann Schumann: ]
	Using the Theorem Prover {SETHEO} for verifying the
        development of a Communication Protocol in {FOCUS} 
        --- a case study ---

\item[\rm Judith Underwood: ]
	Tableau for Intuitionistic Predicate Logic as  Metatheory.
\end{description}

\subsection*{Short papers to be presented:}
{\parsep=0pt
\begin{description}
\item[\rm Peter B.~Andrews: ] 
	An Example of Proof Search in {TPS}: A Theorem  Proving System
	for Classical Type Theory. 
\item[\rm Didier Galmiche and Jean-Yves Marion: ]
	Semantic Proof Search Methods for {ALL} --- A First Approach
	--- 
\item[\rm Rajeev Gor\'{e}:  ]
	Intuitionistic Logic Redisplayed.
\item[\rm N.\ Murray, A.\ Ramesh and E.\ Rosenthal: ]
	Semi-Resolution: An Inference Rule and its Application to
	Prime Implicate Problems.
\end{description}
}

\subsection*{Posters to be presented:}
{\em Robert Johnson:} Communicating Agents for Concurrent Temporal Tableaux.
{\em Paula Gouveia and Cristina Sernadas:} Abduction in Object Specification
        using Tableaux.
{\em Krysia Broda and Marcelo Finger:} The {KE}-tableau Method applied to
        Linear Logic Theorem Proving.
{\em J.~M.~Coldwell and Graham Wrightson:} Link Inheritance in Tableaux.
{\em Kevin Wallace and Graham Wrightson:} Truncation Techniques in
        First-Order Clausal Tableaux.
{\em Anatoli Degtyarev and Andrei Voronkov:} Equality elimination for
        semantic tableaux.
{\em Daniel S.~Korn and Christoph Kreitz:} On Testing Irreflexivity of
        Reduction Orderings for Combined Substitutions in Intuitionistic
        Matrix Proofs.
{\em Roderick A.~Girle:} Tableau for Ternary Semantics.
{\em A.~Gavilanes, J.~Leach and S.~Nieva:} Reasoning with Preorders using Free
        Variable Semantic Tableaux.

\vfill



\begin{center}
{\bf Workshop sponsors:} \\Deutsche Forschungsgemeinschaft (DFG), University of
Karlsruhe, University of Koblenz, Gesellschaft f\"ur Informatik (GI),
Ministry of Trade and Commerce Rheinland-Pfalz.
\end{center}

\newpage
\begin{center}
\Large\bf
                        Conference and Accomodation 
               Registration form for T~A~B~L~E~A~U~X~-~9~5
  
\end{center}
\medskip

To be returned to the {\bf registration address}: 
Ulrich Furbach, Computer Science Institute, 
University of Koblenz, Rheinau 1, 56075 Koblenz, Germany.

\subsection*{Personal Information:}
\begin{verbatim}

Family name: ................................ First name: ..............

Affiliation: ...........................................................

             ...........................................................

Address:     ...........................................................

             ...........................................................

             ...........................................................

E-mail:      ...........................................................

Tel.:        .......................... Fax.: ..........................

Accompanying person(s): ................................................
\end{verbatim}

\subsection*{Accommodation}
\begin{verbatim}
My arrival date will be:   .............................................

My departure date will be: .............................................

Please reserve for me:  

First choice accomodation type:

                        ..... single room(s)
                        ..... double room(s) to be shared with

             ...........................................................

Second choice accomodation type:

                        ..... single room(s)
                        ..... double room(s) to be shared with

             ...........................................................


Special dietary requirements: None       [ ]
                              Vegetarian [ ]
                              Kosher     [ ]

\end{verbatim}

\subsection*{Registration fee payment}
DM 260 -- early (i.e. before March 15), DM 350 -- late. Please tick one:\\
\begin{verbatim}
[ ] Payment by credit card:

    Credit Card Company: Eurocard/Mastercard      [ ]
    (tick one)           VISA                     [ ]
                         American Express         [ ]

    Cardholders Name:    ...................................................

    Credit card number:  ...................................................

    Expiration date:     ...................................................

[ ] Payment by cheque in German currency (DM) drawn on a German bank;
    please make cheques payable to "Ulrich Furbach, Tableau-Workshop",
    indicate your name and return it to the registration address.

    IMPORTANT NOTE: all extra fees emerging from cheque payment must be 
                    covered by the applicant!

[ ] Money order in German currency (DM) to this bank account:

        Bank:           Sparkasse Koblenz
        Bank Code       57050120
        (Bankleitzahl)   

        Account Holder: Ulrich Furbach, Tableau-Workshop
        Account:        41003518

    IMPORTANT NOTE: all extra fees emerging from money order  payment 
                    must be covered by the applicant!
\end{verbatim}
\subsection*{Signature}
\begin{verbatim}


     ..................             ..............................
           Date                               Signature
\end{verbatim}


\vfill 

For any administrative queries regarding registration or bookings
please contact U. Furbach, E-mail:
\verb|tab95@informatik.uni-koblenz.de|,
 Tel: \verb|+49-(0)261-9119-426|,  Fax: \verb|+49-(0)261-9119-499|



\end{document}

From porfirio@rio.cos.ufrj.br  Sun Feb  5 14:47:13 1995
Return-Path: <porfirio@rio.cos.ufrj.br>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA00171; Sun, 5 Feb 95 14:47:13 CST
Received: from cos.ufrj.br (rio.cos.ufrj.br) by cli.com (4.1/SMI-4.1)
	id AA00666; Sun, 5 Feb 95 13:57:15 CST
Received: by cos.ufrj.br (4.1/SMI-4.1)
	id AA03424; Sun, 5 Feb 95 17:59:23 EDT
Date: Sun, 5 Feb 95 17:59:23 EDT
From: porfirio@rio.cos.ufrj.br (Pedro Porfirio Muniz Farias)
Message-Id: <9502051959.AA03424@cos.ufrj.br>
To: nqthm-users@cli.com
Subject: subscribe

porfirio@cos.ufrj.br

From kaufmann@cli.com  Mon Feb 13 14:51:23 1995
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA02052; Mon, 13 Feb 95 14:51:23 CST
Received: from thunder.cli.com by cli.com (4.1/SMI-4.1)
	id AA19663; Mon, 13 Feb 95 12:52:35 CST
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder.cli.com (4.1) id AA03887; Mon, 13 Feb 95 10:14:18 CST
Date: Mon, 13 Feb 95 10:14:18 CST
Message-Id: <9502131614.AA03887@thunder.cli.com>
To: nqthm-users@cli.com
Subject: Nqthm as push-button technology

There is a point of view about using Nqthm and ACL2 that is probably shared to
some extent by most or all of the successful users, but may not be widely
known.  (Some version of this point is also made in an Nqthm tutorial I've
co-authored with Paolo Pecchiari; see CLI Tech Report 100, available from
http://www.cli.com.)

Here is that point of view:  Success in using Nqthm is almost entirely a
function of one's ability to focus on goals that are not simplified by the
prover, and then formulate elegant rewrite rules that allow the prover to
proceed past those points.  (I've created a "checkpoint" tool that is available
in the Pc-Nqthm distribution, but it's easy to recognize such goals by looking:
they are ones about which the prover does NOT say something like "this
simplifies to...".)

Granted, there are other factors that are useful on occasion, such as:

* Using ACCUMULATED-PERSISTENCE and related tools to monitor the application of
  large databases of definitions and rewrite rules;

* Proving useful properties of functions and then disabling those functions;

* Aiming for simplicitity in one's formalizations; and,

* Checking that heuristically-generated induction schemes produce the expected
  inductive hypotheses.

But, what is almost NEVER useful is knowledge of the theorem prover's
heuristics.

OK, that's perhaps too strong a statement.  As Bob Boyer has pointed out to me,
it is important to know some basics, such as (to paraphrase him somewhat):

* Equations are used as rewrite rules by rewriting instances of the left side
  to instances of the right side.

* Rewriting is done inside-out.

Nevertheless, I personally believe that once one has learned the mechanics of
Nqthm, what I've said here is the majority of what needs to be learned in order
to use Nqthm well, especially:  knowing to look in the output for the first
goal that does not simplify to another goal.

So for example, it probably isn't too important to understand the
generalization heuristic, the details of when the system opens up calls of
recursively defined functions, or the way cross-fertilization works.

I'd be surprised if everyone on this list agrees with me.  It would be
interesting to see simple examples that contradict my claim by showing how one
needs to know more than I've suggested.

-- Matt Kaufmann

From kaufmann@cli.com  Wed Feb 15 18:09:13 1995
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA02552; Wed, 15 Feb 95 18:09:13 CST
Received: from thunder.cli.com by cli.com (4.1/SMI-4.1)
	id AA27764; Wed, 15 Feb 95 17:11:25 CST
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder.cli.com (4.1) id AA01124; Wed, 15 Feb 95 17:11:48 CST
Date: Wed, 15 Feb 95 17:11:48 CST
Message-Id: <9502152311.AA01124@thunder.cli.com>
To: nqthm-users@cli.com
Subject: Push-button?  Oh, REALLY?

Well, I've gotten three thoughtful replies to the message I sent a couple of
days ago about ``Nqthm as push-button technology.''  I'll assume that those
senders (and any others that come later) don't object to my summarizing their
replies when a few more have come in, and sending them out.  At that point I'll
try to refine my claims (which I have to admit were somewhat overblown) about
the successful use of Nqthm.  Perhaps the most important thing I forgot to take
into account is that on larger proofs, one typically has to think of a
strategy, not just ``react'' to the prover by looking at failed goals.  (This
point is, I think, made in the tutorial I mentioned.)

Anyhow, I'll see if I can re-formulate my position in a few days.  Please
contribute (either directly to the list, or just to me for later integration)
any comments on the subject that you care to make.

Thanks --
-- Matt Kaufmann

From weberwu@tfh-berlin.de  Wed Feb 22 05:41:34 1995
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01006; Wed, 22 Feb 95 05:41:34 CST
Received: from cha01.tfh-berlin.de by cli.com (4.1/SMI-4.1)
	id AA14558; Wed, 22 Feb 95 04:08:19 CST
Received: from sun17.tfh-berlin.de by cha01.tfh-berlin.de via SMTP (931110.SGI/930416.SGI)
	for nqthm-users@cli.com id AA10784; Wed, 22 Feb 95 11:08:45 GMT
Return-Path: <weberwu@tfh-berlin.de>
Received: by tfh-berlin.de (5.0/SMI-SVR4)
	id AA13451; Wed, 22 Feb 1995 11:11:32 --100
Date: Wed, 22 Feb 1995 11:11:32 --100
From: weberwu@tfh-berlin.de (Debora Weber-Wulff)
Message-Id: <9502221011.AA13451@tfh-berlin.de>
To: nqthm-users@cli.com
Subject: Recent proofs with nqthm?
X-Sun-Charset: US-ASCII
Content-Length: 668

Hello to all!

I will be giving a talk end of next week here in Germany on nqthm for some
hardware oriented people. I have a slide with "proofs done with NQTHM"
and a bibliography, I believe I have pretty much everything up until
the summer of 94. Any newer TechReports/Journal articles/Whatever
on proofs that have been done? Please mail me at weberwu@tfh-berlin.de

We will be discussing the usefulness of nqthm as a proof tool, any
comments such as Matt Kaufmann's from last week much appreciated, both
positive and negative. Please indicate if I can use your comment in a
summary, or if you would rather it remain anonymous.

Thanks!
Debora Weber-Wulff
TFH Berlin


From laurence@gyptis.univ-mrs.fr  Fri Feb 24 12:43:11 1995
Return-Path: <laurence@gyptis.univ-mrs.fr>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01726; Fri, 24 Feb 95 12:43:11 CST
Received: from gyptis.univ-mrs.fr (protis.univ-mrs.fr) by cli.com (4.1/SMI-4.1)
	id AA22495; Fri, 24 Feb 95 11:41:09 CST
Received: by gyptis.univ-mrs.fr (4.1/1.34)
	id AA29297; Fri, 24 Feb 95 18:35:04 GMT 
Date: Fri, 24 Feb 95 18:35:04 GMT
From: laurence@gyptis.univ-mrs.fr (Laurence Pierre)
Message-Id: <9502241835.AA29297@gyptis.univ-mrs.fr>
To: nqthm-users@cli.com
Subject: RE: Recent proofs with nqthm?



>> Hello to all!
>>
>> I will be giving a talk end of next week here in Germany on nqthm for some
>> hardware oriented people. I have a slide with "proofs done with NQTHM"
>> and a bibliography, I believe I have pretty much everything up until
>> the summer of 94. Any newer TechReports/Journal articles/Whatever
>> on proofs that have been done? Please mail me at weberwu@tfh-berlin.de
>>
>> We will be discussing the usefulness of nqthm as a proof tool, any
>> comments such as Matt Kaufmann's from last week much appreciated, both
>> positive and negative. Please indicate if I can use your comment in a
>> summary, or if you would rather it remain anonymous.
>>
>> Thanks!
>> Debora Weber-Wulff
>> TFH Berlin

At the end of March, I will also be giving a lecture on Nqthm, to French
PhD students. I intend to mention the current state-of-the-art of
developments with Nqthm (in particular in the field of hardware verification).
So, if you have a complete reference list, I will be interested in
getting it. Could you please send me this information ?

A summary of my comments about the usefulness of Nqthm for hardware
verification is the following :
I have been using Nqthm since 1988 (it was not called Nqthm at that
time, as far as I know !). My work is aiming at :
   - using Nqthm for verifying the observational equivalence of digital
     devices (I did not investigate the verification of temporal properties,
     for instance),
   - defining everything that is needed for reasoning with Nqthm on
     circuit descriptions preliminary given in a Hardware Description
     Language (VHDL for instance) : methods for tranlating from the HDL
     to Nqthm, and specialized methods (in particular for generalization) 
     for "adapting" the obtained Nqthm events before starting the proof
     process.
In our team, we have been comparing Nqthm with other provers, with respect
to these 2 aspects, in particular with OBJ3 and the Larch Prover. My own 
conclusion about this comparison is that Nqthm gives more satisfying
results than the others :
   - induction is fully mechanized (this aspect is very useful for us,
     either for reasoning on synchronous devices - induction on time -
     or for reasoning on replicated architectures - induction on the
     structure - ), and the induction mechanism did not exist in OBJ3 
     (when we experimented with it, I don't know if it exists now), and 
     is less elaborate in LP than in Nqthm.
   - as far as I know, it is also the only prover which implements a
     generalization heuristics (which is also very useful for us).
   - it is not too difficult to express structural or behavioural
     circuit descriptions in the Boyer-Moore logic (in particular, it
     was less easy in OBJ3, at least for us !!).
   - and finally, using Nqthm requires less expertise than for instance
     HOL or COQ.
Those are my main conclusions, but many other things can be said about
the advantages of Nqthm !

Kind regards,

Laurence PIERRE
CMI/Universite de Provence
39 rue Joliot-Curie
13453 Marseille cedex 13
FRANCE
e-mail : laurence@gyptis.univ-mrs.fr

From kaufmann@cli.com  Tue Feb 28 20:46:18 1995
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA02446; Tue, 28 Feb 95 20:46:18 CST
Received: from thunder.cli.com by cli.com (4.1/SMI-4.1)
	id AA03396; Tue, 28 Feb 95 19:44:26 CST
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder.cli.com (4.1) id AA07271; Tue, 28 Feb 95 19:44:58 CST
Date: Tue, 28 Feb 95 19:44:58 CST
Message-Id: <9503010144.AA07271@thunder.cli.com>
To: nqthm-users@cli.com
Subject: follow-up

Hello, Nqthm users (and watchers) --

This is a follow-up to my message about Nqthm as ``push-button'' technology.
Several Nqthm users have since made the point, in various ways, that the
message may well have suggested that Nqthm is easier to use than it really is.
I'm certainly sorry about that, and now I hope to remedy the situation by
giving a fairly detailed list of what I believe are important things to
understand in order to use Nqthm successfully.  I appreciate the help I've
gotten through recent discussions several colleagues at CLInc (Bill Bevier,
Larry Smith, Mike Smith, Matt Wilding, Bill Young) in coming up with this list,
which by the way was drawn heavily from the Nqthm tutorial I co-authored with
Paolo Pecchiari, available as CLInc tech report 100 (see URL
http://www.cli.com).  I've also had useful feedback from Debbie Weber-Wulff and
Laurence Pierre.  Of course, a lot of what I think I know about this stuff is
the result of insights provided by Bob Boyer and J Moore (see also their book,
[ACLH], which I'll refer to below).

My overall general point is that although it is useful to understand certain
things about Nqthm's prover when you use it, it is often the case that you do
not have to be able to predict what the prover will do.  Rather, you have to
know how to cope with failures by the prover.  In other words:  What I meant by
"Nqthm as push-button technology" was that one may view Nqthm as a black box
that either succeeds in its proof attempt or else generates an unproved,
simplified goal ("checkpoint" -- see item C1 below) that should be inspected.

I'll organize the list of "things to know" into several sublists.  I suppose
that this organization is a bit artificial, and the sections overlap, but
perhaps it makes the whole thing a bit easier to swallow.  Let me admit up
front that this is just a summary; many details are omitted.

OUTLINE:
A. Nqthm basics
B. Strategies for creating events
C. Dealing with failed proofs
D. Performance tips
E. Miscellaneous tips and knowledge
F. Some things you DON'T need to know
G. References

I'd be very interested in suggested improvements to this note.  By the way,
this is all written under the assumption that Nqthm is to be used
interactively, as it almost always is.  I haven't thought about all this nearly
as much in the context where Nqthm is to succeed totally automatically or else
we consider its use to be a failure.

NOTE:  I have NOT put the items below in any particular order.  Some of the
later ones may be more important than some of the early ones.

	 ============================================================

A. Nqthm basics

A1. The Nqthm logic (see Chapters 2 and 4 of [ACLH])

This is a logic of total functions.  For example, if A and B are less than or
equal to each other, then we need to know something more in order to conclude
that they are equal (e.g., that they are numbers).  This kind of twist is
important in writing definitions; for example, if you expect a function to
return a number, you may want to apply the function FIX in case one of the
formals is to be returned as the value.

Nqthm's notion of ordinals is important on occasion in supplying "measure
hints" for the acceptance of recursive definitions.

A2. Commands

Nqthm users must (of course) know its commands (defn, prove-lemma, ch, ...),
including hints.  (One can look up the details, but it's useful to know what is
available.)  For example, ENABLE and DISABLE commands and hints are important,
and they distinguish between a function and its executable counterpart.

A3. Simplification

The Nqthm simplifier is basically a rewriter, with some ``linear arithmetic''
thrown in.  One needs to understand the notion of conditional rewriting, in
Nqthm includes the application of (conditional) rewrite rules and also the
opening up of function definitions, with relatively little heuristic control if
the definition is nonrecursive.  One needs to know that rewriting is from the
inside out in Nqthm.  It is helpful to realize that rewrite rules should
"simplify" and that they can be "permutative" (see [ACLH]).  See also B4 below.

A4. Parsing of rewrite rules

Nqthm parses rewrite rules as explained in [ACLH].  Roughly, a term

(implies (and hyp1 hyp2 ... hypn)
	 (equal lhs rhs))

is stored as a conditional rewrite rule, whose left side is lhs, right side is
rhs, and hypotheses are {hyp1, hyp2, ... hypn}.  However, there are some
variations.  For example,

(implies (and hyp1 hyp2 ... hypn)
	 (not term))

is really the same as

(implies (and hyp1 hyp2 ... hypn)
	 (equal term f))

while

(implies (and hyp1 hyp2 ... hypn)
	 term)

is generally the same as

(implies (and hyp1 hyp2 ... hypn)
	 (iff term t)).

(Yes, iff may be used in place of equal, to indicate that the rule is only to
be applied in a "propositional" context.)  Exception:

(implies (and hyp1 hyp2 ... hypn)
	 (lessp term1 term2))

and

(implies (and hyp1 hyp2 ... hypn)
	 (not (lessp term1 term2)))

are stored as "linear rules".  (There are two other types of rules that can be
stored under the "rewrite" designator, but never mind that.)  This leads us to
the next topic.

A5. Linear arithmetic

One should know that the prover can handle truths about plus and difference,
and that linear rules (see above) are somehow "thrown in the pot" when the
prover is doing such reasoning, but that's about it.  Perhaps it's also useful
to know that linear rules can have hypotheses, and that conditional rewriting
is used to relieve those hypotheses.

	 ------------------------------------------------------------

B. Strategies for creating events

B1. Use high-level strategy.

Decompose theorems into "manageable" lemmas (admittedly, experience helps here)
that yield the main result "easily".  It's important to be able to outline
non-trivial proofs by hand (or in your head).  This point is made and
elaborated on in [Tutorial], with several examples.  In particular, avoid
submitting goals to the prover when there's no reason to believe that the goal
will simplify to T and there's no "sense" of how an induction argument would
apply.  It is often a good idea to avoid induction in complicated theorems
unless you have a reason to believe that it is appropriate.

B2. Write elegant definitions.

Try to write definitions in a reasonably modular style, especially recursive
ones.

B3. Look for analogies.

Sometimes you can copy sequences of lemmas about functions you have already
proved things about, and easily derive corresponding lemmas about analogous
functions.

B4. Write useful rewrite rules

B4a.  Rewrite rules should simplify.

Try to write rewrite rules whose right-hand sides are in some sense "simpler
than" (or at worst, are variants of) the left-hand sides.  This will help to
avoid infinite loops in the rewriter.

B4b.  Avoid needlessly expensive rules.

Consider a rule whose conclusion's left-hand side (or, the entire conclusion)
is a term such as (listp x) that matches many terms encountered by the prover.
If in addition the rule has complicated hypotheses, this rule could slow down
the prover a lot.  Consider switching the conclusion and a complicated
hypothesis (negating each) in that case.

B4c. The "Knuth-Bendix problem"

Be aware that left sides of rewrite rules should match the "normalized forms",
where "normalization" (rewriting) is inside-out.  See for example pages 38 and
(top of) page 72 of [Tutorial].  In particular, avoid the use of nonrecursive
function symbols on left sides of rewrite rules, except when those function
symbols are disabled.

B4d. Avoid proving useless rules.

Sometimes it's tempting to prove a rewrite rule even before you see how it
might find application.  If the rule seems clean and important, and not unduly
expensive, that's probably fine, especially if it's not too hard to prove.  But
unless it's either part of the high-level strategy or, on the other hand,
intended to get the prover past a particular unproved goal ("checkpoint" -- see
C1 below), it may simply waste your time to prove the rule, and then clutter
the database of rules if you are successful.

B4e. State rules as strongly as possible, usually.

It's usually a good idea to state a rule in the strongest way possible, both by
eliminating unnecessary hypotheses and by generalizing subexpressions to
variables.  Advanced users may choose to violate this policy on occasion, for
example in order to avoid slowing down the prover by excessive attempted
application of the rule.  However, it's a good rule of thumb to make the
strongest rule possible, not only because it will then apply more often, but
also because the rule will often be easier to prove (see also B6 below).

B5. Conditional vs. unconditional rewrite rules

It's generally preferable to form unconditional rewrite rules unless there is a
danger of case explosion.  That is, rather than pairs of rules like

(implies p
	 (equal term1 term2))

and

(implies (not p)
	 (equal term1 term3))

consider:

(equal term1
       (if p term2 term3))

However, sometimes this strategy can lead to case explosions:  IF terms
introduce cases in Nqthm.  Use your judgment.  (Speaking of IF:  COND and CASE
are abbreviations for IF, and propositional functions such as IMPLIES, AND, and
OR quickly expand into IF terms.)

B6. Create elegant theorems.

Try to formulate lemmas that are as simple and general as possible.  For
example, sometimes properties about several functions can be "factored" into
lemmas about one function at a time (see e.g. p. 36 of [Tutorial]).  Sometimes
the elimination of unnecessary hypotheses makes the theorem easier to prove
(see also B4e above), as does generalizing first by hand (see for example the
middle of page 75 of [Tutorial]).

B7. Avoid FOR, EVAL$, and related "interpreter" functions.

B8. Use ADD-AXIOMs temporarily to explore possibilities.

For example, when you have a difficult goal that seems to follow immediately
(by a USE hint or by rewriting) from some other lemmas, you can create those
lemmas as ADD-AXIOM events and then double-check that the difficult goal really
does follow from them.  Then you can go back and try to turn each ADD-AXIOM
into a PROVE-LEMMA.  When you do that, it's often useful to disable any
additional rewrite rules that you prove in the process, so that the "difficult
goal" will still be proved from its lemmas when the process is complete.

B9. Use libraries.

Consider using others' libraries, especially for arithmetic reasoning.  There
is a reasonable natural numbers library in the Nqthm-1992 distribution, for
example (in examples/numbers/naturals.events).

	 ------------------------------------------------------------

C. Dealing with failed proofs

C1. Look in proof output for goals that cannot be further simplified.

Some call this the "checkpoints" strategy.  In fact, the Pc-Nqthm-1992
distribution has support for checkpoints in misc/checkpoints.lisp,
misc/emacs/checkpoint-keys.el, and misc/emacs/checkpoints.el; see also CLInc
Tech Report 85 (available from URL http://www.cli.com).  But you don't need to
use the tool to use the strategy.

Sometimes it's useful to think of Nqthm as a "simplifier" that either proves
the theorem or presents a goal to consider.  That goal is the first one that is
stable under simplification, i.e., does not further simplify.  (Exception:
it's also important to look at the induction scheme in a proof by induction,
and if induction seems appropriate, then look at he first checkpoint *after*
the induction has begun.)

Consider whether the goal you focus on is even a theorem.  Sometimes you can
execute it for particular values, in R-LOOP, to find a counterexample.  For a
good example see point 4 of Appendix A, p. 50 of [Tutorial].

When looking at checkpoints (goals that are stable under simplification),
remember that you are looking for any reason at all to believe the goal is a
theorem.  So for example, sometimes there may be a contradiction in the
hypotheses.

Don't be afraid to skip the first checkpoint if it doesn't seem very helpful.

C2. Use break-lemma.

Break-lemma and related functions let you inspect the "rewrite stack".  See
[ACLH] for details.  This can be an invaluable tool in large proof efforts.

C3. Use induction hints.

Be able to write and hint induction schemes when automated induction fails.
Here is an example from [Tutorial] that illustrates the principle.

    (defn induction-fn (x k)
      (if (not (equal (sumlist x) (times k (length x))))
	  t
	(if (equal (minlist x) (maxlist x))
	    t
	  (induction-fn X0 k))))

where here X0 abbreviates the expression we want to use in place of X for the
inductive hypothesis (details omitted here).  The proof by induction will have
two base cases:  one where (not (equal (sumlist x) (times k (length x)))) is
assumed, and another where (equal (sumlist x) (times k (length x))) and
(equal (minlist x) (maxlist x)) are assumed.  The third case, in which the two
IF tests are assumed false, is given an inductive hypothesis in which X0 is
substituted for X in the theorem to be proved.

Of course, if you can define your functions so that they suggest the correct
inductions to Nqthm, so much the better!  But, that talent is not necessary for
successful Nqthm use, unless you expect the proofs to go through without
additional help, such as giving induction hints.

C4. Use Pc-Nqthm to explore.

The VERIFY command supplied by Pc-Nqthm allows one to explore problem areas "by
hand".  See [Tutorial] for examples.

Try VERIFY-DEFN followed by the Pc-Nqthm SPLIT command when trying to accept
problematic recursive definitions, proceeding to consider each goal separately.

C5. Don't have much patience.

Interrupt the prover fairly quickly when simplification isn't succeeding.

C6. Simplify rewrite rules.

When it looks difficult to relieve the hypotheses of an existing rewrite rule
that "should" apply in a given setting, ask yourself if you can eliminate that
hypothesis from the existing rewrite rule.  If so, it may be easier to prove
the new version from the old version (and some additional lemmas), rather than
to start from scratch.

C7. Deal with base cases first.

Try getting past the base case(s) first in a difficult proof by induction.
Usually they're easier than the inductive step(s), and rules developed in
proving them can be useful in the inductive step(s) too.  Moreover, it's pretty
common that mistakes in the statement of a theorem show up in the base case(s)
of its proof by induction.

C8. Use EXPAND hints.

Consider giving EXPAND hints.  These are especially useful when a proof by
induction is failing.  It's almost always helpful to open up a recursively
defined function that is supplying the induction scheme, but sometimes Nqthm is
too timid to do so.

	 ------------------------------------------------------------

D. Performance tips

D1. Disable rules.

Disable rules when manually breaking a theorem into cases, proving each case,
and then giving a USE hint.  Also disable rules explicitly given in USE hints.
Also, disable recursively defined functions for which you can prove what seem
to be all the relevant properties.  The prover can spend lots of time "behind
the scenes" trying to open up recursively defined functions, where the only
visible effect is slowness.

D2. Turn off rewrite path maintenance.

Remember to execute (maintain-rewrite-path nil) after turning on rewrite path
maintenance, in order to bring the prover back up to full speed.

D3. If you must use add-shell....

Avoid shell definitions with lots of type restrictions.

	 ------------------------------------------------------------

E. Miscellaneous tips and knowledge

E1. Order of application of rewrite rules

Keep in mind that the most recent rewrite rules in the chronology are tried
first.

E2. Relieving hypotheses is not full-blown theorem proving.

Relieving hypotheses on rewrite rules is done by rewriting and linear
arithmetic alone, not by case splitting or by other prover processes "below"
simplification.

E3. Obtaining information

Use (get 'foo 'lemmas) to inspect lemmas that are hung on a function symbol
'foo.  Another approach to seeing which lemmas apply:  enter the proof-checker
with VERIFY, and use the SHOW-REWRITES command.  Other utilities are documented
in [ACLH], such as DATA-BASE.  You can see foo is disabled by seeing if
(disabledp 'foo) evaluates to T.

E4. UBT and DEFN

UBT usually has to be executed when the user interrupts a DEFN event (with
control-c, in Unix), presumably because the "termination proof" is taking too
long.  You'll find that out when you try to define the function again, and the
prover complains with a "Name currently in use" message.

E5. "Free variables" in rewrite rules.

The set of "free variables" of a rewrite rule is defined to contain those
variables occurring in the rule that do not occur in the left-hand side of the
rule.  Such rules are "weak", in the sense that hypotheses containing such
variables can generally only be proved when they are "obviously" present in the
current context.  This weakness suggests that it's important to put the most
"interesting" (specific) hypotheses about free variables first, so that the
right instances are considered.  For example, suppose you put a very general
hypothesis such as (listp x) first.  If the context has several terms around
that are known to be LISTPs, then x may be bound to the wrong one of them.

Anyhow, be willing to experiment or give up (resorting to USE hints) when that
strategy doesn't work.

E6. Quantification

There is a trick for defining Skolem functions corresponding to bounded
quantification notions, but I'm running out of steam so I won't say more on
this unless someone asks.

	 ------------------------------------------------------------

F. Some things you DON'T need to know

Most generally:  you don't need to be able to predict much about Nqthm's
behavior.  You mainly just need to be able to react to it (as discussed above).

F1. Induction heuristics 

Although it is often important to read the prover's output, in order to see the
induction scheme chosen by the prover, it is not necessary to understand how
the prover made that choice.  (Granted, advanced users may occasionally gain
minor insight from such knowledge.  But it's truly minor in many cases.)  What
IS important is to be able to tell it an appropriate induction when it doesn't
pick the right one (after noticing that it doesn't).  See C3 above.

F2. Heuristics for expanding calls of recursively defined functions

As with the previous topic, the important thing isn't to understand these
heuristics but, rather, to deal with cases where they don't seem to be working.
That amounts to supplying EXPAND hints for those calls that you want opened up,
which aren't.  See also C8 above.

F3. The "waterfall"

I believe that the following strategy for using Nqthm is quite useful (though I
admit it's not the only successful strategy):  Try a theorem, and if it works,
great -- if it doesn't, then either think about high-level strategy, or (as
summarized in C1 above) look for goals stable under simplification.
(Exception:  do look at the induction scheme if induction is used.)  So
according to this strategy, it is NOT necessary to understand any of the
"processes" that Nqthm uses other than simplification (and to a small extent,
induction [if you want to call that a "process"]).

In particular, you can ignore elimination, cross-fertilization, generalization,
and elimination of irrelevance.  If they work, great.  If not, go back to where
the prover first tried using a process other than simplification and ask
yourself if you can formulate an appropriate (conditional) rewrite rule that
will solve the problem.

Said differently:  you can ignore all that prover output, except for the
warnings printed initially and the checkpoints.  Don't worry about what "type
reasoning" or "abbreviations" are, for example.

	 ------------------------------------------------------------

G. References

[ACLH] R. S. Boyer and J S. Moore, "A Computational Logic Handbook", Academic
Press, Boston, 1988.

[Tutorial] M. Kaufmann and P. Pecchiari, "Interaction with the Boyer-Moore and
Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem",
Technical Report 100, Computational Logic, Inc., August 1994.

From tab95@mailhost.uni-koblenz.de  Tue Mar  7 10:55:11 1995
Return-Path: <tab95@mailhost.uni-koblenz.de>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01285; Tue, 7 Mar 95 10:55:11 CST
Received: from infko.uni-koblenz.de (mailhost.uni-koblenz.de) by cli.com (4.1/SMI-4.1)
	id AA20967; Tue, 7 Mar 95 08:43:30 CST
Received: from holst.uni-koblenz.de (tab95@holst.uni-koblenz.de [141.26.5.73]) by infko.uni-koblenz.de (8.6.9/8.6.9) with SMTP id PAA18755; Tue, 7 Mar 1995 15:35:26 +0100
From: Tableaux Workshop 95 <tab95@informatik.uni-koblenz.de>
Message-Id: <199503071435.PAA18755@infko.uni-koblenz.de>
Received: by holst.uni-koblenz.de (4.1/KO-2.0)
	id AA28706; Tue, 7 Mar 95 15:35:19 +0100
Date: Tue, 7 Mar 95 15:35:19 +0100
To: fg121@inferenzsysteme.informatik.th-darmstadt.de,
        rewriting-list@lorraine.loria.fr, theorem-provers@mc.lcs.mit.edu,
        deduktion@intellektik.informatik.th-darmstadt.de,
        kgs@csdec1.tuwien.ac.at, isabelle-users@cl.cam.ac.uk,
        info-hol@cs.uidaho.edu, nqthm-users@cli.com, howe@research.att.com,
        marek@ms.uky.edu, clp@cis.ohio-state.edu
Subject: CFParticipation: 4th WS on Analytic Tableaux and Related Methods
Organization: University of Koblenz, Germany

[A LaTeX version of this announcement is included below.  
 Postscript and HTML versions are available through the WWW page at
 http://www.uni-koblenz.de/~tab95/CallForParticipation.html
 This page also contains an interactive WWW registration form.]

                       Call for Participation and
                            Registration form


                          Fourth  Workshop  on
               Theorem  Proving  with  Analytic  Tableaux
                         and  Related  Methods

                            May  7-10  1995

     Schloss-Hotel, castle Rheinfels, St. Goar am Rhein, Germany

This workshop is a continuation  of workshops on the  same topic held in
Lautenbach near Karlsruhe (1992),   Marseille (1993), and  Abingdon near
Oxford (1994).  Each had a wide international participation.

Scope of the Workshop
---------------------
The workshop intends to bring together researchers interested in the
mechanisation of reasoning with tableaux and related systems (analytic
tableaux, model elimination, connection method, sequent
calculi). Covered are theoretical aspects of classical and
non-classical logics, as well as topics related to practical
implementations.


Conference Site
---------------
The conference will be held in Germany at the Schloss-Hotel Rheinfels
in St. Goar, a small town founded in 1264 in the scenic Rhine valley
nearby the Loreley.  The hotel is attached to the castle Rheinfels,
which was built in the mid-16th century for defending the town of
St. Goar.

Transport
---------

St. Goar can be easily reached by train.  The trip from Frankfurt
International Airport takes about 90 minutes and trains run on the
hour. A timetable will be sent together with the registration 
confirmation.

Invited speakers
----------------
- Wolfgang Bibel, Technische Universitat Darmstadt, Germany 
- Ricardo Caferra, LIFIA-IMAG, Grenoble, France 
- Erik Rosenthal, University of New Haven, USA (banquet speech)

Registration
------------
o The registration fee is DM 260 (approx. US$ 156)
  for early registration, to be paid  in advance before March,
  15, 1995. The late registration fee is DM 350 (approx. US$ 210).

  The registration fee includes: admission to the entire conference
  program including technical sessions and poster sessions, the
  conference dinner, and a copy  of the proceedings (Springer LNAI) 
  of the conference.

o Accomodation will be about DM 160,-- (approx. US$ 100) per person
  and day, including all meals and coffee breaks. 
  The exact amount depends on the number of participants.
  Accomodation is to be paid on site.

o The rooms are assigned on a first-come-first-served basis. In case
  the conference site accomodation capabilities are exhausted we will 
  reserve rooms in a hotel within walking distance.

o We will be able to give a reduction on the registration fee and
  accomodation to a limited number of students and colleagues from Eastern
  Europe. Applicants should contact the registration address (see
  below).

o For registration please either use the registration form at the WWW
  page accessible through 
        http://www.uni-koblenz.de/~tab95/CallForParticipation.html
  or the registration form included below.


Program Committee
-----------------
Peter Baumgartner, Univ. of Koblenz, Germany
Krysia Broda, Imperial College London, U.K.
Marcello D'Agostino,Imperial College London, U.K.
Melvin Fitting, CUNY, New York City, U.S.A.
Ulrich Furbach, Univ. of Koblenz, Germany
Dov Gabbay, Imperial College London, U.K.
Rajeev Gore', Australian National University, Australia
Jean Goubault, Bull Research Paris, France
Reiner H"ahnle, Univ. of Karlsruhe, Germany
Ryuzo Hasegawa, ICOT, Tokyo, Japan
Rob Johnson, Manchester Metrop. Univ., U.K.
Thomas K"aufl, Univ. of Karlsruhe, Germany
Reinhold Letz, Technical Univ. of Munich, Germany
Neil Murray, SUNY at Albany, U.S.A.
Ugo Moscato, Univ. of Milano, Italy
Joachim Posegga, Univ. of Karlsruhe, Germany
Peter Schmitt, Univ. of Karlsruhe, Germany
Camilla Schwind, LIM-CNRS, Univ. of Marseille, France
Graham Wrightson, Univ. of Newcastle, Australia

Organising Committee
--------------------
Peter Baumgartner, Univ. of Koblenz, Germany
Ulrich Furbach, Univ. of Koblenz, Germany
Reiner H"ahnle, Univ. of Karlsruhe, Germany
Joachim Posegga, Univ. of Karlsruhe, Germany

Local arrangements and registration address
-------------------------------------------

Ulrich Furbach
Computer Science Institute
University of Koblenz
Rheinau 1
56075 Koblenz, Germany

Fax:  ++ 49  261  9119  499
Phone: ++ 49  261  9119  433
E-mail:  tab95@informatik.uni-koblenz.de



Programme
---------

Welcome dinner:                    Sunday, May, 7, evening, cold/warm buffet
Beginning of scientific programme: Monday,    May,  8, 9 am
End of conference:                 Wednesday, May, 10, noon

That is, arrival is recommended at Sunday, May, 7.

Social events:
 - Conference dinner, medieval style, at Monday evening.
 - Guided tour through the medieval castle. 

Invited talks will be given by Wolfgang Bibel (Technische Universitat
Darmstadt) and Ricardo Caferra (LIFIA-IMAG, Grenoble, France); 
a banquet speech will be held by Erik Rosenthal (University of New
Haven, USA).

We will have 21 talks presenting full papers and 4 talks presenting
short papers. Additionally, we will organize a poster session.


Schedule
--------

 Full papers (F): 25+5 minutes
 Short papers (S):15+5 minutes

Sunday, May, 7

       19.00  Welcome buffet



Monday, May, 8

  9.00 - 9.10 Welcome


Invited Talk
 9.10 - 10.10 W. Bibel
              Issues in Theorem Proving Based on the Connection Method


Break
10.10 - 10.40


Classical logic - Extensions
10.40 - 11.10 Eric de Kogel
              Rigid E-Unification Simplified (F)

11.10 - 11.40 Stefan Klingenbeck
              Generating Finite Counter Examples with Semantic Tableaux (F)

11.40 - 12.10 Ingrid Neumann
              Semantic Tableaux for Inheritance Nets (F)


Lunch
12.10 - 14.00


Modal logic
14.00 - 14.30 Stephane Demri
              Using Connection Method in Modal Logics: Some advantages (F)

14.30 - 15.00 Guido Governatori
              Labelled Tableaux for Multi-Modal Logics (F)

15.00 - 15.30 Ugo Moscato
              Refutation systems for propositional modal logics. (F)


Break
15.30 - 16.00


Intuitionistic logic I



16.00 - 16.30 Stephan Schmitt and Christoph Kreitz
              On Transforming Intuitionistic Matrix Proofs into Standard Sequent
              Proofs (F)

16.30 - 17.00 Jens Otten and Christoph Kreitz
              A Connection Based Proof Method for Intuitionistic Logic (F)


Break
17.00 - 17.30


Intuitionistic logic II


17.30 - 18.00 Judith Underwood
              Tableau for Intuitionistic Predicate Logic as Metatheory (F)

18.00 - 18.20 Rajeev Gore
              Intuitionistic Logic Redisplayed. (S)


Guided tour through the castle and banquet
       19.30  with a banquet speech by Erik Rosenthal



Tuesday, May, 9


Invited Talk
 9.00 - 10.00 R. Caferra
              Model Building and Interactive Theory Discovery


Break
10.00 - 10.30


Classical logic - Connection Method and Model Elimination
10.30 - 11.00 Klaus Mayr
              Link Deletion in Model Elimination (F)

11.00 - 11.30 Gerd Neugebauer and Uwe Petermann
              Specification of Inference Rules and their Automatic 
              Translation (F)

11.30 - 12.00 Peter Baumgartner and Frieder Stolzenburg
              Constraint Model Elimination and a PTTP-Implementation (F)


Lunch
12.00 - 14.00


Classical logic - Non-Clausal Proof Procedures



14.00 - 14.30 Matthias Baaz and Christian G. Ferm"uller
              Nonelementary Speedups between Different Versions of Tableaux (F)

14.30 - 15.00 Jan Komara and Paul J. Voda
              Syntactic Reduction of Predicate Tableaux to Propositional
              Tableaux. (F)

15.00 - 15.20 N. Murray, A. Ramesh and E. Rosenthal
              Semi-Resolution: An Inference Rule and its Application to Prime
              Implicate Problems. (S)


Break
15.20 - 15.50


Linear logic I
15.50 - 16.20 J"org Hudelmaier and Peter Schroeder-Heister
              Classical Lambek Logic (F)

16.20 - 16.50 Philippe de Groote
              Linear Logic with Isabelle: Pruning the Proof Search Tree (F)


Break
16.50 - 17.20


Poster session
17.20 - 17.45 Robert Johnson, Paula Gouveia and Cristina Sernadas, Krysia Broda
              and Marcelo Finger, J. M. Coldwell and Graham Wrightson, Kevin
              Wallace and Graham Wrightson, Daniel S. Korn and Christoph
              Kreitz, Roderick A. Girle, A. Gavilanes, J. Leach and S. Nieva
              Poster announcements

17.45 - 18.45 Poster presentation


Dinner
       20.00



Wednesday, May, 10


Linear logic II
  9.00 - 9.30 Robert K. Meyer, Michael A. McRobbie and Nuel D. Belnap, Jr
              Linear analytic tableaux (F)

  9.30 - 9.50 Didier Galmiche and Jean-Yves Marion
              Semantic Proof Search Methods for ALL - A First Approach - (S)


Higher-order logic
 9.50 - 10.20 Michael Kohlhase
              Higher-Order Tableaux (F)



10.20 - 10.40 Peter B. Andrews
              An Example of Proof Search in TPS: A Theorem Proving System for
              Classical Type Theory. (S)


Break
10.40 - 11.10


Applications
11.10 - 11.40 Alain Heuerding, Gerhard J"ager, Stefan Schwendimann and Michael
              Seyfried
              Propositional Logics on the Computer (F)

11.40 - 12.10 Jeremy Pitt
              MacKE: Yet Another Proof Assistant & Automated Pedagogic Tool
              (F)

12.10 - 12.40 Johann Schumann
              Using the Theorem Prover SETHEO for verifying the development of
              a Communication Protocol in FOCUS - a case study - (F)


Lunch
       12.40

Workshop sponsors:
-----------------
Deutsche Forschungsgemeinschaft (DFG), University of Karlsruhe, 
University of Koblenz, Gesellschaft fuer Informatik (GI),
Ministry of Trade and Commerce Rheinland-Pfalz.

Registration Form
-----------------

------------- cut here ---------------------------

                        Conference and Accomodation
               Registration form for T A B L E A U X - 9 5


To be returned to the REGISTRATION ADDRESS: 
  Ulrich Furbach, Computer Science Institute, University of Koblenz,
  Rheinau 1, 56075 Koblenz, Germany, E-mail: tab95@informatik.uni-koblenz.de


Personal Information:

Family name: ................................ First name: ..............

Affiliation: ...........................................................

             ...........................................................

Address:     ...........................................................

             ...........................................................

             ...........................................................

E-mail:      ...........................................................

Tel.:        .......................... Fax.: ..........................

Accompanying person(s): ................................................


Accomodation:

My arrival date will be:   .............................................

My departure date will be: .............................................

Please reserve for me:  

First choice accomodation type:

                        ..... single room(s)
                        ..... double room(s) to be shared with

             ...........................................................


Second choice accomodation type:

                        ..... single room(s)
                        ..... double room(s) to be shared with

             ...........................................................


Special dietary requirements: None       [ ]
                              Vegetarian [ ]
                              Kosher     [ ]


Registration fee payment
------------------------
DM 260 -- early (i.e. before March 15), DM 350 --late.
Please tick one:

[ ] Payment by credit card:

    Credit Card Company: Eurocard/Mastercard      [ ]
    (tick one)           VISA                     [ ]
                         American Express         [ ]

    Cardholders Name:    ...................................................

    Credit card number:  ...................................................

    Expiration date:     ...................................................

[ ] Payment by cheque in German currency (DM) drawn on a German bank;
    please make cheques payable to "Ulrich Furbach, Tableau-Workshop",
    indicate your name and return it to the registration address.

    IMPORTANT NOTE: all extra fees emerging from cheque payment must be 
                    covered by the applicant!

[ ] Payment by money order in German currency (DM) to this bank account:

       Bank:           Sparkasse Koblenz
       Bank Code       57050120
       (Bankleitzahl)   

       Account Holder: Ulrich Furbach, Tableau-Workshop
       Account:        41003518

    IMPORTANT NOTE: all extra fees emerging from money order  payment 
                    must be covered by the applicant!


Signature
---------


     ..................             ..............................
           Date                               Signature



For any administrative queries regarding registration or bookings
please contact Ulrich Furbach, E-mail: tab95@informatik.uni-koblenz.de Tel:
+49-(0)261-9119-426 Fax: +49-(0)261-9119-499

------------- cut here ---------------------------

%%%% LaTeX version follows:
\documentstyle[11pt]{article}
\pagestyle{empty}
\nonstopmode\parindent=0pt\parskip=0pt\topsep=0pt\itemsep=0pt
\textheight=660pt\textwidth=470pt\topmargin=0pt
\oddsidemargin=0pt\evensidemargin=0pt\abovedisplayskip=0pt
\belowdisplayskip=0pt\leftmargin=.4cm


\begin{document}
\vspace*{-1cm}
\begin{quote}
  \small  Postscript and HTML versions of this call for participation 
are available through the  WWW page at 
 \verb|http://www.uni-koblenz.de/~tab95/CallForParticipation.html|
 This page also contains an interactive WWW registration form.
\end{quote}

\begin{center}
 {\large\bf Call for Participation and \\ Registration form}\\[5mm]

 {\Large\bf Fourth Workshop on\\[2mm]

 \Large\bf Theorem Proving
 with Analytic Tableaux \\[2mm]

 \Large\bf and Related Methods\\[5mm]{\bf May 7--10 1995}}\\[5mm]

 Schlo{\ss}-Hotel, castle ``Rheinfels'',
 St.~Goar am Rhein, Germany
\end{center}

This workshop is a continuation of workshops on the same topic held in
Lautenbach near Karlsruhe (1992), Marseille (1993), and Abingdon near
Oxford (1994).  Each had a wide international participation. 

\subsection*{Scope of the Workshop}
The workshop intends to bring together researchers interested in the
mechanisation of reasoning with tableaux and related systems (analytic
tableaux, model elimination, connection method, sequent
calculi).  Covered are theoretical aspects of classical and
non-classical logics, as well as topics related to practical
implementations.

\subsection*{Conference Site} 
The conference will be held in Germany at the Schlo{\ss}-Hotel
Rheinfels in St.~Goar, a small town founded in 1264 in the scenic
Rhine valley nearby the Loreley.  The hotel is attached to the castle
Rheinfels, which was built in the mid-$16^{\mbox{th}}$ century for
defending the town of St.~Goar.

\subsection*{Transport} 
St.~Goar can be easily reached by train.  The trip from Frankfurt
International Airport takes about 90 minutes and trains run on the
hour.  A timetable will be sent together with the registration
confirmation.


\subsection*{Registration}
\begin{itemize}
\item The registration fee is DM 260 (approx. US\$ 156)
  for early registration, to be paid  in advance before March,
  15, 1995. The late registration fee is DM 350 (approx. US\$ 210).

  The registration fee includes: admission to the entire conference
  program, including technical sessions and poster sessions, the
  conference dinner, and a copy of the proceedings (Springer LNAI) of
  the conference.

\item Accomodation will be about DM 160,-- (approx. US\$ 100) per person
  and day, including all meals and coffee breaks. 
  The exact amount depends on the number of participants.
  Accomodation is to be paid on site.

\item The rooms are assigned on a first-come-first-served basis. In case
  the conference site accomodation capabilities are exhausted we will 
  reserve rooms in a hotel within walking distance.

\item We will be able to give a reduction on the registration fee and
  accomodation to a limited number of students and colleagues from Eastern
  Europe. Applicants should contact the registration address (see
  below).

\item For registration please either use the registration form at the WWW
  page accessible through \\
        \verb|http://www.uni-koblenz.de/~tab95/CallForParticipation.html|
  or the registration form included below.
\end{itemize}

\subsection*{Invited speakers}
Wolfgang Bibel, Technische Universit\"{a}t Darmstadt, Germany \\
Ricardo Caferra, LIFIA-IMAG, Grenoble, France\\
Erik Rosenthal, University of New Haven, USA (banquet speech).


\subsection*{Program Committee}

\begin{tabular}{@{}p{8cm}p{8cm}@{}}
Peter Baumgartner, Univ.~of Koblenz, Germany &
Krysia Broda, Imperial College London, U.K.\\
Marcello D'Agostino, \flushright Imperial College London, U.K. &
Melvin Fitting, CUNY, New York City, U.S.A.\\
Ulrich Furbach, Univ.~of Koblenz, Germany &
Dov Gabbay, Imperial College London, U.K.\\
Rajeev Gor\'e, \flushright
Australian National University, Australia &
Jean Goubault, Bull Research Paris, France\\
Reiner H\"ahnle, Univ.~of Karlsruhe, Germany &
Ryuzo Hasegawa, ICOT, Tokyo, Japan\\
Rob Johnson, Manchester Metrop.~Univ., U.K. &
Thomas K\"aufl, Univ.~of Karlsruhe, Germany\\
Reinhold Letz,\flushright Technical Univ.~of Munich, Germany &
Neil Murray, SUNY at Albany, U.S.A. \\
Ugo Moscato, Univ.~of Milano, Italy &
Joachim Posegga, Univ.~of Karlsruhe, Germany\\
Peter Schmitt, Univ.~of Karlsruhe, Germany &
Camilla Schwind,{\flushright \mbox{}\hfill LIM-CNRS, Univ.~of Marseille, France}\\
Graham Wrightson,\flushright  Univ.~of Newcastle, Australia &\\
\end{tabular}

\subsection*{Organising Committee}

\begin{tabular}{@{}p{8cm}p{8cm}@{}}
Peter Baumgartner, Univ.~of Koblenz, Germany &
Ulrich Furbach, Univ.~of Koblenz, Germany\\
Reiner H\"ahnle, Univ.~of Karlsruhe, Germany &
Joachim Posegga, Univ.~of Karlsruhe, Germany
\end{tabular}

\subsection*{Local arrangements and registration address}
\parbox[t]{8cm}{%
{\bf Ulrich Furbach} \\
Computer Science Institute\\
University of Koblenz\\
Rheinau 1\\
56075 Koblenz,
Germany}
\parbox[t]{7cm}{%
Fax: ${\scriptstyle ++}49-261-9119-499$\\
Phone:\,${\scriptstyle ++}49-261-9119-433$\\
E-mail: {\tt tab95}@{\tt informatik.uni-koblenz.de}}
\newpage 

\section*{Programme}

\begin{description}
\item[\em Welcome dinner:] Sunday,~May,~7,~evening,~cold/warm buffet
\item[\em Beginning of Conference:] Monday,~May,~8,~9~am
\item[\em End of Conference:] Wednesday,~May,~10,~noon\\
That is, arrival is recommended at Sunday, May, 7.

\item[\em Social events:] Conference dinner, medieval style, 
at Monday evening.\\
Guided tour through the medieval castle. 

\item[\em Invited talks] will be given by Wolfgang Bibel
 (Technische Universitat
Darmstadt, Germany) and Ricardo Caferra (LIFIA-IMAG, Grenoble, France); 
a banquet speech will be held by Erik Rosenthal (University of New
Haven, USA).

\end{description}

We will have 21 talks presenting full papers and 4 talks presenting
short papers. Additionally, we will organize a poster session.

\subsection*{Schedule}

%% The mode of this file is -*- LaTeX-fmath -*-
%% for table of contents
\newlength{\timecolwidth}
\newlength{\textcolwidth}
\settowidth{\timecolwidth}{88.88 -- 88.88}
\setlength{\textcolwidth}{\textwidth}
\addtolength{\textcolwidth}{-\timecolwidth}
\addtolength{\textcolwidth}{-1em}
\newcommand{\session}[2]{\medskip\par\noindent{\bf #1\\}\nopagebreak
  {\def\foo{}\ifx#2\foo\else{Chair: #2\\[0.3\baselineskip]\nopagebreak}\fi}}

\newcommand{\talk}[3]{\noindent\parbox[t]{\timecolwidth}{\hfill#2}\hspace{1em}%
\parbox[t]{\textcolwidth}{\raggedright #1\\{\it #3}}\vspace{0.5\baselineskip}}


\noindent\begin{tabular}[t]{ll}
Full papers (F): & 25+5 minutes\\
Short papers (S): & 15+5 minutes
\end{tabular}

\subsection*{Sunday, May, 7}
\talk{Welcome buffet}{19.00}{}

\subsection*{Monday, May, 8}
\talk{Welcome}{9.00 --  9.10}{}

\session{Invited Talk}{}
\talk{W. Bibel}{9.10 --  10.10}%
{Issues in Theorem Proving Based on the Connection Method}

\session{Break}{}
\talk{\ }{10.10 --  10.40}{}

\session{Classical logic --- Extensions}{}
\talk{Eric de Kogel}{10.40 -- 11.10}{Rigid $E$-Unification Simplified  (F)}
\talk{Stefan Klingenbeck}{11.10 -- 11.40}{Generating Finite Counter Examples
  with Semantic  Tableaux  (F)}
\talk{Ingrid Neumann}{11.40 -- 12.10}{Semantic Tableaux for Inheritance Nets
  (F)}

\session{Lunch}{}
\talk{\ }{12.10 -- 14.00}{}

%\section*{Monday afternoon}
\session{Modal logic}{}
\talk{St\'{e}phane Demri}{14.00 -- 14.30}{Using Connection Method in Modal
  Logics: Some advantages  (F)}

\talk{Guido Governatori}{14.30 -- 15.00}{Labelled Tableaux for Multi-Modal
  Logics  (F)}

\talk{Ugo Moscato}{15.00 -- 15.30}{Refutation systems for propositional modal
  logics.  (F)}

\session{Break}{}
\talk{\ }{15.30 -- 16.00}{}

%\newpage
\session{Intuitionistic logic I}{}
\talk{Stephan Schmitt and Christoph Kreitz}{16.00 -- 16.30}{On Transforming
  Intuitionistic Matrix Proofs into Standard Sequent Proofs  (F)}

\talk{Jens Otten and Christoph Kreitz}{16.30 -- 17.00}{A Connection Based
  Proof Method for Intuitionistic  Logic  (F)}

\session{Break}{}
\talk{\ }{17.00 -- 17.30}{}

\session{Intuitionistic logic II}{}

\talk{Judith Underwood}{17.30 -- 18.00}{Tableau for Intuitionistic Predicate
  Logic as  Metatheory  (F)}
\talk{Rajeev Gor\'e}{18.00 -- 18.20}{Intuitionistic Logic Redisplayed. (S)}

%\section*{Monday evening}
\session{Guided tour through the castle and banquet}{}
\talk{with a banquet speech by Erik Rosenthal}{19.30}{}

%\section*{Tuesday morning}
\subsection*{Tuesday, May, 9}

\session{Invited Talk}{}
\talk{R. Caferra}{9.00 -- 10.00}{Model Building and Interactive 
Theory Discovery}

\session{Break}{}
\talk{\ }{10.00 -- 10.30}{}

%\newpage
\session{Classical logic --- Connection Method and Model
  Elimination}{}
\talk{Klaus Mayr}{10.30 -- 11.00}{Link Deletion in Model Elimination  (F)}

\talk{Gerd Neugebauer and Uwe Petermann}{11.00 -- 11.30}{Specification of
  Inference Rules  and their Automatic Translation  (F)}

\talk{Peter Baumgartner and Frieder Stolzenburg}{11.30 -- 12.00}{Constraint
  Model Elimination and a {PTTP}-Implemen\-tation (F)}

\session{Lunch}{}
\talk{\ }{12.00 -- 14.00}{}

%\section*{Tuesday Afternoon}
\session{Classical logic --- Non-Clausal Proof Procedures}{}
\talk{Matthias Baaz and Christian G.~Ferm\"{u}ller}{14.00 -- 14.30}{
  Nonelementary Speedups between Different Versions of Tableaux  (F)}

\talk{J\'{a}n Komara and Paul  J.~Voda}{14.30 -- 15.00}{Syntactic Reduction of
  Predicate Tableaux to Propositional Tableaux.  (F)}
\talk{N. Murray, A. Ramesh and E. Rosenthal}{15.00 -- 15.20}{Semi-Resolution: An Inference Rule and its Application to Prime Implicate Problems. (S)}

\session{Break}{}
\talk{\ }{15.20 -- 15.50}{}

\session{Linear logic I}{}
\talk{J\"{o}rg Hudelmaier and  Peter Schroeder-Heister}{15.50 --
  16.20}{Classical Lambek Logic  (F)}

\talk{Philippe de Groote}{16.20 -- 16.50}{Linear Logic with Isabelle: Pruning
  the Proof Search Tree  (F)}

\session{Break}{}
\talk{\ }{16.50 -- 17.20}{}

\session{Poster session}{}
\talk{
Robert Johnson,
Paula Gouveia and Cristina Sernadas,
Krysia Broda and Marcelo Finger,
J.~M.~Coldwell and Graham Wrightson,
Kevin Wallace and Graham Wrightson,
Daniel S.~Korn and Christoph Kreitz,
Roderick A.~Girle,
A.~Gavilanes, J.~Leach and S.~Nieva
}{17.20 -- 17.45}{Poster announcements}
\talk{Poster presentation}{17.45 -- 18.45}{}

%\section*{Tuesday Evening}
\session{Dinner}{}
\talk{\ }{20.00}{}

\subsection*{Wednesday, May, 10}

\session{Linear logic II}{}
\talk{Robert K. Meyer, Michael A. McRobbie and Nuel D. Belnap,
  Jr}{9.00 -- 9.30}{ Linear analytic tableaux  (F)}
\talk{Didier Galmiche and Jean-Yves Marion}{9.30 -- 9.50}{Semantic Proof Search Methods for ALL --- A First Approach ---  (S)}

\session{Higher-order logic}{}
\talk{Michael Kohlhase}{9.50 -- 10.20}{    Higher-Order Tableaux  (F)}
\talk{Peter B. Andrews}{10.20 -- 10.40}{An Example of Proof Search in TPS: A Theorem  Proving System for Classical Type Theory. (S)}

\session{Break}{}
\talk{\ }{10.40 -- 11.10}{}

\session{Applications}{}
\talk{Alain Heuerding, Gerhard J\"{a}ger, Stefan Schwendimann and
  Michael Seyfried}{11.10 -- 11.40}{ Propositional Logics on the Computer  (F)}

\talk{Jeremy Pitt}{11.40 -- 12.10}{Mac{KE}: Yet Another Proof Assistant \&
  Automated Pedagogic Tool (F)}

\talk{Johann Schumann}{12.10 -- 12.40}{ Using the Theorem Prover SETHEO for
  verifying the development of a Communication Protocol in FOCUS --- a
  case study ---  (F)}

\session{Lunch}{}
\talk{\ }{12.40}{}


\vfill
\begin{center}
{\bf Workshop sponsors:} \\Deutsche Forschungsgemeinschaft (DFG), University of
Karlsruhe, University of Koblenz, Gesellschaft f\"ur Informatik (GI),
Ministry of Trade and Commerce Rheinland-Pfalz.
\end{center}

\newpage
\begin{center}
\Large\bf
                        Conference and Accomodation 
               Registration form for T~A~B~L~E~A~U~X~-~9~5
  
\end{center}
\medskip

To be returned to the {\bf registration address}: 
Ulrich Furbach, Computer Science Institute, 
University of Koblenz, Rheinau 1, 56075 Koblenz, Germany.

\subsection*{Personal Information:}
\begin{verbatim}

Family name: ................................ First name: ..............

Affiliation: ...........................................................

             ...........................................................

Address:     ...........................................................

             ...........................................................

             ...........................................................

E-mail:      ...........................................................

Tel.:        .......................... Fax.: ..........................

Accompanying person(s): ................................................
\end{verbatim}

\subsection*{Accommodation}
\begin{verbatim}
My arrival date will be:   .............................................

My departure date will be: .............................................

Please reserve for me:  

First choice accomodation type:

                        ..... single room(s)
                        ..... double room(s) to be shared with

             ...........................................................

Second choice accomodation type:

                        ..... single room(s)
                        ..... double room(s) to be shared with

             ...........................................................


Special dietary requirements: None       [ ]
                              Vegetarian [ ]
                              Kosher     [ ]

\end{verbatim}

\subsection*{Registration fee payment}
DM 260 -- early (i.e. before March 15), DM 350 -- late. Please tick one:\\
\begin{verbatim}
[ ] Payment by credit card:

    Credit Card Company: Eurocard/Mastercard      [ ]
    (tick one)           VISA                     [ ]
                         American Express         [ ]

    Cardholders Name:    ...................................................

    Credit card number:  ...................................................

    Expiration date:     ...................................................

[ ] Payment by cheque in German currency (DM) drawn on a German bank;
    please make cheques payable to "Ulrich Furbach, Tableau-Workshop",
    indicate your name and return it to the registration address.

    IMPORTANT NOTE: all extra fees emerging from cheque payment must be 
                    covered by the applicant!

[ ] Money order in German currency (DM) to this bank account:

        Bank:           Sparkasse Koblenz
        Bank Code       57050120
        (Bankleitzahl)   

        Account Holder: Ulrich Furbach, Tableau-Workshop
        Account:        41003518

    IMPORTANT NOTE: all extra fees emerging from money order  payment 
                    must be covered by the applicant!
\end{verbatim}
\subsection*{Signature}
\begin{verbatim}


     ..................             ..............................
           Date                               Signature
\end{verbatim}


\vfill 

For any administrative queries regarding registration or bookings
please contact U. Furbach, E-mail:
\verb|tab95@informatik.uni-koblenz.de|,
 Tel: \verb|+49-(0)261-9119-426|,  Fax: \verb|+49-(0)261-9119-499|



\end{document}


From bojsen@ithil.id.dtu.dk  Thu Mar  9 18:47:13 1995
Return-Path: <bojsen@ithil.id.dtu.dk>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA02087; Thu, 9 Mar 95 18:47:13 CST
Received: from iddth.id.dtu.dk by cli.com (4.1/SMI-4.1)
	id AA28451; Thu, 9 Mar 95 17:48:16 CST
Received: from ithil.id.dtu.dk (ithil.id.dtu.dk [130.225.76.93]) by iddth.id.dtu.dk (8.6.9/8.6.4) with SMTP id AAA17840; Fri, 10 Mar 1995 00:49:27 +0100
Received: by ithil.id.dtu.dk (4.1/SMI-4.1-PB1.0)
	id AA09318; Fri, 10 Mar 95 00:44:11 +0100
Date: Fri, 10 Mar 95 00:44:11 +0100
From: bojsen@ithil.id.dtu.dk (Per Bojsen)
Message-Id: <9503092344.AA09318@ithil.id.dtu.dk>
To: nqthm-users@cli.com
Subject: Re: [kaufmann@cli.com: follow-up]
Reply-To: bojsen@ithil.id.dtu.dk

I have a few comments to Matt Kaufmann's note on ``nqthm as a push-button
technology''.  First I should say that my personal experience with nqthm
agrees with Matt's note in most aspects.  In retrospect, I wish I had seen
his note when I first started using nqthm :-)  On the other hand, I would
probably not have been able to appreciate the usefulness of the note at
that point.

Comments to specific parts of Matt's note:

> B. Strategies for creating events
>
> [...]
>
> B2. Write elegant definitions.
>
> Try to write definitions in a reasonably modular style, especially recursive
> ones.

On one occassion I saw a dramatic improvement in proving performance (on the
order of a factor 100) when I replaced a definition of a top-level, non-
recursive function with three functions in order to eliminate common sub-
expressions.  Originally I had thought that what makes functions efficient
in an execution context would be rather different from what makes them
efficient in a theorem proving context.

> B4. Write useful rewrite rules
>
> [...]
>
> B4b.  Avoid needlessly expensive rules.
>
> Consider a rule whose conclusion's left-hand side (or, the entire conclusion)
> is a term such as (listp x) that matches many terms encountered by the prover.
> If in addition the rule has complicated hypotheses, this rule could slow down
> the prover a lot.  Consider switching the conclusion and a complicated
> hypothesis (negating each) in that case.

This insight is very important.  Unfortunately, it took some time before I
realized this.  For example, at one point I had the following lemma in
the history:

    (PROVE-LEMMA listp-length (REWRITE)
                 (IMPLIES (NOT (LESSP 0 (LENGTH L)))
                          (NLISTP L)))

which is an extremely expensive rule ;-)

> B4d. Avoid proving useless rules.
>
> Sometimes it's tempting to prove a rewrite rule even before you see how it
> might find application.  If the rule seems clean and important, and not
> unduly expensive, that's probably fine, especially if it's not too hard to
> prove.  But unless it's either part of the high-level strategy or, on the
> other hand, intended to get the prover past a particular unproved goal
> ("checkpoint" -- see C1 below), it may simply waste your time to prove the
> rule, and then clutter the database of rules if you are successful.

I also found that it is in general better to work in a goal-directed, top-
down fashion than trying to build the theory bottom-up.  The latter
requires a much deeper understanding of the inner workings of nqthm than
the former it seems.

> D. Performance tips
>
> [...]
>
> D3. If you must use add-shell....
>
> Avoid shell definitions with lots of type restrictions.

Yes, I agree with that!

-- 
Per Bojsen         The Design Automation Group     Email: bojsen@ithil.id.dtu.dk
MoDAG            Technical University of Denmark          bojsen@id.dtu.dk

From mccune@mcs.anl.gov  Tue Mar 14 10:40:01 1995
Return-Path: <mccune@mcs.anl.gov>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA03282; Tue, 14 Mar 95 10:40:01 CST
Received: from antares.mcs.anl.gov (mcs.anl.gov) by cli.com (4.1/SMI-4.1)
	id AA08085; Tue, 14 Mar 95 09:35:07 CST
Received: from lutra (lutra.mcs.anl.gov [140.221.5.137]) by antares.mcs.anl.gov (8.6.10/8.6.10)  with ESMTP
	id JAA16471; Tue, 14 Mar 1995 09:35:47 -0600
From: William McCune <mccune@mcs.anl.gov>
Date: Tue, 14 Mar 1995 09:35:45 -0600
Message-Id: <199503141535.JAA00350@lutra>
To: nqthm-users@cli.com
Subject: checking resolution/paramodulation proofs
Cc: mccune@mcs.anl.gov


I use and manage a resolution/paramodulation theorem prover called
Otter.  Otter has been patched together over the past 7 years, with
lots of new features added along the way, and not enough thought has
been given to how the features affect each other.  So Otter has quite
a few bugs.  I want to have high confidence in the proofs it finds,
and my approach is to have Otter output detailed proofs and have a
simple, independent program check the proofs.  Motivated by the QED
workshop last May, I wrote a proof checker in Nqthm logic; Nqthm
accepts the definitions, but I haven't yet tried to prove anything
about them.

The Otter "proof objects" have 5 kinds of step: instantiate variables,
resolve identical atoms, merge identical literals, paramodulate
identical terms, and flip equality literals.  THe proof checker
doesn't have to know about unification, and the positions of the
terms/literals operated on are given in the proof, so it is easy for
the checker to redo the steps.

What Nqthm work has been done on verifying proof systems?  (I know about
Shankar's work on first-order logic and the propositional logic
examples in ACL.)  I'm hoping for a simple definition of first-order
logic (with equality) that fits the proof checker.

(Ken Kunen brought up an interesting possibility (I might be a little
off on this): instead of defining an object logic, check the proofs
within nqthm logic.  The proofs are essentially just variable
instantiation, modus ponens (with conditions), and equality
substitution (with conditions).  Nqthm logic can do all of that, so
why not declare the function and predicate symbols in the proof, then
prove each step of the proof object as an nqthm lemma (with lots of
hints).  I haven't looked into this.)

Anyway, if anyone wishes to have a look at the proof checker, the
package, which includes lots of proof objects and some scripts for
checking them, can be found at

  ftp://info.mcs.anl.gov/pub/Otter/QED/check-3.tar.gz

I'm not an accomplished Nqthm user, and I'll welcome comments.

  Bill McCune

From tomek@topos.ipipan.gda.pl  Tue Apr 11 08:13:51 1995
Return-Path: <tomek@topos.ipipan.gda.pl>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA05549; Tue, 11 Apr 95 08:13:51 CDT
Received: from topos.ipipan.gda.pl by cli.com (4.1/SMI-4.1)
	id AA12885; Tue, 11 Apr 95 06:57:10 CDT
Received: (from tomek@localhost) by topos.ipipan.gda.pl (8.6.9/8.6.9) id NAA05453; Tue, 11 Apr 1995 13:57:07 +0200
Date: Tue, 11 Apr 1995 13:57:06 +0200 (MET DST)
From: Tomasz Borzyszkowski <tomek@topos.ipipan.gda.pl>
To: nqthm-users@cli.com
Message-Id: <Pine.SUN.3.91.950411135648.5008B-100000@topos>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

SUBSCRIBE


From @vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be  Wed Apr 12 09:36:13 1995
Return-Path: <@vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA05985; Wed, 12 Apr 95 09:36:13 CDT
Received: from vm1.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA16947; Wed, 12 Apr 95 08:31:54 CDT
Received: from ia10.montefiore.ulg.ac.be by vm1.ulg.ac.be (IBM VM SMTP V2R2)
   with TCP; Wed, 12 Apr 95 15:31:39 +0200
Received: from bbaguett@localhost
	  by ia10.montefiore.ulg.ac.be (8.6.10/ULG-7.5) id PAA01147
	  for nqthm-users@cli.com
	  at Wed, 12 Apr 1995 15:31:47 +0200
Date: Wed, 12 Apr 1995 15:31:47 +0200
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199504121331.PAA01147@ia10.montefiore.ulg.ac.be>
To: nqthm-users@cli.com
Subject: reference
Content-Length: 391



Does anybody know how to get a copy of "Verification of Communications Protocols 
and Abstract Process Models",Di Vito, Benedetto Lorenzo, PhD Thesis ICSCA-CMP-25,
University of Texas at Austin(1982)?

This reference is mentionned in "The Addition of Bounded Quantification and 
Partial Functions to A Computational Logic and its Theorem Prover",Boyer&Moore.

Thanks in advance.
-Benoit.

From kaufmann@cli.com  Wed Apr 12 09:51:24 1995
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA05997; Wed, 12 Apr 95 09:51:24 CDT
Received: from thunder.cli.com by cli.com (4.1/SMI-4.1)
	id AA17003; Wed, 12 Apr 95 08:50:51 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder.cli.com (4.1) id AA14252; Wed, 12 Apr 95 08:50:50 CDT
Date: Wed, 12 Apr 95 08:50:50 CDT
Message-Id: <9504121350.AA14252@thunder.cli.com>
To: bbaguett@montefiore.ulg.ac.be
Cc: nqthm-users@cli.com
In-Reply-To: <199504121331.PAA01147@ia10.montefiore.ulg.ac.be> (bbaguett@montefiore.ulg.ac.be)
Subject: Re: reference

We have ICSCA-CMP-25 here at CLInc.  I'd be happy to send you a copy,
electronically (the postscript file is about 741K) or hardcopy (in which case
I'll need your mailing address).
-- Matt Kaufmann

From moore@cli.com  Wed Apr 26 17:25:18 1995
Return-Path: <moore@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA03885; Wed, 26 Apr 95 17:25:18 CDT
Received: from rana.cli.com by cli.com (4.1/SMI-4.1)
	id AA26533; Wed, 26 Apr 95 16:20:25 CDT
From: moore@cli.com (J Strother Moore)
Received: by rana.cli.com (4.1) id AA18146; Wed, 26 Apr 95 16:20:24 CDT
Date: Wed, 26 Apr 95 16:20:24 CDT
Message-Id: <9504262120.AA18146@rana.cli.com>
To: nqthm-users@cli.com
Cc: homeier@cs.ucla.edu
Subject: vcg verification

Are any of you familiar with applications of Nqthm to verification condition
generators?  I am, of course, aware of Matt Kaufmann's related work (in which a
vcg-like device produces Nqthm lemmas sufficient to lead Nqthm to an
interpreter-based correctness result about a given program).

J


From @vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be  Sun May  7 09:37:06 1995
Return-Path: <@vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA03097; Sun, 7 May 95 09:37:06 CDT
Received: from vm1.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA00873; Sun, 7 May 95 08:42:57 CDT
Received: from micro4.montefiore.ulg.ac.be by vm1.ulg.ac.be (IBM VM SMTP V2R2)
   with TCP; Sun, 07 May 95 15:42:43 +0200
Received: from bbaguett@localhost
	  by micro4.montefiore.ulg.ac.be (8.6.10/ULG-7.5) id PAA02953
	  for nqthm-users@cli.com
	  at Sun, 7 May 1995 15:42:53 +0200
Date: Sun, 7 May 1995 15:42:53 +0200
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199505071342.PAA02953@micro4.montefiore.ulg.ac.be>
To: nqthm-users@cli.com
Subject: APPLY$


Does anybody can explain me the following results?

> (PROVE-LEMMA STRANGE1 () (APPLY$ 'AND (LIST T T F)))

This simplifies, unfolding APPLY$, to:

      T.

Q.E.D.


[ 0.0 0.0 0.1 ]
STRANGE1
>  (PROVE-LEMMA STRANGE2 () (APPLY$ 'AND (LIST T F T)))

This simplifies, unfolding APPLY$, to:

      F.

Need we go on?

************** F  A  I  L  E  D **************


[ 0.0 0.0 0.1 ]
NIL


Why does APPLY$ consider AND (and other functions) as binary operators?

Thanks in advance.

-Benoit.

From kaufmann@cli.com  Sun May  7 09:49:11 1995
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA03102; Sun, 7 May 95 09:49:11 CDT
Received: from thunder.cli.com by cli.com (4.1/SMI-4.1)
	id AA00892; Sun, 7 May 95 09:08:03 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder.cli.com (4.1) id AA26360; Sun, 7 May 95 09:08:02 CDT
Date: Sun, 7 May 95 09:08:02 CDT
Message-Id: <9505071408.AA26360@thunder.cli.com>
To: bbaguett@montefiore.ulg.ac.be
Cc: nqthm-users@cli.com
In-Reply-To: <199505071342.PAA02953@micro4.montefiore.ulg.ac.be> (bbaguett@montefiore.ulg.ac.be)
Subject: Re: APPLY$

Hi --

You asked:

>> Why does APPLY$ consider AND (and other functions) as binary operators?

I believe that a full answer may be found in Chapter 11 of "A Computational
Logic Handbook," but here's an informal, short answer.  Roughly speaking, the
interpreter functions APPLY$, EVAL$, V&C$, and V&C$ only "understand" the
formal syntax of Nqthm.  In the formal syntax every function symbol has a fixed
arity, including AND, which is binary.  So what happened is that

(APPLY$ 'AND (LIST T T F))

ignored the last argument of the given list.

Here is a transcript of a session that illustrates this point.

thunder(kaufmann)[65]% nqthm-1992
GCL (GNU Common Lisp)  Version(1.1) Thu Oct 27 11:43:35 CDT 1994
Licensed under GNU Public Library License
Contains Enhancements by W. Schelter

Nqthm-1992.
Initialized with (BOOT-STRAP NQTHM) on November 23, 1994  14:47:38.
>(load "/slocal/src/pc-nqthm-1992/misc/bm-trace.lisp")
Loading /slocal/src/pc-nqthm-1992/misc/bm-trace.lisp
NOTE:  Now redefining R-LOOP1 so that TRACE and UNTRACE have new 
meanings.  Use OLD-TRACE and OLD-UNTRACE to get the old commands.
Finished loading /slocal/src/pc-nqthm-1992/misc/bm-trace.lisp
T

>(r-loop)

Trace Mode: Off   Abbreviated Output Mode:  On
Type ? for help.
*trace apply$ and

NOTE: This is your first time using the Boyer-Moore function tracing facility
from inside R-LOOP.  Keep in mind that when you specify functions for tracing
or untracing, you should NOT surround this list with parentheses.  When using
TRACE, you are allowed to put all your function specs on the line with TRACE
or else hit <return> and respond to the prompt.  Please report any bugs or
suggestions for improvements to Matt Kaufmann.

(APPLY$ AND) 
*(APPLY$ 'AND (LIST T T F))
  1> (<<APPLY$>> (LIST 'AND (LIST T T F)))
    2> (<<AND>> (LIST T T))
    <2 (<<AND>> T)
  <1 (<<APPLY$>> T)
 T
*(APPLY$ 'AND (LIST T F T))
  1> (<<APPLY$>> (LIST 'AND (LIST T F T)))
    2> (<<AND>> (LIST T F))
    <2 (<<AND>> F)
  <1 (<<APPLY$>> F)
 F
*

-- Matt Kaufmann

From @vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be  Wed May 10 13:12:48 1995
Return-Path: <@vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01042; Wed, 10 May 95 13:12:48 CDT
Received: from vm1.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA10612; Wed, 10 May 95 11:45:13 CDT
Received: from micro4.montefiore.ulg.ac.be by vm1.ulg.ac.be (IBM VM SMTP V2R2)
   with TCP; Wed, 10 May 95 18:21:26 +0200
Received: from bbaguett@localhost
	  by micro4.montefiore.ulg.ac.be (8.6.10/ULG-7.5) id SAA17513
	  for nqthm-users@cli.com
	  at Wed, 10 May 1995 18:21:37 +0200
Date: Wed, 10 May 1995 18:21:37 +0200
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199505101621.SAA17513@micro4.montefiore.ulg.ac.be>
To: nqthm-users@cli.com
Subject: NQTHM

I've written a system based on nqthm for proving invariants. This 
system takes a state which is constrained to verify the invariant, and a 
transition which is constrained to be a member of the transitions of the 
program. A function computes the next state and the prover tries to demonstrate
that this "new" state verifies the invariant. I've tried this system on 
Peterson's algorithm and have found that the system behaviour is dependent of 
the way the invariant is written.

When the invariant is:
  
(defn 
  inv ()
  '(and
    (implies
     (equal p 'pw) (or (equal turn 'q) (equal q 'qw)))
    (and
     (implies
      (equal q 'qw) (or (equal turn 'p) (equal p 'pw)))
     (and
      (implies 
       (equal p 'pc) (or (equal turn 'p) (or (equal inq 'F*) (equal q 'qi))))
      (and
       (implies 
	(equal q 'qc) (or (equal turn 'q) (or (equal inp 'F*) (equal p 'pi))))
       (and
	(iff
	 (equal p 'p0) (equal inp 'F*))
	(iff 
	 (equal q 'q0) (equal inq 'F*))))))))

The response of the system is:

...

This simplifies, applying EVAL-EQUAL, EVAL-OR, EVAL-IMPLIES, EVAL-IFF,
EVAL-AND, CAR-CONS, and CDR-CONS, and opening up the definitions of PROGRAMP,
LITATOM, EQUAL, EVAL, CDR, CAR, LISTP, IMPLIES, MEMBER, VARIABLE-LIST, MODIF,
NULL, CONS, APPEND, and ASSOC, to five new formulas:
                                 ------
...

Q.E.D.


[ 0.0 87.7 2.4 ]

And when the invariant is:

(defn 
  inv ()
  '(and
    (implies
     (equal p 'pw) (or (equal turn 'q) (equal q 'qw)))
    (and
     (implies 
      (equal p 'pc) (or (equal turn 'p)(or (equal inq 'F*) (equal q 'qi))))
     (and
      (iff
       (equal p 'p0) (equal inp 'F*))
      (and
       (iff 
	(equal q 'q0) (equal inq 'F*))
       (and
	(implies 
	 (equal q 'qc) (or (equal turn 'q)(or (equal inp 'F*) (equal p 'pi))))
	(implies
	 (equal q 'qw) (or (equal turn 'p) (equal p 'pw)))))))))

The response of the system is:

...

This simplifies, applying EVAL-EQUAL, EVAL-OR, EVAL-IMPLIES, EVAL-IFF,
EVAL-AND, CAR-CONS, and CDR-CONS, and opening up the definitions of PROGRAMP,
LITATOM, EQUAL, EVAL, CDR, CAR, LISTP, IMPLIES, MEMBER, VARIABLE-LIST, MODIF,
NULL, CONS, APPEND, and ASSOC, to seven new formulas:
                                 -------  

...

Q.E.D.


[ 0.0 94.4 3.2 ]

Is it due to a conditional AND's implementation?

If not, why is this happening?

Is there a specific order to improve the number of cases examinated ?

Thanks in advance,
Cheers,
Benoit.

From kepser@cis.uni-muenchen.de  Tue Jun 13 21:04:17 1995
Return-Path: <kepser@cis.uni-muenchen.de>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA06402; Tue, 13 Jun 95 21:04:17 CDT
Received: from thecube.cis.uni-muenchen.de by cli.com (4.1/SMI-4.1)
	id AA15828; Tue, 13 Jun 95 19:54:41 CDT
Received: from track by thecube.cis.uni-muenchen.de (NX5.67e/NX3.0M)
	id AA19741; Wed, 14 Jun 95 02:54:36 +0200
From: Stephan Kepser <kepser@cis.uni-muenchen.de>
Message-Id: <9506140054.AA19741@thecube.cis.uni-muenchen.de>
Received: by track.cis.uni-muenchen.de (NX5.67e/NX3.0X)
	id AA13621; Wed, 14 Jun 95 02:54:33 +0200
Date: Wed, 14 Jun 95 02:54:33 +0200
To: nqthm-users@cli.com
Subject: 1st CFP FroCS96



                       First Call for Papers

                    First International Workshop

                 ``Frontiers of Combining Systems''
                             FroCoS'96

                 March 26-29, 1996, Munich, Germany.



In various areas of logic, computation, language processing, and
artificial intelligence there is an obvious need for using specialized
formalisms and inference mechanisms for special tasks. In order to be
usable in practice, these specialized systems must be combined with
each other, and they must be integrated into general purpose systems.
The development of general techniques for the combination and
integration of special systems has been initiated in many areas,
and the Workshop ``Frontiers of Combining Systems'' intends to offer a
common forum for these research activities. Furthermore, it gives the
possibility to present results on particular instances of combination
and integration, and on their practical use.

Suggested, but not exclusive
topics of interest for the workshop are:

 * combination of logics (e.g., modal logics, logics in AI, ...)

 * combination of constraint solving techniques  
     (unification and matching algorithms, general symbolic
      constraints, numerical constraints, ...)
     and combination of decision procedures

 * integration of equational and other theories into deductive systems
     (e.g. theory resolution, constraint resolution, constraint
      paramodulation, ...)

 * combination of term rewriting systems

 * integration of data structures (e.g., sets, multisets, lists) into
     CLP formalisms and deduction processes

 * hybrid systems in computational linguistics, knowledge representation,
     natural language semantics, and human computer interaction

 * logic modelling of multi-agent systems.


We hope to attract high quality original papers that cover relevant
aspects of these topics. All submissions will be thoroughly evaluated.
On the basis of the referee reports, papers will be selected for
presentation at the workshop and for the proceedings.  We intend to
publish the proceedings as one volume of the Kluwer series on
``Applied Logic''.


Program Committee:

F. Baader, P. Baumgartner, P. Blackburn, A. Bockmayr, A. Boudet,
J. Calmet, A. Colmerauer, D.M. Gabbay, H. Kirchner, H.J. Ohlbach,
J. Pfalzgraf, M. de Rijke, W. Rounds, M. Schmidt-Schauss,
K.U. Schulz. 


Program Chair:

F. Baader  &  K.U. Schulz.


Local Organization:

K.U. Schulz, 
CIS, University of Munich, 
Wagmuellerstr. 23, 
D-80538 Muenchen, 
Germany
E-mail: schulz@cis.uni-muenchen.de


Paper submissions:

A PostScript version of the full paper (preferable LaTeX format), not
exceeding 15 pages (incl. title page and references), should be
received via e-mail by October 16, 1995.  In addition, one hard copy
of the paper should be received by the same date.  Results must be
unpublished, and not submitted for publication elsewhere.  Submissions
should start with title, author(s) (names, correspondence addresses,
e-mail addresses), and abstract. Please send submissions to the local
organizer.

Notification of Acceptance: December 1, 1995.

Final Versions due: January 1, 1996.

Information on FroCoS'96 is available by WWW:  
   http://www.cis.uni-muenchen.de   (under ``events'').





--------------------------- LaTeX Version -----------------------------

\documentstyle{article}

\pagestyle{empty}

\textheight=760pt\textwidth=470pt\topmargin -45pt
\oddsidemargin=0pt\evensidemargin=0pt\abovedisplayskip=0pt
\belowdisplayskip=0pt\leftmargin=.4cm
\parindent0pt
\parskip 0pt
\topskip0pt 
\begin{document}

\begin{center} \large
First Call for Papers\\[6pt]

First International Workshop\\[6pt]
{\Huge ``Frontiers of Combining Systems''}\\[6pt]
FroCoS'96\\[7pt]
\large March 26-29, 1996, Munich, Germany.
\end{center}


In various areas of logic, computation, language processing, and
artificial intelligence there is an obvious need for using specialized
formalisms and inference mechanisms for special tasks. In order to be
usable in practice, these specialized systems must be combined with
each other, and they must be integrated into general purpose systems.
The development of general techniques for the combination and
integration of special systems has been initiated in many areas, and
the Workshop ``Frontiers of Combining Systems'' intends to offer a
common forum for these research activities. Furthermore, it gives the
possibility to present results on particular instances of combination
and integration, and on their practical use.

Suggested, but not exclusive
topics of interest for the workshop are:\vspace*{-5pt}
\begin{itemize}\topsep 0pt\parsep 0pt \itemsep 0pt
 \item combination of logics (e.g., modal logics, logics in AI,\dots)
 \item combination of constraint solving techniques  
      (unification and matching algorithms, general symbolic
	constraints, numerical constraints,\dots) and  
       combination of decision procedures
 \item integration of equational and other theories into deductive
	systems (e.g. theory resolution, constraint resolution,
	constraint paramodulation,\dots) 
 \item combination of term rewriting systems
 \item integration of data structures (e.g., sets, multisets, lists) into
     CLP formalisms and deduction processes
 \item hybrid systems in computational linguistics, knowledge
	representation, natural language semantics, and human computer
	interaction 
 \item logic modelling of multi-agent systems.
\end{itemize}

We hope to attract high quality original papers that cover relevant
aspects of these topics. All submissions will be thoroughly evaluated.
On the basis of the referee reports, papers will be selected for
presentation at the workshop and for the proceedings.  We intend to
publish the proceedings as one volume of the Kluwer series on
``Applied Logic''.

\subsubsection*{Program Committee:}

F.~Baader, P.~Baumgartner, P.~Blackburn, A.~Bockmayr, A.~Boudet,
J.~Calmet, A.~Colmerauer, D.M.~Gabbay, H.~Kirchner, H.J.~Ohlbach,
J.~Pfalzgraf, M.~de Rijke, W.~Rounds, M.~Schmidt-Schau{\ss},
K.U.~Schulz.

\subsubsection*{Program Chair:}

F.~Baader \& K.U.~Schulz.

\subsubsection*{Local Organization:} 

K.U.~Schulz, CIS, University of Munich, Wagm\"ullerstr.~23, D-80538
M\"unchen, Germany\\ E-mail: \verb|schulz@cis.uni-muenchen.de|

\subsubsection*{Paper submissions:} 

A PostScript version of the full paper (preferable LaTeX format), not
exceeding 15 pages (incl. title page and references), should be
received via e-mail by October 16, 1995.  In addition, one hard copy
of the paper should be received by the same date.  Results must be
unpublished, and not submitted for publication elsewhere.  Submissions
should start with title, author(s) (names, correspondence addresses,
e-mail addresses), and abstract. Please send submissions to the local
organizer.

Notification of Acceptance: December 1, 1995.

Final Versions due: January 1, 1996.

Information on FroCoS'96 is available by WWW: {\tt
http://www.cis.uni-muenchen.de} (under ``events'').  

\end{document}

From @vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be  Thu Jul 13 09:44:11 1995
Return-Path: <@vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA19155; Thu, 13 Jul 95 09:44:11 CDT
Received: from vm1.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA23274; Thu, 13 Jul 95 08:11:40 CDT
Received: from micro6.montefiore.ulg.ac.be by vm1.ulg.ac.be (IBM VM SMTP V2R2)
   with TCP; Thu, 13 Jul 95 15:11:30 +0200
Received: from bbaguett@localhost
	  by micro6.montefiore.ulg.ac.be (8.6.10/ULG-7.5) id PAA17181
	  for nqthm-users@cli.com
	  at Thu, 13 Jul 1995 15:11:20 +0200
Date: Thu, 13 Jul 1995 15:11:20 +0200
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199507131311.PAA17181@micro6.montefiore.ulg.ac.be>
To: nqthm-users@cli.com
Subject: Formalization of propositional calculus and equality
Content-Length: 239

In 'A Computational Logic Handbook', R.S. Boyer and J.S. Moore include the
Shoenfield's formalization. 
Are those axioms'analogues really used within the system?
If not, could you tell me which ones are used?

Thanks in advance.

-Benoit.

From @vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be  Thu Jul 13 10:45:40 1995
Return-Path: <@vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA19176; Thu, 13 Jul 95 10:45:40 CDT
Received: from vm1.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA23542; Thu, 13 Jul 95 09:48:14 CDT
Received: from micro6.montefiore.ulg.ac.be by vm1.ulg.ac.be (IBM VM SMTP V2R2)
   with TCP; Thu, 13 Jul 95 16:47:59 +0200
Received: from bbaguett@localhost
	  by micro6.montefiore.ulg.ac.be (8.6.10/ULG-7.5) id QAA18656
	  for nqthm-users@cli.com
	  at Thu, 13 Jul 1995 16:48:05 +0200
Date: Thu, 13 Jul 1995 16:48:05 +0200
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199507131448.QAA18656@micro6.montefiore.ulg.ac.be>
To: nqthm-users@cli.com
Subject: Formalization of propositional calculus and equality
Content-Length: 239

In 'A Computational Logic Handbook', R.S. Boyer and J.S. Moore include the
Shoenfield's formalization. 
Are those axioms'analogues really used within the system?
If not, could you tell me which ones are used?

Thanks in advance.

-Benoit.

From Hakim.Bouamama@imag.fr  Thu Jul 20 06:54:47 1995
Return-Path: <Hakim.Bouamama@imag.fr>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA21945; Thu, 20 Jul 95 06:54:47 CDT
Received: from imag.imag.fr by cli.com (4.1/SMI-4.1)
	id AA13923; Thu, 20 Jul 95 05:37:56 CDT
Received: from droopy.imag.fr (droopy.imag.fr [129.88.40.11]) by imag.imag.fr (8.6.11/8.6.9) with ESMTP id MAA19790 for <nqthm-users@cli.com>; Thu, 20 Jul 1995 12:37:40 +0200
Received: from esmeralda.imag.fr (esmeralda.imag.fr [129.88.40.13]) by droopy.imag.fr (8.6.10/8.6.9) with ESMTP id MAA25350 for <nqthm-users@cli.com>; Thu, 20 Jul 1995 12:36:49 +0200
From: Hakim Bouamama <Hakim.Bouamama@imag.fr>
Received: (bouamama@localhost) by esmeralda.imag.fr (8.6.10/8.6.9) id MAA02304 for nqthm-users@cli.com; Thu, 20 Jul 1995 12:37:36 +0200
Date: Thu, 20 Jul 1995 12:37:36 +0200
Message-Id: <199507201037.MAA02304@esmeralda.imag.fr>
To: nqthm-users@cli.com
Subject: Just a test

test of my mailing-list for nqthm...

Hakim.

From @vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be  Fri Jul 21 11:39:03 1995
Return-Path: <@vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA22609; Fri, 21 Jul 95 11:39:03 CDT
Received: from vm1.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA17762; Fri, 21 Jul 95 10:12:10 CDT
Received: from micro6.montefiore.ulg.ac.be by vm1.ulg.ac.be (IBM VM SMTP V2R2)
   with TCP; Fri, 21 Jul 95 16:47:13 +0200
Received: from bbaguett@localhost
	  by micro6.montefiore.ulg.ac.be (8.6.10/ULG-7.5) id QAA02582
	  for nqthm-users@cli.com
	  at Fri, 21 Jul 1995 16:47:10 +0200
Date: Fri, 21 Jul 1995 16:47:10 +0200
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199507211447.QAA02582@micro6.montefiore.ulg.ac.be>
To: nqthm-users@cli.com
Subject: EVAL
Content-Length: 147

Does anybody know if it is possible to get the same response in these two cases:

(prove-lemma e1 () (implies (equal q 'q0) (not (equal q 'q0))))


From @vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be  Fri Jul 21 11:57:41 1995
Return-Path: <@vm1.ulg.ac.be:bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA22613; Fri, 21 Jul 95 11:57:41 CDT
Received: from vm1.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA17848; Fri, 21 Jul 95 10:35:55 CDT
Received: from micro6.montefiore.ulg.ac.be by vm1.ulg.ac.be (IBM VM SMTP V2R2)
   with TCP; Fri, 21 Jul 95 16:50:25 +0200
Received: from bbaguett@localhost
	  by micro6.montefiore.ulg.ac.be (8.6.10/ULG-7.5) id QAA02596
	  for nqthm-users@cli.com
	  at Fri, 21 Jul 1995 16:50:30 +0200
Date: Fri, 21 Jul 1995 16:50:30 +0200
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199507211450.QAA02596@micro6.montefiore.ulg.ac.be>
To: nqthm-users@cli.com
Subject: EVAL (following)
Content-Length: 237


(prove-lemma e2 () (eval$ T '(implies (equal q 'q0) (not (equal q 'q0))) ()))

This formula simplifies, opening up the definition of EVAL$, to:

      T.


I'd like to get the same response with the second case as with the first one.

From kaufmann@cli.com  Fri Jul 21 12:29:59 1995
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA22626; Fri, 21 Jul 95 12:29:59 CDT
Received: from thunder.cli.com by cli.com (4.1/SMI-4.1)
	id AA17937; Fri, 21 Jul 95 10:50:21 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder.cli.com (4.1) id AA26293; Fri, 21 Jul 95 10:50:21 CDT
Date: Fri, 21 Jul 95 10:50:21 CDT
Message-Id: <9507211550.AA26293@thunder.cli.com>
To: bbaguett@montefiore.ulg.ac.be
Cc: nqthm-users@cli.com
In-Reply-To: <199507211450.QAA02596@micro6.montefiore.ulg.ac.be> (bbaguett@montefiore.ulg.ac.be)
Subject: Re: EVAL (following)

In your call of eval$, you supply an empty last argument, which is an argument
that associates symbols with values.  I think that what you meant was something
more like the following:

  >(prove-lemma e2 () (eval$ T '(implies (equal q 'q0) (not (equal q 'q0)))
			     (list (cons 'q xxx))))

  This conjecture simplifies, applying REWRITE-EVAL$, and unfolding the
  definitions of NOT and IMPLIES, to:

	(NOT (EQUAL XXX 'Q0)).

  This again simplifies, obviously, to:

	F.

  Why say more?

  ************** F  A  I  L  E  D **************


  [ 0.0 0.0 0.0 ]
  NIL

  >

Eval$ is about the hairiest part of Nqthm; many of us avoid it except when
absolutely necessary.  Note by the way that when a symbol isn't bound, eval$
treats it as 0.  For example:

  >(r-loop)

  Trace Mode: Off   Abbreviated Output Mode:  On
  Type ? for help.
  *(eval$ t '(cons x y) nil)
   '(0 . 0)
  *

-- Matt Kaufmann

From young@cli.com  Fri Jul 21 12:44:17 1995
Return-Path: <young@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA22643; Fri, 21 Jul 95 12:44:17 CDT
Received: from duck.cli.com by cli.com (4.1/SMI-4.1)
	id AA17981; Fri, 21 Jul 95 11:15:20 CDT
From: young@cli.com (Bill Young)
Received: by duck.cli.com (4.1) id AA16644; Fri, 21 Jul 95 11:14:24 CDT
Date: Fri, 21 Jul 95 11:14:24 CDT
Message-Id: <9507211614.AA16644@duck.cli.com>
To: bbaguett@montefiore.ulg.ac.be
Cc: nqthm-users@cli.com
In-Reply-To: Benoit Baguette's message of Fri, 21 Jul 1995 16:50:30 +0200 <199507211450.QAA02596@micro6.montefiore.ulg.ac.be>
Subject: EVAL (following)


By the way,  I suspect that the theorem you really meant was:

(prove-lemma e3 () 
     (eval$ T '(implies (equal q 'q0) (not (equal q 'q0))) ALIST))

rather than:

(prove-lemma e2 () 
     (eval$ T '(implies (equal q 'q0) (not (equal q 'q0))) ()))

That is, you want to know whether the implies reduces to non-F with an
arbitrary alist, not just an alist of NIL.  It doesn't; some values of
ALIST make q equal to 'q0 and some don't.  That is really the theorem
that is (in some sense) equivalent to:

(prove-lemma e1 () (implies (equal q 'q0) (not (equal q 'q0))))

--Bill Young

From young@cli.com  Fri Jul 21 12:46:08 1995
Return-Path: <young@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA22647; Fri, 21 Jul 95 12:46:08 CDT
Received: from duck.cli.com by cli.com (4.1/SMI-4.1)
	id AA17948; Fri, 21 Jul 95 10:58:01 CDT
From: young@cli.com (Bill Young)
Received: by duck.cli.com (4.1) id AA16636; Fri, 21 Jul 95 10:58:00 CDT
Date: Fri, 21 Jul 95 10:58:00 CDT
Message-Id: <9507211558.AA16636@duck.cli.com>
To: bbaguett@montefiore.ulg.ac.be
Cc: nqthm-users@cli.com
In-Reply-To: Benoit Baguette's message of Fri, 21 Jul 1995 16:50:30 +0200 <199507211450.QAA02596@micro6.montefiore.ulg.ac.be>
Subject: EVAL (following)


I think your question is why isn't this a theorem:

  (prove-lemma e1 () (implies (equal q 'q0) (not (equal q 'q0))))

if this is:

   (prove-lemma e2 () (eval$ T '(implies (equal q 'q0) (not (equal q 'q0))) ()))


The answer is that the first is simply not a theorem. It's of the form

   (implies x (not x))  

If x is not f, this is essentially (implies T F) which reduces to F.

The second case is more subtle.  Since you gave a null alist argument,
the value of q is 0.  So the eval$ expression reduces to:

  (implies (equal 0 'q0) (not (equal 0 'q0)))

Since the antecedent is false, this reduces to true.  

--Bill Young

From @MIZZOU1.missouri.edu:mohamed@sun1.ece.missouri.edu  Thu Jul 27 17:15:02 1995
Return-Path: <@MIZZOU1.missouri.edu:mohamed@sun1.ece.missouri.edu>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA25265; Thu, 27 Jul 95 17:15:02 CDT
Received: from MIZZOU1.missouri.edu by cli.com (4.1/SMI-4.1)
	id AA03907; Thu, 27 Jul 95 15:53:38 CDT
Received: from sun1.ece.missouri.edu by MIZZOU1.missouri.edu (IBM VM SMTP V2R3)
   with TCP; Thu, 27 Jul 95 15:15:12 CDT
Date: Thu, 27 Jul 95 15:14:46 CDT
From: mohamed@sun1.ece.missouri.edu (Magdi Mohamed)
Message-Id: <9507272014.AA13370@sun1.ece.missouri.edu>
To: nqthm-users@cli.com


Dr. Robert S. Boyer
Computational Logic, Inc.
1717 W. 6th St., Suite 290
Austin, TX 78703-4776

boyer@cli.com

Dear Dr. Boyer:

     I am writing you this message and enclosing my resume to
introduce myself to you and inquire about job opportunities that you
might have.

     I am an Electrical & Computer Engineering Ph.D. graduate from the
University of Missouri-Columbia (May 1995). I have been conducting research 
in the area of "Handwritten Word Recognition" since 1991, using real data
coming from the United States Post Office mail stream. My dissertation topic
is "Handwritten Word Recognition Using Generalized Hidden Markov Models". In
general, my research interests include Signal & Image Processing, Computer
Vision, Fuzzy Set Theory, Neural Networks, Parallel & Distributed Computing,
Artificial Intelligence, Pattern Recognition, and Fractals & Chaos Theory.

     In addition to my course work, I have held teaching and research
assistantships at the University of Khartoum-Sudan and at the
University of Missouri-Columbia. I have also worked as a Computer Engineer
for consultation and hardware support at ComputerMan Ltd. in Khartoum, and
as an Electrical and Communication Engineer at Sudan National Broadcasting
Corporation. Currently, I am working as a research associate in the
Electrical and Computer Engineering Department at the University of
Missouri-Columbia, U.S.A.

     Considering my academic background, teaching and research experience, 
I am extremely confident that I can make a significant contribution to your
company. I am very enthusiastic at the prospect of being considered
for a position.

     I look forward to hearing from you about the possibility of employment 
in your company.  Please contact me at your convenience if you have
questions or comments concerning my application.  Thank you for your
consideration.




                        MAGDI A. MOHAMED
                      4901 Aztec Blvd. #70
                 Columbia, Missouri 65202, U.S.A.
                    Home Phone: (314)474-9603
                    Work Phone: (314)882-6783
              E-mail: mohamed@sunpg.ece.missouri.edu


EDUCATION:

     Ph.D. "Handwritten Word Recognition Using Generalized Hidden Markov Models"
           Electrical & Computer Engineering
           University of Missouri, Columbia, U.S.A, May 1995

     M.S.  "Sorting Algorithms on Hypercube Multicomputers"
           Computer Science
           University of Missouri, Columbia, U.S.A, August 1990

     B.S.  Electrical Engineering
           University of Khartoum, Khartoum, Sudan, September 1983


POSITIONS HELD:

     Research Associate, Department of Electrical and Computer Engineering,
     University of Missouri-Columbia, Missouri, U.S.A., June 1995 - Present.

     Graduate Teaching Assistant, Department of Electrical & Computer
     Engineering, University of Missouri-Columbia, Missouri, U.S.A.,
     September 1993 - Present.

     Graduate Research Assistant, Department of Electrical & Computer
     Engineering, University of Missouri-Columbia, Missouri, U.S.A.,
     December 1991 - December 1994.

     Graduate Grader, Department of Computer Science,
     University of Missouri-Columbia, Missouri, U.S.A.,
     January 1990 - May 1990. 

     Computer Engineer, Consultation and Hardware Support,
     ComputerMan Ltd., Khartoum, Sudan, 
     January 1985 - June 1988. 

     Teaching Assistant, Computer Center, 
     University of Khartoum, Khartoum, Sudan, 
     January 1985 - June 1988.

     Electrical and Telecommunication Engineer,
     Sudan National Broadcasting Corporation, Omdurman, Sudan,
     December 1983 - December 1984.


RESEARCH INTERESTS:

     (1) Signal & Image Processing
     (2) Computer Vision
     (3) Fuzzy Set Theory
     (4) Neural Networks
     (5) Parallel & Distributed Computing
     (6) Artifical Intelligence
     (7) Pattern Recognition
     (8) Fractals & Chaos Theory




                            --- PAGE TWO ---


AWARDS, FELLOWSHIPS, AND PRIZES:

    "The Donald K. Anderson Graduate Student Teaching Award for 1994-95",
    Graduate School, University of Missouri-Columbia, Missouri, U.S.A.,
    March 1995.

    "A Prfessional Presentation Travel Fellowship", Graduate School,
    University of Missouri-Columbia, Missouri, U.S.A., September 1994.

    "Public Electricity And Water Corporation Prize For Best Final Year
    Student In The Department of Electrical Engineering", Department of
    Electrical Engineering, University of Khartoum, Khartoum, Sudan,
    September 1983.

    "Sayed Mirghani Hamza Prize for Best Performance in Final Year
    Electrical Engineering", Department of Electrical Engineering,
    University of Khartoum, Khartoum, Sudan, September 1983.

    "University Prize for Best Performance in Third Year Electrical
    Engineering", Department of Electrical Engineering, University of
    Khartoum, Khartoum, Sudan, November 1982.

    "Sayed Mohamed Abd Rabu's Prize for Best Performance in Second
    Year Electrical Engineering", Department of Electrical Engineering,
    University of Khartoum, Khartoum, Sudan, June 1981.


REFERED JOURNAL ARTICLES:

     J.M. Keller, P.D. Gader, Hossein Tahani, Jung-Hsien, and Magdi
     Mohamed, "Advances in Fuzzy Integration for Pattern Recognition",
     Fuzzy Sets and Systems, Volume 65, pp. 273-283, 1994.

     Magdi Mohamed and Paul Gader, "Handwritten Word Recognition Using
     Segmentation-Free Hidden Markov Modeling and Segmentation-Based
     Dynamic Programming Techniques", to appear in IEEE Trans. Pattern
     Analysis and Machine Intelligence, 1994.

     P.D. Gader, Magdi Mohamed, and Jung-Hsien Chiang, "Handwritten
     Word Recognition with Character and Inter-Character Neural Networks",
     submitted to IEEE Trans. Sys. Man Cybernetics, 1993.

     P.D. Gader, Magdi Mohamed, and Jung-Hsien Chiang, "Comparison of
     Crisp and Fuzzy Character Neural Networks in Handwritten Word
     Recognition", to appear in IEEE Trans. Fuzzy Systems, 1995.

     P.D. Gader, J.M. Keller, R. Krishnapuram, Jung-Hsien Chiang, and
     Magdi Mohamed, "Neural and Fuzzy Methods in Handwriting Recognition",
     submitted to IEEE Computer Journal, 1995.

     P.D. Gader, Magdi Mohamed, and James M. Keller, "Dynamic Programming
     Based Handwritten Word Recognition using the Choquet Integral as the
     Match Function", submitted to Journal of Electronic Imaging,
     Copublished by SPIE and IS&T, Special Section on Digital Document
     Imaging, January 1996.



                            --- PAGE THREE ---


CONFERENCE PAPERS AND PRESENTATIONS:

     Magdi Mohamed and P.D. Gader, "Generalization of Hidden Markov
     Models Using Fuzzy Integrals", Proceeding of the North American
     Fuzzy Information Processing Society, (NAFIPS'94), San Antonio
     Texas, December 1994, pp. 3-7.

     P.D. Gader, Magdi Mohamed, and James M. Keller,  "Applications of
     Fuzzy Integrals to Handwriting Recognition", Proceedings of SPIE
     Conference, Applications of Fuzzy Logic Technology II, Orlando,
     Florida, April 1995.

     P.D. Gader and Magdi Mohamed, "Multiple Classifier Fusion For
     Handwritten Word Recognition", to appear in IEEE International
     Conference on Systems, Man and Cybernetics, Vancouver, British
     Columbia, Canada, October 1995.

     P.D. Gader, Magdi Mohamed, and J. Chiang, "Comparison of Crisp
     and Fuzzy Character Networks in Handwritten Word Recognition",
     Proceeding of the North American Fuzzy Information Processing 
     Society, (NAFIPS'92), Puerto Vallarta, Mexico, Decemeber 1992, 
     pp. 257-266.
     
     P.D. Gader, Magdi Mohamed, and J. Chiang, "Segmentation-Based
     Handwritten Word Recognition", Proceeding of the 5th United 
     States Postal Service Advanced Technology Conference, Washington,
     D.C., November 1992, pp. 215-225.

     P.D. Gader, Magdi Mohamed, and J. Chiang, "Fuzzy and Crisp
     Handwritten Character Recognition Using Neural Networks",
     Proceeding of Artificial Neural Networks in Engineering, St. Louis,
     Missouri, November 1992, pp. 421-426.

     P.D. Gader, James M. Keller, Harikrishan Nair, Magdi Mohamed, and
     Jung-Husien Chiang,  "The Principle of Least Commitment in Computer
     Vision", Proceedings of the Fourth Annual Midwest Electro-Technology
     Conference, Ames, Iowa, March 1995.

     Youran Lan and Magdi Mohamed, "Parallel Quicksort in Hypercube
     Multicomputers", ACM, 1992 Symposium on Applied Computing, (SAC'92),
     Kansas City, Missouri, March 1992, pp. 740-746.


REVIEWING DUTIES:

     Journal of Intelligent and Fuzzy Systems
     1994 - Present.

     IEEE Transactions on Neural Networks
     1995 - Present.

     Journal of Mathematical Imaging and Vision
     1995 - Present.



                            --- PAGE FOUR ---


REFERENCES:

(1) Professor Paul Gader
    Department of Electrical and Computer Engineering
    University of Missouri-Columbia
    Columbia, Missouri 65211, U.S.A.
    Phone: (314)882-3644
    E-mail: gader@sunpg.ece.missouri.edu

(2) Professor James Keller
    Department of Electrical and Computer Engineering
    University of Missouri-Columbia
    Columbia, Missouri 65211, U.S.A.
    Phone: (314)882-7339 
    E-mail: keller@sun1.ece.missouri.edu

(3) Professor Raghu Krishnapuram 
    Department of Electrical and Computer Engineering
    University of Missouri-Columbia
    Columbia, Missouri 65211, U.S.A.
    Phone: (314)882-7766 
    E-mail: raghu@sun1.ece.missouri.edu

(4) Professor Xinhua Zhuang 
    Department of Electrical and Computer Engineering
    University of Missouri-Columbia
    Columbia, Missouri 65211, U.S.A.
    Phone: (314)882-2382 
    E-mail: zhuang@sun1.ece.missouri.edu

(5) Professor Paul Blackwell 
    Department of Computer Science 
    University of Missouri-Columbia
    Columbia, Missouri 65211, U.S.A.
    Phone: (314)882-6483 
    E-mail: CSPKB@MIZZOU1.missouri.edu



From hunt@cli.com  Thu Aug 17 13:14:18 1995
Return-Path: <hunt@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA04484; Thu, 17 Aug 95 13:14:18 CDT
Received: from dilbert.cli.com by cli.com (4.1/SMI-4.1)
	id AA28051; Thu, 17 Aug 95 12:12:52 CDT
From: hunt@cli.com (Warren A. Hunt Jr.)
Received: by dilbert.cli.com (4.1) id AA27970; Thu, 17 Aug 95 12:12:51 CDT
Date: Thu, 17 Aug 95 12:12:51 CDT
Message-Id: <9508171712.AA27970@dilbert.cli.com>
To: nqthm-users@cli.com
Subject: FM9001 Release Announcement

                      The FM9001 Microprocessor:
                     Its Formal Specification and
                     Mechanical Correctness Proof

                            Summer 1995

We are releasing the mechanically checked proof scripts for the FM9001
microprocessor.  The FM9001 is a general-purpose 32-bit microprocessor
which has been implemented as a CMOS ASIC.  The proof being released
rigorously connects the expression of the FM9001 as a netlist with the
characterization of the FM9001 at the machine-code programmer's level.
(The FM9001 is the foundation of the `CLI Stack', which also includes
several verified compilers and applications all running on the FM9001.
Other parts of the `CLI Stack' are separately released.)

To obtain information about the FM9001 microprocessor and proof,
please examine the URL http://www.cli.com/hardware/fm9001.html

To obtain the FM9001 system, connect to Internet site ftp.cli.com by
anonymous ftp, giving your email address as the password, `get' the
file /pub/fm9001/README and follow the instructions therein.  Or get
the URL ftp://ftp.cli.com/pub/fm9001/README via your WWW browser.

Bishop C. Brock and Warren A. Hunt, Jr.
brock@cli.com       hunt@cli.com


From bbaguett@montefiore.ulg.ac.be  Sat Sep  9 11:23:19 1995
Return-Path: <bbaguett@montefiore.ulg.ac.be>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA03075; Sat, 9 Sep 95 11:23:19 CDT
Received: from aix1.segi.ulg.ac.be by cli.com (4.1/SMI-4.1)
	id AA05028; Sat, 9 Sep 95 10:26:15 CDT
Received: from micro4.montefiore.ulg.ac.be (bbaguett@micro4.montefiore.ulg.ac.be [139.165.16.71]) by aix1.segi.ulg.ac.be (8.6.10/8.6.10) with ESMTP id RAA52509 for <nqthm-users@cli.com>; Sat, 9 Sep 1995 17:26:14 +0200
Received: from bbaguett@localhost
	  by micro4.montefiore.ulg.ac.be (8.6.10/ULG-7.5) id RAA07309
	  for nqthm-users@cli.com
	  at Sat, 9 Sep 1995 17:26:13 +0200
Date: Sat, 9 Sep 1995 17:26:13 +0200
From: bbaguett@montefiore.ulg.ac.be (Benoit Baguette)
Message-Id: <199509091526.RAA07309@micro4.montefiore.ulg.ac.be>
To: nqthm-users@cli.com

I'd like to know if the demonstration of an event always stops or if it's
possible to give the prover an event such that its demonstration takes an 
infinite time (i.e. by generating an infinite number of cases).

I think that a demonstration always stops but I'm not sure.

Thanks in advance.

Benoit.


From kepser@cis.uni-muenchen.de  Sat Sep  9 17:15:31 1995
Return-Path: <kepser@cis.uni-muenchen.de>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA03119; Sat, 9 Sep 95 17:15:31 CDT
Received: from thecube.cis.uni-muenchen.de by cli.com (4.1/SMI-4.1)
	id AA05445; Sat, 9 Sep 95 15:42:19 CDT
Received: by thecube.cis.uni-muenchen.de (NX5.67f2/NX3.0M)
	id AA04019; Sat, 9 Sep 95 22:42:12 +0200
Date: Sat, 9 Sep 95 22:42:12 +0200
From: Stephan Kepser <kepser@cis.uni-muenchen.de>
Message-Id: <9509092042.AA04019@thecube.cis.uni-muenchen.de>
To: nqthm-users@cli.com
Subject: 2nd CFP FroCS96


                            Second Call for Papers

                          First International Workshop

                       ``Frontiers of Combining Systems''
                                   FroCoS'96

                       March 26-29, 1996, Munich, Germany.



In various areas of logic, computation, language processing, and
artificial intelligence there is an obvious need for using specialized
formalisms and inference mechanisms for special tasks. In order to be
usable in practice, these specialized systems must be combined with
each other, and they must be integrated into general purpose systems.
The development of general techniques for the combination and
integration of special systems has been initiated in many areas, and
the Workshop ``Frontiers of Combining Systems'' intends to offer a
common forum for these research activities. Furthermore, it gives the
possibility to present results on particular instances of combination
and integration, and on their practical use.

Suggested, but not exclusive topics of interest for the workshop are:

 * combination of logics (e.g., modal logics, logics in AI,...)

 * combination of constraint solving techniques  
      (unification and matching algorithms, general symbolic
       constraints, numerical constraints,...) 
   and combination of decision procedures

 * integration of equational and other theories into deductive systems
      (e.g. theory resolution, constraint resolution, constraint
       paramodulation,...) 

 * combination of term rewriting systems

 * integration of data structures (e.g., sets, multisets, lists) into
     CLP formalisms and deduction processes

 * hybrid systems in computational linguistics, knowledge representation, 
     natural language semantics, and human computer interaction

 * logic modelling of multi-agent systems.


We hope to attract high quality original papers that cover relevant
aspects of these topics. All submissions will be thoroughly evaluated.
On the basis of the referee reports, papers will be selected for
presentation at the workshop and for the proceedings.  We intend to
publish the proceedings as one volume of the Kluwer series on
``Applied Logic''.


Invited Speakers:

B. Buchberger, A. Colmerauer, D.M. Gabbay, M. Stickel. 


Program Committee:

F.~Baader (Co-Chair), P. Baumgartner, P. Blackburn, A. Bockmayr,
A. Boudet, J. Calmet, A. Colmerauer, D.M. Gabbay, H. Kirchner,
H.J. Ohlbach, J. Pfalzgraf, M. de Rijke, W. Rounds,
M. Schmidt-Schauss, K.U. Schulz (Co-Chair).


Local Organization:

K.U. Schulz 
CIS, University of Munich
Wagmuellerstr. 23
D-80538 Muenchen
Germany
E-mail: schulz@cis.uni-muenchen.de


Paper submissions:

A PostScript version of the full paper (preferable LaTeX format), not
exceeding 15 pages (incl. title page and references), should be
received via e-mail by October 16, 1995.  In addition, one hard copy
of the paper should be received by the same date.  Results must be
unpublished, and not submitted for publication elsewhere.  Submissions
should start with title, author(s) (names, correspondence addresses,
e-mail addresses), and abstract. Please send submissions to the local
organizer.

Notification of Acceptance: December 1, 1995.

Final Versions due: January 1, 1996.

Information on FroCoS'96 is available by WWW:   
   http://www.cis.uni-muenchen.de} (under ``events'').


------------------------ LaTeX Version -------------------------------
\documentstyle{article}

\pagestyle{empty}

\textheight=760pt\textwidth=470pt\topmargin -45pt
\oddsidemargin=0pt\evensidemargin=0pt\abovedisplayskip=0pt
\belowdisplayskip=0pt\leftmargin=.4cm
\parindent0pt
\parskip 0pt
\topskip0pt 
\begin{document}

\begin{center} \large
Second Call for Papers\\[6pt]

First International Workshop\\[6pt]
{\Huge ``Frontiers of Combining Systems''}\\[6pt]
FroCoS'96\\[7pt]
\large March 26-29, 1996, Munich, Germany.
\end{center}


In various areas of logic, computation, language processing, and
artificial intelligence there is an obvious need for using specialized
formalisms and inference mechanisms for special tasks. In order to be
usable in practice, these specialized systems must be combined with
each other, and they must be integrated into general purpose systems.
The development of general techniques for the combination and
integration of special systems has been initiated in many areas,
and the Workshop ``Frontiers of Combining Systems'' intends to offer a
common forum for these research activities. Furthermore, it gives the
possibility to present results on particular instances of combination
and integration, and on their practical use.

Suggested, but not exclusive
topics of interest for the workshop are:\vspace*{-5pt}
\begin{itemize}\topsep 0pt\parsep 0pt \itemsep 0pt
 \item combination of logics (e.g., modal logics, logics in AI,\dots)
 \item combination of constraint solving techniques  
      (unification and matching algorithms, general symbolic constraints, numerical constraints,\dots) and 
       combination of decision procedures
 \item integration of equational and other theories into deductive systems (e.g.
     theory resolution, constraint resolution, constraint paramodulation,\dots)
 \item combination of term rewriting systems
 \item integration of data structures (e.g., sets, multisets, lists) into
     CLP formalisms and deduction processes
 \item hybrid systems in computational linguistics, knowledge representation,
     natural language semantics, and human computer interaction
 \item logic modelling of multi-agent systems.
\end{itemize}

We hope to attract high quality original papers that cover relevant
aspects of these topics. All submissions will be thoroughly evaluated.
On the basis of the referee reports, papers will be selected for
presentation at the workshop and for the proceedings.
We intend to publish the proceedings as one volume of the Kluwer series on ``Applied Logic''. 

\subsubsection*{Invited Speakers:}

B.~Buchberger, A.~Colmerauer, D.M.~Gabbay, M.~Stickel. 

\subsubsection*{Program Committee:}

F.~Baader (Co-Chair), P.~Baumgartner, P.~Blackburn, A.~Bockmayr, A.~Boudet, J.~Calmet, A.~Colmerauer, D.M.~Gabbay, 
H.~Kirchner, H.J.~Ohlbach, J.~Pfalzgraf, M.~de Rijke, W.~Rounds, M.~Schmidt-Schau{\ss}, K.U.~Schulz (Co-Chair).

\subsubsection*{Local Organization:} 

K.U.~Schulz, CIS, University of Munich, Wagm\"ullerstr.~23, D-80538 M\"unchen, Germany\\ E-mail: \verb|schulz@cis.uni-muenchen.de|

\subsubsection*{Paper submissions:} 

A PostScript version of the full paper (preferable LaTeX format), not
exceeding 15 pages (incl. title page and references), should be received via e-mail by {\bf October 16, 1995}.
In addition, one hard copy of the paper should be received by the same date. 
Results must be unpublished, and not
submitted for publication elsewhere.
Submissions should start with title, author(s) 
(names, correspondence addresses, e-mail
addresses), and abstract. Please send submissions  to the local organizer.  

Notification of Acceptance: December 1, 1995.

Final Versions due: January 1, 1996.

Information on FroCoS'96 is available by WWW:  {\tt http://www.cis.uni-muenchen.de} (under ``events'').
\end{document}

From kaufmann@cli.com  Sun Sep 10 00:55:24 1995
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA03317; Sun, 10 Sep 95 00:55:24 CDT
Received: from thunder.cli.com by cli.com (4.1/SMI-4.1)
	id AA05950; Sun, 10 Sep 95 00:05:30 CDT
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder.cli.com (4.1) id AA00285; Sun, 10 Sep 95 00:05:31 CDT
Date: Sun, 10 Sep 95 00:05:31 CDT
Message-Id: <9509100505.AA00285@thunder.cli.com>
To: bbaguett@montefiore.ulg.ac.be
Cc: nqthm-users@cli.com
In-Reply-To: <199509091526.RAA07309@micro4.montefiore.ulg.ac.be> (bbaguett@montefiore.ulg.ac.be)

It's definitely possible for Nqthm to get into a sort of infinite loop, though
I can imagine that resource errors on the machine would stop it eventually (if
for no other reason that a goal name with 10^1000 characters or so would
probably break most systems!).
-- Matt Kaufmann

From moore@cli.com  Sun Sep 10 17:03:19 1995
Return-Path: <moore@cli.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA03448; Sun, 10 Sep 95 17:03:19 CDT
Received: from rana.cli.com by cli.com (4.1/SMI-4.1)
	id AA07052; Sun, 10 Sep 95 16:15:00 CDT
From: moore@cli.com (J Strother Moore)
Received: by rana.cli.com (4.1) id AA00543; Sun, 10 Sep 95 16:15:02 CDT
Date: Sun, 10 Sep 95 16:15:02 CDT
Message-Id: <9509102115.AA00543@rana.cli.com>
To: bbaguett@montefiore.ulg.ac.be
Cc: nqthm-users@cli.com
In-Reply-To: <199509091526.RAA07309@micro4.montefiore.ulg.ac.be> (bbaguett@montefiore.ulg.ac.be)

To elaborate slightly on Matt's answer, there are several sorts of
"infinite loops" seen in Nqthm.

1. The rewriter can loop, as by applying a pair of rules like (equal (foo x)
(bar x)) and (equal (bar x) (foo x)) indefinitely.  These loops generally cause
stack overflow (but there are some rewrite loops that go entirely through
tail-recursive calls of rewrite and do not cause stack overflow) and no
printing.

2. The simplifier repeatedly splits the conjecture into cases.  Imagine, for
example, getting the case that x is 0 or (lessp 0 x).  Then in the second case,
considering x is 1 or (lessp 1 x).  Etc.  Such loops can go on for as long as
the machine has resources to allocate to formulas (mainly conses) and case
names (symbols).  The good news is that printout occurs and so you can "see"
infinite regression.

3. The system pushes a goal for inductive proof and the proof of that goal
pushes another for inductive proof, etc., indefinitely.  These loops are also
visible.  Furthermore, when the system pops a goal to prove by induction it
compares it (heuristically) with other goals pushed and being worked on and
often detects that a loop is likely to be occurring.  Thus, these sorts of
loops are sometimes spotted by the system and it aborts and fails.  Again
though, it is possible for a truly infinite such regression to occur and to
stop only because of machine resource exhaustion.

J

From Arthur.Flatau@amd.com  Mon Sep 11 10:54:15 1995
Return-Path: <Arthur.Flatau@amd.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA03769; Mon, 11 Sep 95 10:54:15 CDT
Received: from amdext.amd.com by cli.com (4.1/SMI-4.1)
	id AA08327; Mon, 11 Sep 95 09:12:02 CDT
Received: from amdint.amd.com by amdext.amd.com with SMTP id AA04766
  (5.67a/IDA-1.5+AMD for <nqthm-users@cli.com>); Mon, 11 Sep 1995 07:11:46 -0700
Received: from lagrange.amd.com by amdint.amd.com with SMTP id AA06661
  (5.67a/IDA-1.5+AMD); Mon, 11 Sep 1995 07:11:44 -0700
Received: from dalhart.amd.com (dalhart) by lagrange.amd.com (1.37.109.15/AMDSH-1.20)
	id AA251128672; Mon, 11 Sep 1995 09:11:13 -0500
Received: by dalhart.amd.com (1.37.109.16/AMDC-1.20)
	id AA027308672; Mon, 11 Sep 1995 09:11:12 -0500
Date: Mon, 11 Sep 1995 09:11:12 -0500
From: Arthur.Flatau@amd.com (Arthur Flatau)
Message-Id: <199509111411.AA027308672@dalhart.amd.com>
To: bbaguett@montefiore.ulg.ac.be
Cc: nqthm-users@cli.com
In-Reply-To: <199509091526.RAA07309@micro4.montefiore.ulg.ac.be> (bbaguett@montefiore.ulg.ac.be)
Subject: Infinite loops
Reply-To: Arthur.Flatau@amd.com

>>> On Sat, 9 Sep 1995 17:26:13 +0200, bbaguett@montefiore.ulg.ac.be (Benoit Baguette) said:

> I'd like to know if the demonstration of an event always stops or if it's
> possible to give the prover an event such that its demonstration takes an 
> infinite time (i.e. by generating an infinite number of cases).

> I think that a demonstration always stops but I'm not sure.

I have had events run overnight and not finish.  Obviously this is not
infinite, but is close enough for me.  :-)

Art

-- 
Arthur Flatau                           Personal Computer Division
Arthur.Flatau@amd.com                   Advanced Micro Devices
                                        5900 East Ben White Boulevard
                                        M/S 521 Austin TX 78741


From wilding@cli.com  Tue Sep 12 11:13:30 1995
Return-Path: <wilding@cli.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA04367; Tue, 12 Sep 95 11:13:30 CDT
Received: from dilbert.cli.com by cli.com (4.1/SMI-4.1)
	id AA11058; Tue, 12 Sep 95 09:53:26 CDT
From: wilding@cli.com (Matt Wilding)
Received: by dilbert.cli.com (4.1) id AA05060; Tue, 12 Sep 95 09:53:29 CDT
Date: Tue, 12 Sep 95 09:53:29 CDT
Message-Id: <9509121453.AA05060@dilbert.cli.com>
To: nqthm-users@cli.com
Subject: scheduler policy proof

I've written a paper describing an Nqthm proof of the optimality of
earliest-deadline-first schedulers on periodic tasks, available as

    ftp://ftp.cli.com/home/wilding/scheduler-proof.ps

Please let me know if you have comments.

Matt Wilding

From sandel@cli.com  Wed Sep 13 16:19:42 1995
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA00235; Wed, 13 Sep 95 16:19:42 CDT
Received: by cli.com (4.1/SMI-4.1)
	id AA14902; Wed, 13 Sep 95 16:19:37 CDT
Date: Wed, 13 Sep 95 16:19:37 CDT
From: sandel@cli.com (Charles Sandel)
Message-Id: <9509132119.AA14902@cli.com>
To: nqthm-users-archive@cli.com
Subject: test


test

From felty@research.att.com  Sun Sep 17 20:32:18 1995
Return-Path: <felty@research.att.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA02375; Sun, 17 Sep 95 20:32:18 CDT
Received: from research.att.com by cli.com (4.1/SMI-4.1)
	id AA00384; Sun, 17 Sep 95 20:32:16 CDT
Received: by research.att.com; Sun Sep 17 21:31 EDT 1995
Received: from radish.research.att.com by hunny.research.att.com with smtp
	(Smail3.1.29.1 #2) id m0suV45-000d8SC; Sun, 17 Sep 95 21:32 EDT
Received: by radish.research.att.com (Smail3.1.29.1 #9)
	id m0suV3I-000q4uC; Sun, 17 Sep 95 21:31 EDT
Message-Id: <m0suV3I-000q4uC@radish.research.att.com>
Date: Sun, 17 Sep 95 21:31 EDT
From: Amy Felty <felty@research.att.com>
To: formal-methods@cs.uidaho.edu, info-hol@leopard.cs.byu.edu,
        nqthm-users@cli.com, pvs@csl.sri.com
Subject: CADE-13 Call for Papers (text & LaTeX)
Reply-To: cade-request@research.att.com


[Our apologies for multiple copies.]

     The Thirteenth International Conference on Automated Deduction
     --------------------------------------------------------------

                         Rutgers University
                   New Brunswick, New Jersey, USA

                      30 July - 3 August, 1996

                   CADE-13:  First Call for Papers

The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction. Original research
papers, descriptions of working reasoning systems, and problem sets
that provide innovative, challenging tests for automated reasoning
systems, are solicited.

CADE conferences cover all aspects of automated deduction:

    First vs. Higher Order Logics            Classical vs. Non-Classical Logics
    Special vs. General Purpose Inference    Interactive vs. Automatic Systems

Specific topics of interest include (but are not limited to):

    Resolution        Sequent Calculus       Decision Procedures
    Unification       Rewrite Rules          Mathematical Induction

and any applications of automated deduction, including:

    Deductive Databases                      Logic and Functional Programming
    Commonsense Reasoning                    Software and Hardware Development
    Distributed Theorem Proving              Learning Search Heuristics

******************************************************************
** Papers on commercial or industrial applications of automated **
** deduction are especially encouraged.                         **
******************************************************************

CADE-13 will be held from Tuesday, 30 July, to Saturday, 3 August. It
will be held as part of the Federated Logic Conference (FLoC'96) to be
hosted by the Center for Discrete Mathematics and Computer Science
(DIMACS) at Rutgers University, New Brunswick, New Jersey, USA, from
Saturday, 27 July, to Saturday, 3 August. As well as CADE, other
conferences participating in FLoC'96 will be CAV, (Conference on
Computer-Aided Verification), LICS (IEEE Symposium on Logic in
Computer Science), and RTA (Conference on Rewriting Techniques and
Applications). The goal of FLoC is to battle fragmentation of the
technical community by bringing together synergetic conferences that
relate logic to computer science.

The Proceedings of CADE-13 will be published by Springer-Verlag in
their Lecture Notes in Artificial Intelligence Series.  Research
papers should not exceed 15 (fifteen) proceedings pages. System
descriptions and problem sets should not exceed 5 (five) proceedings
pages.  Springer style files should be used if possible. These can be
obtained by around mid-September from
http://www.research.att.com/lics/FLoC/cade13.

The title page of the submission should include the name, address
(with email address if possible) and telephone number of each author.
To assist in the refereeing process, please indicate one, or at most
two, of the following areas into which your paper falls or if it does
not fall into any of these areas, please specify the area into which
it does fall:

    LOGIC: first order, higher order, classical, non-classical,
    constructive, type theory, induction, modal, non-monotonic.

    MECHANISMS: resolution, matrix, sequent calculus, natural
    deduction, semantic tableau, rewrite rules, unification,
    decision procedures, tactics, meta-level, interactive,
    analogy.

    APPLICATIONS: mathematics, geometry, databases, logic
    programming, functional programming, software/hardware
    verification/transformation/synthesis/termination, commonsense
    reasoning, expert systems, learning.

Papers must be unpublished and not submitted for publication
elsewhere. Submissions which are late, too long, or which require
major revision, will not be considered.

The Program Committee may ask authors to furnish evidence of
scientific claims, e.g., computer programs, detailed proofs, or full
experimental data.

          +-----------------------------------------------+
          | Submission deadline: 12 January, 1996         |
          | Notification of acceptance: 20 March, 1996    |
          | Camera-ready copy due: 26 April, 1996         |
          +-----------------------------------------------+

Authors should send 4 (four) copies of their submission to the Program
Co-Chairs. Further information about the conference may be obtained
from the Local Arrangements Chair or at the CADE-13 world wide web
site: http://www.research.att.com/lics/FLoC/cade13.

    Program Co-Chairs                     Local Arrangements Chair

    Michael McRobbie & John Slaney        Amy Felty        
    Centre for Information                AT&T Bell Laboratories
        Science Research                  Room 2A-425
    The Australian National University    600 Mountain Avenue 
    ACT 0200                              Murray Hill NJ 07974
    Australia                             United States of America
                                     
    Tel: [+61] 6-249-2035                 Tel: [+1] 908-582-4049
    Fax: [+61] 6-249-0747                 Fax: [+1] 908-582-7550
    Email: cade13@cisr.anu.edu.au         Email: cade13-la@cisr.anu.edu.au

                          Program Committee

O. Astrachan (Duke)                    J. Avenhaus (Kaiserslautern)
L. Bachmair (Stonybrook)               D. Basin (Max-Planck)
W. Bibel (Darmstadt)                   B. Buchberger (Linz)
F. Bry (Munich)                        R. Caferra (Grenoble)
K.S. Choi (KAIST)                      A. Cohn (Leeds)
L. Farinas del Cerro (Toulouse)        W. Farmer (MITRE)
A. Felty (AT&T Bell Labs)              M. Fitting (CUNY)
M. Fujita (MRI)                        S. Garland (MIT)
F. Giunchiglia (IRST)                  E. Gunter (AT&T Bell Labs)
R. Hasegawa (Kyushu)                   L. Henschen (North Western)
L. Hines (Texas)                       S. Hoelldobler (Dresden)
M. Kaufman (Motorola)                  A. Leitsch (Vienna)
E. Lusk (Argonne)                      U. Martin (St Andrews)
D. McAllester (MIT)                    W. McCune (Argonne)
H.-J. Ohlbach (Max-Planck)             J. Posegga (Karlsruhe)
W. Pase (Ottawa)                       F. Pfenning (Carnegie Mellon)
F. Pirri (Rome)                        D. Plaisted (North Carolina)
U. Reddy (Illinois)                    M. Rusinowitch (INRIA)
K. Satoh (Hokkaido)                    J. Schumann (Munich)
C. Schwind (Marseille)                 N. Shankar (SRI)
J. Siekman (Saarbruecken)              A. Smaill (Edinburgh)
G. Smolka (Saarbruecken)               M. Stickel (SRI)
G. Sutcliffe (James Cook)              E. Tiden (Siemens)
A. Voronkov (Uppsala)                  L. Wallen (Oxford)
D. Wang (Grenoble)                     H. Zhang (Iowa)




%************************************************************************
%************************ LATEX VERSION *********************************
%************************************************************************

% For LaTeX2e use
%\documentclass[a4paper]{article}
%usepackage{graphicx}
% else, for LaTeX 2.09 comment out the two lines above and uncomment:
\documentstyle[psfig]{article}
% If you do not have the file "winning-logo.epsi", or if you do not
% have LaTeX2e comment out a line in the text below, which 
% contains "\includegraphics".

\addtolength{\topmargin}{-2cm}
%\addtolength{\textheight}{3cm}
\addtolength{\textheight}{5cm}
\addtolength{\textwidth}{4cm}
\addtolength{\oddsidemargin}{-2cm}

\font\logofont=cmbsy10 scaled 3000
\font\logofontt=cmtt10 scaled 3000

\def\cadeC{{\logofont\char'032}}
\def\cadeA{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'070}}}
\def\cadeD{{\logofont\char'033}}
\def\cadeE{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'071}}}
\def\cadeArrow{{\logofont\char'041}}
\def\cadetwlv{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 12}}}
\def\cadethrt{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 13}}}

%\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadetwlv}
\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadethrt}

\pagestyle{empty}

\begin{document}

% comment out the following "\includegraphics" line, if you do not
% have LaTeX2e or if you do not have the file "winning-logo.epsi".
% \noindent
% {\hskip-1.5cm{\vskip-2cm\hskip-1.5cm\includegraphics[scale=0.2]{winning-logo.epsi}}}

\begin{center}
{\cadelogo}
\end{center}
\begin{center}
{\Large\bf Thirteenth International Conference on Automated Deduction}
\end{center}
\begin{center}
{\Large\bf Rutgers University, New Brunswick, USA}
\end{center}
\begin{center}
{\Large\bf 30 July--3 August, 1996}
\end{center}
\begin{center}
{\large\bf Held as part of FLoC'96}
\psfig{figure=logo.ps,width=1.5cm}
\end{center}
\vskip0.5cm
\begin{center}
{\huge\bf FIRST CALL FOR PAPERS}
\end{center}
\vskip1cm

\noindent 
The CADE conferences are the major forum for the presentation of
new research in all aspects of automated deduction. Original
research papers, descriptions of working reasoning systems, and
problem sets that provide innovative, challenging tests for
automated reasoning systems, are solicited. 

\vskip0.5cm
CADE conferences cover all aspects of automated deduction:
\begin{center}
\begin{tabular}{ll}
First {\em vs.}\ Higher Order Logics &
Classical {\em vs.}\  Non-Classical Logics \\
Special {\em vs.}\  General Purpose Inference &
Interactive {\em vs.}\ Automatic Systems \\
\end{tabular}
\end{center}

Specific topics of interest include (but are not limited to):
\begin{center}
\begin{tabular}{lll}
Resolution & Sequent Calculus & Decision Procedures \\
Unification & Rewrite Rules & Mathematical Induction \\
\end{tabular}
\end{center}

and any applications of automated deduction, including:
\begin{center}
\begin{tabular}{ll}
Deductive Databases & Logic and Functional Programming \\
Commonsense Reasoning & Software and Hardware Development \\ 
Distributed Theorem Proving & Learning Search Heuristics \\ 
\end{tabular}
\end{center}

{\em Papers on commercial or industrial applications of automated deduction
are especially encouraged.}
\vskip0.5cm

CADE-13 will be held from Tuesday, 30 July, to Saturday, 3 August. It
will be held as part of the Federated Logic Conference (FLoC'96) to be
hosted by the Center for Discrete Mathematics and Computer Science
(DIMACS) at Rutgers University, New Brunswick, New Jersey, USA, from
Saturday, 27 July, to Saturday, 3 August. As well as CADE, other
conferences participating in FLoC'96 will be CAV, (Conference on
Computer-Aided Verification), LICS (IEEE Symposium on Logic in Computer
Science), and RTA (Conference on Rewriting Techniques and
Applications). The goal of FLoC is to battle fragmentation of the
technical community by bringing together synergetic conferences that
relate logic to computer science.

The Proceedings of CADE-13 will be published by Springer-Verlag in
their Lecture Notes in Artificial Intelligence Series.  Research papers
should not exceed 15~(fifteen) proceedings pages. System descriptions
and problem sets should not exceed 5~(five) proceedings pages.
Springer style files should be used if possible. These can be obtained
by around mid-September from
http://www.research.att.com/lics/FLoC/cade13.

The title page of the submission should include the name, address
(with email address if possible) and telephone number of each author.
To assist in the refereeing process, please indicate one, or at most
two, of the following areas into which your paper falls or if it does
not fall into any of these areas, please specify the area into which
it does fall:

LOGIC:  first order, higher order, classical, non-classical,
constructive, type theory, induction, modal, non-monotic.

MECHANISMS:  resolution, matrix, sequent calculus, natural deduction,
semantic tableau, rewrite rules, unification, decision procedures,
tactics, meta-level, interactive, analogy.

APPLICATIONS:  mathematics, geometry, databases, logic programming,
functional programming, software/hardware
verification/transformation/synthesis/termination, commonsense
reasoning, expert systems, learning.

Papers must be unpublished and not submitted for publication elsewhere.
Submissions which are late, too long, or which require major revision,
will not be considered.

The Program Committee may ask authors to furnish evidence of
scientific claims, e.g. computer programs, detailed proofs, or full
experimental data.

\begin{center}
\framebox{\begin{tabular}{ll}
Submission deadline:          & 12 January, 1996 \\
Notification of acceptance:   & 20 March, 1996 \\
Camera-ready copy due:        & 26 April, 1996 \\
\end{tabular}}
\end{center}


Authors should send 4~(four) copies of their submission to the Program
Co-Chairs. Further information about the conference may be obtained
from the Local Arrangements Chair or at the CADE-13 world wide web
site: http://www.research.att.com/lics/FLoC/cade13.

\begin{center}
\begin{tabular}{l@{\hspace{2em}}l}
\begin{tabular}[t]{l}
{\bf Program Co-Chairs\/}\\[1ex]
Michael McRobbie and John Slaney \\
Centre for Information Science Research \\
The Australian National University\\
ACT  0200 \\
Australia
\end{tabular}
&
\begin{tabular}[t]{l}
{\bf Local Arrangements Chair\/}\\[1ex]
Amy Felty\\
AT\&T Bell Laboratories \\
Room 2A-425 \\
600 Mountain Avenue \\
Murray Hill  NJ  07974  \\
United States of America \\

\end{tabular}\\
\hbox{}\\
\begin{tabular}[t]{l}
 Tel: [+61] 6-249-2035 \\
 Fax: [+61] 6-249-0747 \\
 Email: {\tt cade13}{\rm @}{\tt cisr.anu.edu.au}% 
\end{tabular}
&
\begin{tabular}[t]{l}
 Tel: [+1 ] 908-5824049 \\
 Fax: [+1 ] 908-5827550 \\
 Email: {\tt cade13-la}{\rm @}{\tt cisr.anu.edu.au}
\end{tabular}
\end{tabular}
\end{center}

\vskip0.5cm
\begin{center}
{\bf Program Committee\/}
\end{center}

\begin{center}
\begin{tabular}{lll}
O.~Astrachan (Duke)& J.~Avenhaus (Kaiserslautern)& L.~Bachmair (Stonybrook)\\
D.~Basin (Max-Planck)& W.~Bibel (Darmstadt)& B.~Buchberger (Linz)\\
F.~Bry (Munich)& R.~Caferra (Grenoble)& K.~S.~Choi (KAIST)\\
A.~Cohn (Leeds)& L.~Farinas del Cerro (Toulouse)& W.~Farmer (MITRE)\\
A.~Felty (AT\&T Bell Labs)& M.~Fitting (CUNY)& M.~Fujita (MRI)\\
S.~Garland (MIT)& F.~Giunchiglia (IRST)& E.~Gunter (AT\&T Bell Labs)\\
R.~Hasegawa (Kyushu)& L.~Henschen (North Western)& L.~Hines (Texas)\\
S.~H\"olldobler (Dresden)& M.~Kaufmann (Motorola)& A.~Leitsch (Vienna)\\
E.~Lusk (Argonne)& U.~Martin (St.~Andrews)& D.~McAllester (MIT)\\
W.~McCune (Argonne)& H.-J.~Ohlbach (Max-Planck)& J.~Posegga (Karlsruhe)\\
W.~Pase (Ottawa)& F.~Pfenning (Carnegie Mellon)& F.~Pirri (Rome)\\
D.~Plaisted (North Carolina)& U.~Reddy (Illinois)& M.~Rusinowitch (INRIA)\\
K.~Satoh (Hokkaido)& J.~Schumann (Munich)&  C.~Schwind (Marseille)\\
N.~Shankar (SRI)& J.~Siekmann (Saarbr\"ucken)& A.~Smaill~(Edinburgh)\\
G.~Smolka~(Saarbr\"ucken)& M.~Stickel~(SRI)& G.~Sutcliffe (James Cook)\\
E.~Tiden (Siemens)& A.~Voronkov (Uppsala)& L.~Wallen (Oxford)\\
D.~Wang (Grenoble)& H.~Zhang (Iowa)\\
\end{tabular}
\end{center}
\end{document}

From felty@research.att.com  Sun Sep 17 21:02:15 1995
Return-Path: <felty@research.att.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA02391; Sun, 17 Sep 95 21:02:15 CDT
Received: from research.att.com by cli.com (4.1/SMI-4.1)
	id AA00404; Sun, 17 Sep 95 21:02:13 CDT
Received: by research.att.com; Sun Sep 17 22:01 EDT 1995
Received: from radish.research.att.com by hunny.research.att.com with smtp
	(Smail3.1.29.1 #2) id m0suVX3-000d8UC; Sun, 17 Sep 95 22:02 EDT
Received: by radish.research.att.com (Smail3.1.29.1 #9)
	id m0suVWH-000q4uC; Sun, 17 Sep 95 22:01 EDT
Message-Id: <m0suVWH-000q4uC@radish.research.att.com>
Date: Sun, 17 Sep 95 22:01 EDT
From: Amy Felty <felty@research.att.com>
To: nqthm-users@cli.com
Subject: CADE-13 Call for Workshops (text & LaTeX)
Reply-To: cade-request@research.att.com


[Our apologies for multiple copies.]


    The Thirteenth International Conference on Automated Deduction
    --------------------------------------------------------------

                      Rutgers University
		New Brunswick, New Jersey, USA 

                 CADE-13:  Call for Workshops

                    Tuesday, 30 July, 1996


The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction. It is proposed to hold
a number of workshops in conjunction with CADE-13. All workshops will
be held in parallel on Tuesday, 30 July, 1996. All tutorials will be
held on the same day.

          +------------------------------------------------------+
          | 				       			 |
          | Deadline for Workshop Proposals: 1 December, 1995    |
          | 				       			 |
          +------------------------------------------------------+

CADE conferences cover all aspects of automated deduction:

   First vs. Higher Order Logics            Classical vs. Non-Classical Logics
   Special vs. General Purpose Inference    Interactive vs. Automatic Systems

 Specific topics of interest include (but are not limited to):

   Resolution        Sequent Calculus          Decision Procedures
   Unification       Rewrite Rules             Mathematical Induction

and any applications of automated deduction, including:

   Deductive Databases                 Logic and Functional Programming
   Commonsense Reasoning               Software and Hardware Development
   Distributed Theorem Proving	       Learning Search Heuristics	

The CADE-13 conference itself will be held from Wednesday, 31 July, to
Saturday, 3 August, 1996.  It will be held as part of the Federated
Logic Conference (FLoC'96) to be hosted by the Center for Discrete
Mathematics and Computer Science (DIMACS) at Rutgers University, New
Brunswick, New Jersey, USA, from Saturday, 27 July, to Saturday, 3
August, 1996. As well as CADE, other conferences participating in
FLoC'96 will be CAV, (Conference on Computer-Aided Verification), LICS
(IEEE Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications).  The goal of FLoC is to battle
fragmentation of the technical community by bringing together
synergetic conferences that relate logic to computer science.

Anyone wishing to offer a workshop in conjunction with CADE-13 should
send a proposal no longer than two pages in length to the Program
Co-Chairs by 1 December, 1995.  This proposal should describe the topic
of the proposed workshop; explain why this topic is relevant to CADE;
name the organiser(s) and specify the workshop's length.  The default
length is a full day.  Further information about the arrangements for
workshops, can be obtained from the Local Arrangements Chair or from
the CADE-13 world wide web site: http://www.research.att.com/lics/FLoC/cade13.

Note that it is unlikely that more than the equivalant of six full day
workshops will be chosen. The maximum number of workshops running in
parallel is unlikely to exceed six.

    Program Co-Chairs                     Local Arrangements Chair

    Michael McRobbie & John Slaney        Amy Felty        
    Centre for Information                AT&T Bell Laboratories
        Science Research                  Room 2A-425
    The Australian National University    600 Mountain Avenue 
    ACT 0200                              Murray Hill NJ 07974
    Australia                             United States of America
                                     
    Tel: [+61] 6-249-2035                 Tel: [+1] 908-582-4049
    Fax: [+61] 6-249-0747                 Fax: [+1] 908-582-7550
    Email: cade13@cisr.anu.edu.au         Email: cade13-la@cisr.anu.edu.au



++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
TEX Version
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


% For LaTeX2e use
\documentclass[a4paper]{article}
% if you have LaTeX2e and if you have "winning-logo.epsi" then 
% uncomment the following line.
%\usepackage{graphicx}
% else, for LaTeX 2.09 comment out the two lines above and uncomment:
% \documentstyle{article}
% Furthermore, if you do not have the file "winning-logo.epsi", 
% and if you do not have LaTeX2e comment out a line in the text 
% below, which contains "\includegraphics".

\addtolength{\topmargin}{-2cm}
% for LateX2e use the line below
\addtolength{\textheight}{3cm}
% for LaTeX 2.09, comment out the line above and uncomment:
% \addtolength{\textheight}{5cm}
\addtolength{\textwidth}{4.2cm}
\addtolength{\oddsidemargin}{-2cm}

\font\logofont=cmbsy10 scaled 3000
\font\logofontt=cmtt10 scaled 3000

\def\cadeC{{\logofont\char'032}}
\def\cadeA{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'070}}}
\def\cadeD{{\logofont\char'033}}
\def\cadeE{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'071}}}
\def\cadeArrow{{\logofont\char'041}}
\def\cadetwlv{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 12}}}
\def\cadethrt{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 13}}}

%\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadetwlv}
\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadethrt}

\pagestyle{empty}

\begin{document}

% comment out the following "\includegraphics" line, if you do not
% have LaTeX2e and if you do not have the file "winning-logo.epsi".
%\noindent
%{\hskip-1.5cm{\vskip-2cm\hskip-1.5cm\includegraphics[scale=0.2]{winning-logo.epsi}}}

\begin{center}
{\Large\bf Thirteenth International Conference on Automated Deduction}
\end{center}
\begin{center}
{\Large\bf Rutgers University, New Brunswick, USA}
\end{center}
\begin{center}
{\Large\bf 30 July, 1996}
\end{center}
\vskip0.5cm
\begin{center}
{\cadelogo}
\end{center}
\vskip0.5cm
\begin{center}
{\huge\bf CALL FOR WORKSHOPS}
\end{center}
\vskip1cm

\noindent 
The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction.  It is proposed to hold
number of workshops in conjunction with CADE-13. All workshops will
be held in parallel on Tuesday, 30 July, 1996. All tutorials will be
 held on the same day.

\vskip0.5cm
\begin{center}
\framebox{\begin{tabular}{l}
Deadline for Workshop Proposals: 1 December, 1995
\end{tabular}}
\end{center}

\vskip0.5cm
CADE conferences cover all aspects of automated deduction:
\begin{center}
\begin{tabular}{ll}
First {\em vs.}\ Higher Order Logics &
Classical {\em vs.}\  Non-Classical Logics \\
Special {\em vs.}\  General Purpose Inference &
Interactive {\em vs.}\ Automatic Systems \\
\end{tabular}
\end{center}

Specific topics of interest include (but are not limited to):
\begin{center}
\begin{tabular}{lll}
Resolution & Sequent Calculus & Decision Procedures \\
Unification & Rewrite Rules & Mathematical Induction \\
\end{tabular}
\end{center}

and any applications of automated deduction, including:
\begin{center}
\begin{tabular}{ll}
Deductive Databases & Logic and Functional Programming \\
Commonsense Reasoning & Software and Hardware Development \\ 
Distributed Theorem Proving & Learning Search Heuristics \\ 
\end{tabular}
\end{center}

The CADE-13 conference itself will be held from Wednesday, 31 July, to
Saturday, 3 August, 1996.  It will be held as part of the Federated
Logic Conference (FLoC'96) to be hosted by the Center for Discrete
Mathematics and Computer Science (DIMACS) at Rutgers University, New
Brunswick, New Jersey, USA, from Saturday, 27 July, to Saturday, 3
August, 1996.  As well as CADE, other conferences participating in
FLoC'96 will be CAV, (Conference on Computer-Aided Verification), LICS
(IEEE Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications).  The goal of FLoC is to battle
fragmentation of the technical community by bringing together
synergetic conferences that relate logic to computer science.

Anyone wishing to offer a workshop in conjunction with CADE-13 should
send a proposal no longer than two pages in length by post to the 
Program Co-Chairs by 1 December, 1995.  This proposal should describe 
the topic of the proposed workshop; explain why this topic is relevant
to CADE; name the organiser(s) and specify the workshop's length.  The 
default length is a full day. Further information about the 
arrangements for workshops, can be obtained from the Local Arrangements
Chair or from the CADE-13 world wide web site: 
http://www.research.att.com/lics/FLoC/cade13.

Note that it is unlikely that more than the equivalant of six full day
workshops will be chosen.  The maximum number of workshops running in
parallel is unlikely to exceed six.

\vskip1.5cm
\raggedleft ../2 
\newpage
\begin{center}
\begin{tabular}{l@{\hspace{2em}}l}
\begin{tabular}[t]{l}
{\bf Program Co-Chairs\/}\\[1ex]
Michael McRobbie and John Slaney \\
Centre for Information Science Research \\
The Australian National University\\
ACT  0200 \\
Australia
\end{tabular}
&
\begin{tabular}[t]{l}
{\bf Local Arrangements Chair\/}\\[1ex]
Amy Felty\\
AT\&T Bell Laboratories \\
Room 2A-425 \\
600 Mountain Avenue \\
Murray Hill  NJ  07974  \\
United States of America \\

\end{tabular}\\
\hbox{}\\
\begin{tabular}[t]{l}
 Tel: [+61] 6-249-2035 \\
 Fax: [+61] 6-249-0747 \\
 Email: {\tt cade13}{\rm @}{\tt cisr.anu.edu.au}% 
\end{tabular}
&
\begin{tabular}[t]{l}
 Tel: [+1 ] 908-5824049 \\
 Fax: [+1 ] 908-5827550 \\
 Email: {\tt cade13-la}{\rm @}{\tt cisr.anu.edu.au}
\end{tabular}
\end{tabular}
\end{center}

\vskip0.5cm
\begin{center}
{\bf Program Committee\/}
\end{center}

\begin{center}
\begin{tabular}{lll}
O.~Astrachan (Duke)& J.~Avenhaus (Kaiserslautern)& L.~Bachmair (Stonybrook)\\
D.~Basin (Max-Planck)& W.~Bibel (Darmstadt)& B.~Buchberger (Linz)\\
F.~Bry (Munich)& R.~Caferra (Grenoble)& K.~S.~Choi (KAIST)\\
A.~Cohn (Leeds)& L.~Farinas del Cerro (Toulouse)& W.~Farmer (MITRE)\\
A.~Felty (AT\&T Bell Labs)& M.~Fitting (CUNY)& M.~Fujita (MRI)\\
S.~Garland (MIT)& F.~Giunchiglia (IRST)& E.~Gunter (AT\&T Bell Labs)\\
R.~Hasegawa (Kyushu)& L.~Henschen (North Western)& L.~Hines (Texas)\\
S.~H\"olldobler (Dresden)& M.~Kaufmann (Motorola)& A.~Leitsch (Vienna)\\
E.~Lusk (Argonne)& U.~Martin (St.~Andrews)& D.~McAllester (MIT)\\
W.~McCune (Argonne)& H.-J.~Ohlbach (Max-Planck)& J.~Posegga (Karlsruhe)\\
W.~Pase (Ottawa)& F.~Pfenning (Carnegie Mellon)& F.~Pirri (Rome)\\
D.~Plaisted (North Carolina)& U.~Reddy (Illinois)& M.~Rusinowitch (INRIA)\\
K.~Satoh (Hokkaido)& J.~Schumann (Munich)&  C.~Schwind (Marseille)\\
N.~Shankar (SRI)& J.~Siekmann (Saarbr\"ucken)& A.~Smaill~(Edinburgh)\\
G.~Smolka~(Saarbr\"ucken)& M.~Stickel~(SRI)& G.~Sutcliffe (James Cook)\\
E.~Tiden (Siemens)& A.~Voronkov (Uppsala)& L.~Wallen (Oxford)\\
D.~Wang (Grenoble)& H.~Zhang (Iowa)& \\
\end{tabular}
\end{center}
\end{document}

From felty@research.att.com  Mon Sep 18 07:41:42 1995
Return-Path: <felty@research.att.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA02685; Mon, 18 Sep 95 07:41:42 CDT
Received: from research.att.com by cli.com (4.1/SMI-4.1)
	id AA00990; Mon, 18 Sep 95 07:41:41 CDT
Received: by research.att.com; Mon Sep 18 08:37 EDT 1995
Received: from lutece.research.att.com by hunny.research.att.com with smtp
	(Smail3.1.29.1 #2) id m0sufSJ-000d8UC; Mon, 18 Sep 95 08:37 EDT
Received: by lutece.research.att.com (Smail3.1.29.1 #2)
	id m0sufRX-004ELoC; Mon, 18 Sep 95 08:37 EDT
Message-Id: <m0sufRX-004ELoC@lutece.research.att.com>
Date: Mon, 18 Sep 95 08:37 EDT
From: Amy Felty <felty@research.att.com>
To: nqthm-users@cli.com
Subject: CADE-13 Call for Tutorials (text & LaTeX)
Reply-To: cade-request@research.att.com


[Our apologies for multiple copies.]


    The Thirteenth International Conference on Automated Deduction
    --------------------------------------------------------------

                      Rutgers University
		New Brunswick, New Jersey, USA 

                 CADE-13:  Call for Tutorials

                    Tuesday, 30 July, 1996


The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction.  It is proposed to hold
a number of tutorials in conjunction with CADE-13. All tutorials will
be held in parallel on Tuesday, 30 July, 1996. All workshops will be
held on the same day.

          +------------------------------------------------------+
          | 				       			 |
          | Deadline for Tutorial Proposals: 1 December, 1995    |
          | 				       			 |
          +------------------------------------------------------+

CADE conferences cover all aspects of automated deduction:

   First vs. Higher Order Logics            Classical vs. Non-Classical Logics
   Special vs. General Purpose Inference    Interactive vs. Automatic Systems

 Specific topics of interest include (but are not limited to):

   Resolution        Sequent Calculus          Decision Procedures
   Unification       Rewrite Rules             Mathematical Induction

and any applications of automated deduction, including:

   Deductive Databases                 Logic and Functional Programming
   Commonsense Reasoning               Software and Hardware Development
   Distributed Theorem Proving	       Learning Search Heuristics	

The CADE-13 conference itself will be held from Wednesday, 31 July, to
Saturday, 3 August, 1996.  It will be held as part of the Federated
Logic Conference (FLoC'96) to be hosted by the Center for Discrete
Mathematics and Computer Science (DIMACS) at Rutgers University, New
Brunswick, New Jersey, USA, from Saturday, 27 July, to Saturday, 3
August, 1996. As well as CADE, other conferences participating in
FLoC'96 will be CAV, (Conference on Computer-Aided Verification), LICS
(IEEE Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications).  The goal of FLoC is to battle
fragmentation of the technical community by bringing together
synergetic conferences that relate logic to computer science.

Anyone wishing to offer a tutorial in conjunction with CADE-13 should
send a proposal no longer than two pages in length to the Program
Co-Chairs by 1 December, 1995.  This proposal should describe the topic
of the proposed tutorial; explain why this topic is relevant to CADE;
name the speakers and specify the tutorial's length. The default length
is two hours.  Further information about the arrangements for tutorials,
can be obtained from the Local Arrangements Chair or from the CADE-13
world wide web site: http://www.research.att.com/lics/FLoC/cade13.

Note that it is unlikely that more than the equivalant of 12 two hour
tutorials will be chosen.  The maximum number of tutorials running in
parallel is unlikely to exceed six.

    Program Co-Chairs                     Local Arrangements Chair

    Michael McRobbie & John Slaney        Amy Felty        
    Centre for Information                AT&T Bell Laboratories
        Science Research                  Room 2A-425
    The Australian National University    600 Mountain Avenue 
    ACT 0200                              Murray Hill NJ 07974
    Australia                             United States of America
                                     
    Tel: [+61] 6-249-2035                 Tel: [+1] 908-582-4049
    Fax: [+61] 6-249-0747                 Fax: [+1] 908-582-7550
    Email: cade13@cisr.anu.edu.au         Email: cade13-la@cisr.anu.edu.au


+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
TEX Version
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


% For LaTeX2e use
\documentclass[a4paper]{article}
% if you have LaTeX2e and if you have "winning-logo.epsi" then 
% uncomment the following line.
%\usepackage{graphicx}
% else, for LaTeX 2.09 comment out the two lines above and uncomment:
% \documentstyle{article}
% Furthermore, if you do not have the file "winning-logo.epsi", 
% and if you do not have LaTeX2e comment out a line in the text 
% below, which contains "\includegraphics".

\addtolength{\topmargin}{-2cm}
% for LateX2e use the line below
\addtolength{\textheight}{3cm}
% for LaTeX 2.09, comment out the line above and uncomment:
% \addtolength{\textheight}{5cm}
\addtolength{\textwidth}{4.2cm}
\addtolength{\oddsidemargin}{-2cm}

\font\logofont=cmbsy10 scaled 3000
\font\logofontt=cmtt10 scaled 3000

\def\cadeC{{\logofont\char'032}}
\def\cadeA{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'070}}}
\def\cadeD{{\logofont\char'033}}
\def\cadeE{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'071}}}
\def\cadeArrow{{\logofont\char'041}}
\def\cadetwlv{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 12}}}
\def\cadethrt{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 13}}}

%\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadetwlv}
\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadethrt}

\pagestyle{empty}

\begin{document}

% comment out the following "\includegraphics" line, if you do not
% have LaTeX2e and if you do not have the file "winning-logo.epsi".
%\noindent
%{\hskip-1.5cm{\vskip-2cm\hskip-1.5cm\includegraphics[scale=0.2]{winning-logo.epsi}}}

\begin{center}
{\Large\bf Thirteenth International Conference on Automated Deduction}
\end{center}
\begin{center}
{\Large\bf Rutgers University, New Brunswick, USA}
\end{center}
\begin{center}
{\Large\bf 30 July, 1996}
\end{center}
\vskip0.5cm
\begin{center}
{\cadelogo}
\end{center}
\vskip0.5cm
\begin{center}
{\huge\bf CALL FOR TUTORIALS}
\end{center}
\vskip1cm

\noindent 
The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction.  It is proposed to hold
a number of tutorials in conjunction with CADE-13.  All tutorials will
be held in parallel on Tuesday, 30 July, 1996.  All workshops will be
held on the same day.

\vskip0.5cm
\begin{center}
\framebox{\begin{tabular}{l}
Deadline for Tutorial Proposals: 1 December, 1995
\end{tabular}}
\end{center}

\vskip0.5cm
CADE conferences cover all aspects of automated deduction:
\begin{center}
\begin{tabular}{ll}
First {\em vs.}\ Higher Order Logics &
Classical {\em vs.}\  Non-Classical Logics \\
Special {\em vs.}\  General Purpose Inference &
Interactive {\em vs.}\ Automatic Systems \\
\end{tabular}
\end{center}

Specific topics of interest include (but are not limited to):
\begin{center}
\begin{tabular}{lll}
Resolution & Sequent Calculus & Decision Procedures \\
Unification & Rewrite Rules & Mathematical Induction \\
\end{tabular}
\end{center}

and any applications of automated deduction, including:
\begin{center}
\begin{tabular}{ll}
Deductive Databases & Logic and Functional Programming \\
Commonsense Reasoning & Software and Hardware Development \\ 
Distributed Theorem Proving & Learning Search Heuristics \\ 
\end{tabular}
\end{center}

The CADE-13 conference itself will be held from Wednesday, 31 July, to
Saturday, 3 August, 1996.  It will be held as part of the Federated
Logic Conference (FLoC'96) to be hosted by the Center for Discrete
Mathematics and Computer Science (DIMACS) at Rutgers University, New
Brunswick, New Jersey, USA, from Saturday, 27 July, to Saturday, 3
August, 1996.  As well as CADE, other conferences participating in
FLoC'96 will be CAV, (Conference on Computer-Aided Verification), LICS
(IEEE Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications).  The goal of FLoC is to battle
fragmentation of the technical community by bringing together
synergetic conferences that relate logic to computer science.

Anyone wishing to offer a tutorial in conjunction with CADE-13 should
send a proposal no longer than two pages in length by post to the 
Program Co-Chairs by 1 December, 1995.  This proposal should describe
the topic of the proposed tutorial; explain why this topic is relevant
to CADE; name the speakers and specify the tutorial's length.  The 
default length is two hours. Further information about the arrangements
for tutorials, can be obtained from the Local Arrangements Chair or
from the CADE-13 world wide web site: 
http://www.research.att.com/lics/FLoC/cade13.

Note that it is unlikely that more than the equivalant of 12 two hour
tutorials will be chosen.  The maximum number of tutorials running in
parallel is unlikely to exceed six.

\vskip1.5cm
\raggedleft ../2 
\begin{center}
\begin{tabular}{l@{\hspace{2em}}l}
\begin{tabular}[t]{l}
{\bf Program Co-Chairs\/}\\[1ex]
Michael McRobbie and John Slaney \\
Centre for Information Science Research \\
The Australian National University\\
ACT  0200 \\
Australia
\end{tabular}
&
\begin{tabular}[t]{l}
{\bf Local Arrangements Chair\/}\\[1ex]
Amy Felty\\
AT\&T Bell Laboratories \\
Room 2A-425 \\
600 Mountain Avenue \\
Murray Hill  NJ  07974  \\
United States of America \\

\end{tabular}\\
\hbox{}\\
\begin{tabular}[t]{l}
 Tel: [+61] 6-249-2035 \\
 Fax: [+61] 6-249-0747 \\
 Email: {\tt cade13}{\rm @}{\tt cisr.anu.edu.au}% 
\end{tabular}
&
\begin{tabular}[t]{l}
 Tel: [+1 ] 908-5824049 \\
 Fax: [+1 ] 908-5827550 \\
 Email: {\tt cade13-la}{\rm @}{\tt cisr.anu.edu.au}
\end{tabular}
\end{tabular}
\end{center}

\vskip0.5cm
\begin{center}
{\bf Program Committee\/}
\end{center}

\begin{center}
\begin{tabular}{lll}
O.~Astrachan (Duke)& J.~Avenhaus (Kaiserslautern)& L.~Bachmair (Stonybrook)\\
D.~Basin (Max-Planck)& W.~Bibel (Darmstadt)& B.~Buchberger (Linz)\\
F.~Bry (Munich)& R.~Caferra (Grenoble)& K.~S.~Choi (KAIST)\\
A.~Cohn (Leeds)& L.~Farinas del Cerro (Toulouse)& W.~Farmer (MITRE)\\
A.~Felty (AT\&T Bell Labs)& M.~Fitting (CUNY)& M.~Fujita (MRI)\\
S.~Garland (MIT)& F.~Giunchiglia (IRST)& E.~Gunter (AT\&T Bell Labs)\\
R.~Hasegawa (Kyushu)& L.~Henschen (North Western)& L.~Hines (Texas)\\
S.~H\"olldobler (Dresden)& M.~Kaufmann (Motorola)& A.~Leitsch (Vienna)\\
E.~Lusk (Argonne)& U.~Martin (St.~Andrews)& D.~McAllester (MIT)\\
W.~McCune (Argonne)& H.-J.~Ohlbach (Max-Planck)& J.~Posegga (Karlsruhe)\\
W.~Pase (Ottawa)& F.~Pfenning (Carnegie Mellon)& F.~Pirri (Rome)\\
D.~Plaisted (North Carolina)& U.~Reddy (Illinois)& M.~Rusinowitch (INRIA)\\
K.~Satoh (Hokkaido)& J.~Schumann (Munich)&  C.~Schwind (Marseille)\\
N.~Shankar (SRI)& J.~Siekmann (Saarbr\"ucken)& A.~Smaill~(Edinburgh)\\
G.~Smolka~(Saarbr\"ucken)& M.~Stickel~(SRI)& G.~Sutcliffe (James Cook)\\
E.~Tiden (Siemens)& A.~Voronkov (Uppsala)& L.~Wallen (Oxford)\\
D.~Wang (Grenoble)& H.~Zhang (Iowa)& \\
\end{tabular}
\end{center}
\end{document}

From plaisted@cs.unc.edu  Mon Sep 18 14:57:23 1995
Return-Path: <plaisted@cs.unc.edu>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA02817; Mon, 18 Sep 95 14:57:23 CDT
Received: from mcenroe.cs.unc.edu by cli.com (4.1/SMI-4.1)
	id AA01873; Mon, 18 Sep 95 14:57:17 CDT
Received: from plaisted.cs.unc.edu by mcenroe.cs.unc.edu (8.6.10/UNC_06_21_94)
	id PAA12712; Mon, 18 Sep 1995 15:57:08 -0400
From: David Plaisted <plaisted@cs.unc.edu>
Received: by plaisted.cs.unc.edu (8.6.10/UNC_06_21_94)
	id PAA06483; Mon, 18 Sep 1995 15:57:06 -0400
Date: Mon, 18 Sep 1995 15:57:06 -0400
Message-Id: <199509181957.PAA06483@plaisted.cs.unc.edu>
To: nqthm-users@cli.com
Subject: RTA96 Call for Papers
Cc: plaisted@cs.unc.edu


 [We apologize if you receive multiple copies of this announcement.]


                      =====================================

                                    RTA-96

                    This information is also avaliable under
                        http://www.mpi-sb.mpg.de/rta96/ .

                      =====================================

                               CALL FOR PAPERS


Seventh International Conference on                            July 27-30, 1996
Rewriting Techniques and Applications               Rutgers University, NJ, USA



  The Seventh Conference on Rewriting Techniques and Applications solicits
papers in any of the following or related areas:


   Term rewriting systems                  Symbolic and algebraic computation
   Constrained rewriting and deduction     Equational programming languages
   String and graph rewriting              Completion techniques
   Rewrite-based theorem proving           Unification and matching algorithms
   Conditional and typed rewriting         Constraint solving
   Higher-order rewriting                  Architectures for rewriting
                Parallel/distributed rewriting and deduction

Original papers on the topics listed above are solicited.  In addition to full 
research papers, descriptions of new working systems (4 proceedings pages) 
and problem sets that provide realistic, interesting challenges in the field of
rewriting techniques are also welcome.  Papers on new applications of rewriting
techniques are particularly encouraged.

  Submissions must reach the program chair, at the address below, no later than

                      January 15, 1996. 

Notification of acceptance or rejection will be made by March 10, 1996.  
Camera-ready copy (following special guidelines for Springer Lecture Notes) 
will be due by April 30, 1996.

RTA Organizing Committee:

  Ronald Book (Santa Barbara)     Jieh Hsiang (Taipei)
  Claude Kirchner (Nancy, chair)  Klaus Madlener (Kaiserslautern) 
  David Plaisted (Chapel Hill)    Mitsuhiro Okada (Tokio)

RTA96 Program Chair:

      Harald Ganzinger, RTA96
      Max Planck Institute                  telephone: +49 681 302-5360
          for Computer Science              fax:       +49 681 302-5401
      Im Stadtwald                          internet:  rta96@mpi-sb.mpg.de
      D-66123 Saarbruecken            
      Germany

RTA96 Program Committee (tentative):

J. Avenhaus (Kaiserslautern) H. Comon (Orsay)        N. Dershowitz (Urbana)
H. Ganzinger (Saarbruecken)  P. Lescanne (Nancy)     U. Martin (St. Andrews)
A. Middeldorp (Tsukuba)      P. Narendran (Albany)   R. Nieuwenhuis (Barcelona)
T. Nipkow (Muenchen)         F. Pfenning (Pittsburg) D. Plaisted (Chapel Hill)
W. Snyder (Boston)                                   H. Zhang (Iowa City)


Local Arrangements Chair:

      Leo Bachmair
      SUNY Stony Brook
      leo@cs.sunysb.edu

  Previous RTA meetings were held in Dijon (1985), Bordeaux (1987), Chapel 
Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995); 
their proceedings were published by Springer-Verlag as part of their 
Lecture Notes in Computer Science series.


Paper Submission Guidelines:

  Papers submitted to RTA96 must be unpublished and not submitted for 
publication elsewhere.  In particular, multiple submissions of the same or a 
closely related paper to any of the other conferences participating in FLoC 
are not permitted.

  The title page of the submission should include the author's name, address, 
and phone number, as well as electronic address and fax number, if available. 
Late papers and papers that require major revision, including submissions that
are too long, will be rejected.  Each submission should include 6 (six) copies
of a full draft paper of no more than 15 (fifteen) pages.  Using Springer LNCS
style files is strongly recommended. Electronic submission in 
Postscript form is encouraged.  Proofs of theorems should be provided
in the paper, or, if space does not permit, should be made accessible
otherwise (e.g., as an appendix to the submission or via the Web).


The Federated Logic Conference:

  RTA-96 is part of the 

                    Federated Logic Conference (FLoC), 
                       July 27 - August 3, 1996, 

being hosted by the Center for Discrete Mathematics and Computer Science 
(DIMACS), Rutgers University, as part of its Special Year on Logic and 
Algorithms.  In addition to RTA, FLoC includes the following related 
conferences: 
 - IEEE Symposium on Logic in Computer Science (LICS),
 - Conference on Computer-Aided Verification (CAV), and 
 - Conference on Automated Deduction (CADE).  
LICS and RTA will be held in parallel during the first four days of FLoC.  
CADE and CAV will be held during the last four days, with CADE workshops 
running in parallel with the last day of LICS.  Plenary
events involving all the conferences are scheduled.  Information about FLoC
can be found in http://www.research.att.com/lics/FLoC/. Information about
the Special Year can be found in http://dimacs.rutgers.edu/.


%*****************************************************************************
%***************************** LATEX VERSION *********************************
%*****************************************************************************


\documentstyle[11pt,psfig]{article}

\addtolength{\topmargin}{-2cm}
\addtolength{\textheight}{5cm}
\addtolength{\textwidth}{3cm}
\addtolength{\oddsidemargin}{-1.5cm}
\begin{document}
%\documenttitle{CFP96.tex}
%\documenttoplevel{section}
%\sectionlevel{0}{f}{Contents}
%\htmlLabel{1}
\begin{center}
{\bf\Large
RTA-96\\
Call for Papers}\\[1em]
{\em Seventh International Conference on       \hfill                July 27-30, 1996\\
Rewriting Techniques and Applications     \hfill         Rutgers University, NJ, USA\/}\\
~\\
{[This information is also avaliable under\\http://www.mpi-sb.mpg.de/rta96/ .]}
\end{center}

The Seventh Conference on Rewriting Techniques and Applications solicits 
original papers 
in any of the following or related areas:
\begin{center}
\begin{tabular}{ll}
   Term rewriting systems     &             Symbolic and algebraic computation\\
   Constrained rewriting and deduction  &   Equational programming languages\\
   String and graph rewriting          &    Completion techniques\\
   Rewrite-based theorem proving   &        Unification and matching algorithms\\
   Conditional and typed rewriting    &     Constraint solving\\
   Higher-order rewriting          &        Architectures for rewriting\\
\multicolumn{2}{c}{Parallel/distributed rewriting and deduction}
\end{tabular}
\end{center}
In addition to full 
research papers, descriptions of new working systems (4 proceedings pages) 
and problem sets that provide realistic, interesting challenges in the field of 
rewriting techniques are also welcome.  Papers on new applications of rewriting 
techniques are particularly encouraged.
Submissions must reach the program chair, at the address below, no later than
\begin{center}
                      {\bf January 15, 1996}. 
\end{center}
Notification of acceptance or rejection will be made by March 10, 1996.  
Camera-ready copy (following special guidelines for Springer Lecture Notes) 
will be due by April 30, 1996.

%\sectionlevel{1}{f}{^}
%\htmlLabel{2}

\subsubsection*{RTA Organizing Committee:}
%\htmlLabel{3}
\begin{tabular}{ll}
  Ronald Book (Santa Barbara)  &   Jieh Hsiang (Taipei)\\
  Claude Kirchner (Nancy, chair)&  Klaus Madlener (Kaiserslautern)\\ 
  David Plaisted (Chapel Hill) &   Mitsuhiro Okada (Tokio)
\end{tabular}

\subsubsection*{RTA96 Program Chair:}
%\htmlLabel{4}
\begin{tabular}{lll}
      Harald Ganzinger, RTA96\\
      Max Planck Institute            &      telephone: & +49 681 302-5360\\
          for Computer Science       &       fax:    &   +49 681 302-5401\\
      Im Stadtwald                     &     internet:  & rta96@mpi-sb.mpg.de\\
      D-66123 Saarbr\"ucken            \\
	Germany
\end{tabular}

\subsubsection*{RTA96 Program Committee (tentative):}
%\htmlLabel{5}
\begin{center}
\begin{tabular}{lll}
J. Avenhaus (Kaiserslautern) & H. Comon (Orsay)    &        N. Dershowitz (Urbana)\\
H. Ganzinger (Saarbr\"ucken)  & P. Lescanne (Nancy)    &  U. Martin (St. Andrews)\\
A. Middeldorp (Tsukuba)    &   P. Narendran (Albany)  & R. Nieuwenhuis (Barcelona)\\
T. Nipkow (M\"unchen)      &    F. Pfenning (Pittsburgh)  &  D. Plaisted (Chapel Hill)\\
W. Snyder (Boston)      	&    			& H. Zhang (Iowa City)
\end{tabular}
\end{center}

\subsubsection*{Local Arrangements Chair:}
%\htmlLabel{6}
\begin{tabular}{l}
      Leo Bachmair\\
      SUNY Stony Brook\\
      leo@cs.sunysb.edu
\end{tabular}

\subsubsection*{Paper Submission Guidelines:}
%\htmlLabel{8}
Papers submitted to RTA96 must be unpublished and not submitted for publication
elsewhere.  
In particular, multiple submissions of the same or a closely related paper 
to any of the other conferences participating in FLoC are not permitted.
The title page of the submission should include the author's name, address, 
and phone number, as well as electronic address and fax number, if available. 
Late papers and papers that require major revision, including submissions that are 
too long, will be rejected.  Each submission should include 6 (six) copies of a 
full draft paper of no more than 15 (fifteen) pages.  Using Springer LNCS
style files is strongly recommended. {\em 
Electronic submission in  Postscript form is encouraged.\/}  
Proofs of theorems should be provided
in the paper, or, if space does not permit, should be made accessible
otherwise (e.g., as an appendix to the submission or via the Web).

\subsubsection*{}
%\htmlLabel{7}
\begin{minipage}[c]{.25in}
%\psfig{figure=floc-logo.epsi,width=.5in}
% **************************************************************************
% * REMOVE THE ABOVE COMMENT CHARACTER IF YOU HAVE THE floc-logo.epsi FILE *
% ***** This file is available at http://www.mpi-sb.mpg.de/rta96/icons *****
% **************************************************************************
\vspace{.07in}\
\end{minipage}
{\bf FLoC'96}

\noindent
RTA-96
is part of the Federated Logic Conference (FLoC), July 27 - August 3, 1996,
being hosted by the Center for Discrete Mathematics and Computer Science (DIMACS), 
Rutgers University, as part of its Special Year on Logic and Algorithms.  
%{\bf FLoC'96}
In addition to RTA, FLoC includes the following related conferences: 
\begin{itemize}
	\item IEEE Symposium on Logic in Computer Science (LICS),
 	\item Conference on Computer-Aided Verification (CAV), and 
 	\item Conference on Automated Deduction (CADE).  
\end{itemize}
LICS and RTA will be held in parallel during the first four days of FLoC.  
CADE and CAV will be held during the last four days, with CADE workshops 
running in parallel with the last day of LICS.  Plenary
events involving all the conferences are scheduled.  Information about FLoC
can be found in http://www.research.att.com/lics/FLoC/. Information about
the Special Year can be found in http://dimacs.rutgers.edu/.

\end{document}


From brownfld@cs.uiuc.edu  Wed Sep 20 10:27:48 1995
Return-Path: <brownfld@cs.uiuc.edu>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA04563; Wed, 20 Sep 95 10:27:48 CDT
Received: from sal.cs.uiuc.edu by cli.com (4.1/SMI-4.1)
	id AA07030; Wed, 20 Sep 95 10:27:47 CDT
Received: from [128.174.241.184] (marla.cs.uiuc.edu) by sal.cs.uiuc.edu with SMTP id AA23192
  (5.67b/IDA-1.5 for <nqthm-users@cli.com>); Wed, 20 Sep 1995 10:26:01 -0500
X-Sender: brownfld@sal.cs.uiuc.edu
Message-Id: <ac84a06d0702100483fd@[128.174.241.184]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Tue, 19 Sep 1995 10:30:39 -0600
To: nqthm-users@cli.com
From: brownfld@cs.uiuc.edu (Marla Brownfield)
Subject: CADE-13 Call for Tutorials (text & LaTeX)


[Our apologies for multiple copies.]


    The Thirteenth International Conference on Automated Deduction
    --------------------------------------------------------------

                      Rutgers University
                New Brunswick, New Jersey, USA

                 CADE-13:  Call for Tutorials

                    Tuesday, 30 July, 1996


The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction.  It is proposed to hold
a number of tutorials in conjunction with CADE-13. All tutorials will
be held in parallel on Tuesday, 30 July, 1996. All workshops will be
held on the same day.

          +------------------------------------------------------+
          |                                                      |
          | Deadline for Tutorial Proposals: 1 December, 1995    |
          |                                                      |
          +------------------------------------------------------+

CADE conferences cover all aspects of automated deduction:

   First vs. Higher Order Logics            Classical vs. Non-Classical Logics
   Special vs. General Purpose Inference    Interactive vs. Automatic Systems

 Specific topics of interest include (but are not limited to):

   Resolution        Sequent Calculus          Decision Procedures
   Unification       Rewrite Rules             Mathematical Induction

and any applications of automated deduction, including:

   Deductive Databases                 Logic and Functional Programming
   Commonsense Reasoning               Software and Hardware Development
   Distributed Theorem Proving         Learning Search Heuristics

The CADE-13 conference itself will be held from Wednesday, 31 July, to
Saturday, 3 August, 1996.  It will be held as part of the Federated
Logic Conference (FLoC'96) to be hosted by the Center for Discrete
Mathematics and Computer Science (DIMACS) at Rutgers University, New
Brunswick, New Jersey, USA, from Saturday, 27 July, to Saturday, 3
August, 1996. As well as CADE, other conferences participating in
FLoC'96 will be CAV, (Conference on Computer-Aided Verification), LICS
(IEEE Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications).  The goal of FLoC is to battle
fragmentation of the technical community by bringing together
synergetic conferences that relate logic to computer science.

Anyone wishing to offer a tutorial in conjunction with CADE-13 should
send a proposal no longer than two pages in length to the Program
Co-Chairs by 1 December, 1995.  This proposal should describe the topic
of the proposed tutorial; explain why this topic is relevant to CADE;
name the speakers and specify the tutorial's length. The default length
is two hours.  Further information about the arrangements for tutorials,
can be obtained from the Local Arrangements Chair or from the CADE-13
world wide web site: http://www.research.att.com/lics/FLoC/cade13.

Note that it is unlikely that more than the equivalant of 12 two hour
tutorials will be chosen.  The maximum number of tutorials running in
parallel is unlikely to exceed six.

    Program Co-Chairs                     Local Arrangements Chair

    Michael McRobbie & John Slaney        Amy Felty
    Centre for Information                AT&T Bell Laboratories
        Science Research                  Room 2A-425
    The Australian National University    600 Mountain Avenue
    ACT 0200                              Murray Hill NJ 07974
    Australia                             United States of America

    Tel: [+61] 6-249-2035                 Tel: [+1] 908-582-4049
    Fax: [+61] 6-249-0747                 Fax: [+1] 908-582-7550
    Email: cade13@cisr.anu.edu.au         Email: cade13-la@cisr.anu.edu.au


+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
TEX Version
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


% For LaTeX2e use
\documentclass[a4paper]{article}
% if you have LaTeX2e and if you have "winning-logo.epsi" then
% uncomment the following line.
%\usepackage{graphicx}
% else, for LaTeX 2.09 comment out the two lines above and uncomment:
% \documentstyle{article}
% Furthermore, if you do not have the file "winning-logo.epsi",
% and if you do not have LaTeX2e comment out a line in the text
% below, which contains "\includegraphics".

\addtolength{\topmargin}{-2cm}
% for LateX2e use the line below
\addtolength{\textheight}{3cm}
% for LaTeX 2.09, comment out the line above and uncomment:
% \addtolength{\textheight}{5cm}
\addtolength{\textwidth}{4.2cm}
\addtolength{\oddsidemargin}{-2cm}

\font\logofont=cmbsy10 scaled 3000
\font\logofontt=cmtt10 scaled 3000

\def\cadeC{{\logofont\char'032}}
\def\cadeA{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'070}}}
\def\cadeD{{\logofont\char'033}}
\def\cadeE{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'071}}}
\def\cadeArrow{{\logofont\char'041}}
\def\cadetwlv{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 12}}}
\def\cadethrt{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 13}}}

%\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadetwlv}
\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadethrt}

\pagestyle{empty}

\begin{document}

% comment out the following "\includegraphics" line, if you do not
% have LaTeX2e and if you do not have the file "winning-logo.epsi".
%\noindent
%{\hskip-1.5cm{\vskip-2cm\hskip-1.5cm\includegraphics[scale=0.2]{winning-log
o.epsi}}}

\begin{center}
{\Large\bf Thirteenth International Conference on Automated Deduction}
\end{center}
\begin{center}
{\Large\bf Rutgers University, New Brunswick, USA}
\end{center}
\begin{center}
{\Large\bf 30 July, 1996}
\end{center}
\vskip0.5cm
\begin{center}
{\cadelogo}
\end{center}
\vskip0.5cm
\begin{center}
{\huge\bf CALL FOR TUTORIALS}
\end{center}
\vskip1cm

\noindent
The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction.  It is proposed to hold
a number of tutorials in conjunction with CADE-13.  All tutorials will
be held in parallel on Tuesday, 30 July, 1996.  All workshops will be
held on the same day.

\vskip0.5cm
\begin{center}
\framebox{\begin{tabular}{l}
Deadline for Tutorial Proposals: 1 December, 1995
\end{tabular}}
\end{center}

\vskip0.5cm
CADE conferences cover all aspects of automated deduction:
\begin{center}
\begin{tabular}{ll}
First {\em vs.}\ Higher Order Logics &
Classical {\em vs.}\  Non-Classical Logics \\
Special {\em vs.}\  General Purpose Inference &
Interactive {\em vs.}\ Automatic Systems \\
\end{tabular}
\end{center}

Specific topics of interest include (but are not limited to):
\begin{center}
\begin{tabular}{lll}
Resolution & Sequent Calculus & Decision Procedures \\
Unification & Rewrite Rules & Mathematical Induction \\
\end{tabular}
\end{center}

and any applications of automated deduction, including:
\begin{center}
\begin{tabular}{ll}
Deductive Databases & Logic and Functional Programming \\
Commonsense Reasoning & Software and Hardware Development \\
Distributed Theorem Proving & Learning Search Heuristics \\
\end{tabular}
\end{center}

The CADE-13 conference itself will be held from Wednesday, 31 July, to
Saturday, 3 August, 1996.  It will be held as part of the Federated
Logic Conference (FLoC'96) to be hosted by the Center for Discrete
Mathematics and Computer Science (DIMACS) at Rutgers University, New
Brunswick, New Jersey, USA, from Saturday, 27 July, to Saturday, 3
August, 1996.  As well as CADE, other conferences participating in
FLoC'96 will be CAV, (Conference on Computer-Aided Verification), LICS
(IEEE Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications).  The goal of FLoC is to battle
fragmentation of the technical community by bringing together
synergetic conferences that relate logic to computer science.

Anyone wishing to offer a tutorial in conjunction with CADE-13 should
send a proposal no longer than two pages in length by post to the
Program Co-Chairs by 1 December, 1995.  This proposal should describe
the topic of the proposed tutorial; explain why this topic is relevant
to CADE; name the speakers and specify the tutorial's length.  The
default length is two hours. Further information about the arrangements
for tutorials, can be obtained from the Local Arrangements Chair or
from the CADE-13 world wide web site:
http://www.research.att.com/lics/FLoC/cade13.

Note that it is unlikely that more than the equivalant of 12 two hour
tutorials will be chosen.  The maximum number of tutorials running in
parallel is unlikely to exceed six.

\vskip1.5cm
\raggedleft ../2
\begin{center}
\begin{tabular}{l@{\hspace{2em}}l}
\begin{tabular}[t]{l}
{\bf Program Co-Chairs\/}\\[1ex]
Michael McRobbie and John Slaney \\
Centre for Information Science Research \\
The Australian National University\\
ACT  0200 \\
Australia
\end{tabular}
&
\begin{tabular}[t]{l}
{\bf Local Arrangements Chair\/}\\[1ex]
Amy Felty\\
AT\&T Bell Laboratories \\
Room 2A-425 \\
600 Mountain Avenue \\
Murray Hill  NJ  07974  \\
United States of America \\

\end{tabular}\\
\hbox{}\\
\begin{tabular}[t]{l}
 Tel: [+61] 6-249-2035 \\
 Fax: [+61] 6-249-0747 \\
 Email: {\tt cade13}{\rm @}{\tt cisr.anu.edu.au}%
\end{tabular}
&
\begin{tabular}[t]{l}
 Tel: [+1 ] 908-5824049 \\
 Fax: [+1 ] 908-5827550 \\
 Email: {\tt cade13-la}{\rm @}{\tt cisr.anu.edu.au}
\end{tabular}
\end{tabular}
\end{center}

\vskip0.5cm
\begin{center}
{\bf Program Committee\/}
\end{center}

\begin{center}
\begin{tabular}{lll}
O.~Astrachan (Duke)& J.~Avenhaus (Kaiserslautern)& L.~Bachmair (Stonybrook)\\
D.~Basin (Max-Planck)& W.~Bibel (Darmstadt)& B.~Buchberger (Linz)\\
F.~Bry (Munich)& R.~Caferra (Grenoble)& K.~S.~Choi (KAIST)\\
A.~Cohn (Leeds)& L.~Farinas del Cerro (Toulouse)& W.~Farmer (MITRE)\\
A.~Felty (AT\&T Bell Labs)& M.~Fitting (CUNY)& M.~Fujita (MRI)\\
S.~Garland (MIT)& F.~Giunchiglia (IRST)& E.~Gunter (AT\&T Bell Labs)\\
R.~Hasegawa (Kyushu)& L.~Henschen (North Western)& L.~Hines (Texas)\\
S.~H\"olldobler (Dresden)& M.~Kaufmann (Motorola)& A.~Leitsch (Vienna)\\
E.~Lusk (Argonne)& U.~Martin (St.~Andrews)& D.~McAllester (MIT)\\
W.~McCune (Argonne)& H.-J.~Ohlbach (Max-Planck)& J.~Posegga (Karlsruhe)\\
W.~Pase (Ottawa)& F.~Pfenning (Carnegie Mellon)& F.~Pirri (Rome)\\
D.~Plaisted (North Carolina)& U.~Reddy (Illinois)& M.~Rusinowitch (INRIA)\\
K.~Satoh (Hokkaido)& J.~Schumann (Munich)&  C.~Schwind (Marseille)\\
N.~Shankar (SRI)& J.~Siekmann (Saarbr\"ucken)& A.~Smaill~(Edinburgh)\\
G.~Smolka~(Saarbr\"ucken)& M.~Stickel~(SRI)& G.~Sutcliffe (James Cook)\\
E.~Tiden (Siemens)& A.~Voronkov (Uppsala)& L.~Wallen (Oxford)\\
D.~Wang (Grenoble)& H.~Zhang (Iowa)& \\
\end{tabular}
\end{center}
\end{document}

------- End of Forwarded Message



From brownfld@cs.uiuc.edu  Wed Sep 20 10:47:42 1995
Return-Path: <brownfld@cs.uiuc.edu>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA04573; Wed, 20 Sep 95 10:47:42 CDT
Received: from sal.cs.uiuc.edu by cli.com (4.1/SMI-4.1)
	id AA07120; Wed, 20 Sep 95 10:47:41 CDT
Received: from [128.174.241.184] (marla.cs.uiuc.edu) by sal.cs.uiuc.edu with SMTP id AA25028
  (5.67b/IDA-1.5 for <nqthm-users@cli.com>); Wed, 20 Sep 1995 10:45:55 -0500
X-Sender: brownfld@sal.cs.uiuc.edu
Message-Id: <ac84a52912021004a082@[128.174.241.184]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Tue, 19 Sep 1995 10:50:39 -0600
To: nqthm-users@cli.com
From: brownfld@cs.uiuc.edu (Marla Brownfield)
Subject: Please ignore previous transmission





From moore@cli.com  Mon Sep 25 15:55:32 1995
Return-Path: <moore@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA08562; Mon, 25 Sep 95 15:55:32 CDT
Received: from rana.cli.com by cli.com (4.1/SMI-4.1)
	id AA12210; Mon, 25 Sep 95 15:55:31 CDT
From: moore@cli.com (J Strother Moore)
Received: by rana.cli.com (4.1) id AA03559; Mon, 25 Sep 95 15:55:30 CDT
Date: Mon, 25 Sep 95 15:55:30 CDT
Message-Id: <9509252055.AA03559@rana.cli.com>
To: nqthm-users@cli.com
Subject: ACL2

ACL2 is a new theorem proving system produced at Computational Logic, Inc.  The
acronym ``ACL2'' stands for ``A Computational Logic for Applicative Common
Lisp.'' ACL2 is similar to the Boyer-Moore theorem prover, Nqthm, and
Kaufmann's interactive extension, Pc-Nqthm.  However, instead of supporting the
``Boyer-Moore logic,'' ACL2 supports a large applicative subset of Common Lisp.
Furthermore, ACL2 is programmed almost entirely within that language.

To obtain ACL2 by ftp, first connect to ftp.cli.com by anonymous login.  Then
`cd' to ~acl2/v1-8, `get' the file `README' and follow the directions therein.
To obtain ACL2 by magnetic tape (for which service a fee shall be charged)
write to Software-Request, Computational Logic Inc., 1717 West Sixth, Suite
290, Austin, TX 78703-4776, USA; email:  Software-Request@cli.com.  FAX:  +1
512 322 0656.

If you would like to join the unmoderated ACL2 mailing list, acl2@cli.com, send
to acl2-request@cli.com a message containing as its body (NOT its Subject) the
the single word `subscribe'.  To get general information about the mailing
list, send the word `info' (this will not subscribe you to the mailing list).
To send a message to all who receive ACL2 mail, send the message to
acl2@cli.com.  Finally, please report bugs in ACL2 to acl2-bugs@cli.com.

The ACL2 logic is a first-order logic of recursive functions providing
mathematical induction on the ordinals up to epsilon-0 and two extension
principles:  one for recursive definition and one for constrained introduction
of new function symbols.  First-order quantification is supported in a weak
sense using a ``choice'' operator.

The syntax of ACL2 is that of Common Lisp.  Constants and macros may be defined
and used to extend the syntax.

The following primitive data types are axiomatized:  rational numbers
(including, of course, integers and naturals), complex rationals, characters,
character strings, symbols (including packages), and conses.  All primitive
Common Lisp functions on the above data types are (meant to be) defined in
ACL2.  By ``Common Lisp function'' we mean any function described in ``Common
Lisp The Language,'' by Guy Steele (Digital Press, 30 North Avenue, Burlington,
MA 01803, 1984 and 1990), that is applicative, is not dependent on state,
implicit parameters or data types other than those listed above, and is
completely and unambiguously specified in a host-independent manner.
Approximately 170 such symbols are axiomatized.

To applicative Common Lisp ACL2 adds a single-threaded notion of ``state''
allowing the efficient provision of one and two dimensional arrays, property
lists, and file directed input and output within the applicative setting.  In
addition, ACL2 adds notions of multi-valued function call and return and a
number of other useful primitives.

The ACL2 system allows the definition of new function symbols and the proofs of
theorems about those symbols.  Like Nqthm, the behavior of the theorem proving
engine is determined by rules derived from previously introduced functions and
theorems.  ACL2 provides many ``rule classes'' by which the user can specify
how a theorem is to affect the behavior of the theorem prover.  ACL2 also
provides

* an interactive capability like that of Pc-Nqthm;
* more user control of proofs than Nqthm, via hints and scoping mechanisms;
* improved handling of propositional logic (including use of BDDs);
* a specification capability (``guards'') akin to types, but more flexible;
* proof techniques in addition to those of Nqthm, including forward chaining, 
  congruence-based rewriting, forced case-splits, and built-in clauses for 
  termination proofs;
* extensive hyper-linked on-line documentation available via ACL2 documentation
  commands, HTML browsers and Emacs Info; and
* a ``proof-tree'' facility that makes it easy to explore failed proof
  attempts.

ACL2 has seen heavy in-house use at Computational Logic, Inc., for
approximately 2 years.  Several major projects have been carried out with it.
However, it has not received the extensive scrutiny that Nqthm has and bugs --
possibly even soundness bugs -- may crop up.  Please report them to
acl2-bugs@cli.com, so that we can fix them and notify other users.

ACL2, including the source code, is available electronically without fee.
However, use of ACL2 signifies the user's agreement to abide by the terms of a
license agreement distributed as part of the system.

ACL2 currently works on the Unix (and some variants, including Linux) and
Macintosh operating systems.  It is built on top of any of the following Common
Lisps:  Allegro, GCL (Gnu Common Lisp) [or, AKCL], Lispworks, Lucid, and MCL
(Macintosh Common Lisp).  We recommend running ACL2 with at least 16MB of
memory.


From raina@ibmoto.com  Wed Sep 27 16:30:50 1995
Return-Path: <raina@ibmoto.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA10078; Wed, 27 Sep 95 16:30:50 CDT
Received: from cerberus.ibmoto.com by cli.com (4.1/SMI-4.1)
	id AA18944; Wed, 27 Sep 95 16:22:39 CDT
Received: from hangdog.ibmoto.com (raina@hangdog.ibmoto.com [129.38.10.13]) by cerberus.ibmoto.com (8.6.12/8.6.9) with ESMTP id QAA25806; Wed, 27 Sep 1995 16:20:39 -0500
Received: (raina@localhost) by hangdog.ibmoto.com (8.6.10/8.6.9) id QAA18374; Wed, 27 Sep 1995 16:20:37 -0500
Message-Id: <199509272120.QAA18374@hangdog.ibmoto.com>
X-Mailer: exmh version 1.5 11/22/94
To: info-hol@leopard.cs.byu.edu, larch-interest@pa.dec.com,
        nqthm-users@cli.com, theorem-provers@ai.mit.edu, qed@mcs.anl.gov
Cc: raina@ibmoto.com
Subject: DAC 1996 - Special Topics Session on Functional Design Verification
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Wed, 27 Sep 95 16:20:36 -0600
From: Raj Raina <raina@ibmoto.com>


*****************************************************************************

                                         33rd DESIGN AUTOMATION CONFERENCE
                                         LAS VEGAS CONVENTION CENTER
                                         JUNE 3 - 7, 1996

                              ANNOUNCEMENT
                              ============

The organizing committee for DAC '96 is planning a Special Topic Session 
focusing on Functional Design Verification of Microprocessors. Papers are
being solicited from Microprocessor Design groups in the area of functional
design verification. Topics can include (but are not limited to) the 
following subjects:  

   o Functional design verification methodology & experience on a chip.
   o Functional verification coverage analysis techniques.
        - toggle coverage
        - state-machine coverage
        - event coverage 
   o Design Modeling for functional verification - choices & tradeoffs.
   o Design verification test generation - focused, random.  
   o Simulation/Emulation techniques for functional verification.
   o When are we done with functional verification? Practical & Formal 
     methods for establishing "doneness" criteria.
   o Techniques for stressing a design.

REQUIREMENTS FOR SUBMISSION OF PAPERS
      Authors should submit their papers to the Program Chair postmarked no
      later than October 6, 1995. Previously published papers, including
      workshop proceedings, will not be considered. Each submission should
      include one cover page and ten (10) stapled copies of the complete
      manuscript.

      The one cover page should include:

         -Name, affiliation, and complete address for each  author
         -A designated contact person including his/her telephone number,
          fax number, and email address
         -A designated presenter, should the paper be accepted
         -A list of topic numbers, ordered by relevancy, most clearly
           matching the content of the paper

     The following signed statement: "All appropriate organizational
     approvals for the publication of this paper have been obtained. If
     accepted, the author(s) will prepare the final manuscript in time for
     inclusion in the Conference proceedings and will present the paper at
     the Conference."

     To permit a blind review, do not include name(s) or affiliation(s) of
     the author(s) on the manuscript.  Include:

         -Title of paper
         -60 word abstract indicating significance of contribution.  The
          abstracts of accepted papers will appear on the World Wide Web 
          before the Conference.
         -The complete text of the paper in English, including all
          illustrations and references, not exceeding 5000 words. The papers
          will be reviewed as finished papers. Preliminary submissions will
          be at a disadvantage.

     Notice of acceptance will be mailed to the contact person by Feb 16, 
     1996. Authors of accepted papers must sign a copyright release form.


     PROGRAM CHAIR
      MP Associates, Inc.
      ATTN: Program Chair, 33rd DAC
      5305 Spine Rd., Suite A
      Boulder, Colorado  80301
      For information call: (303) 530-4333


     Watch the WWW for updates!  (http://www.dac.com/dac.html)


-- 
For more information on this Special Topics Session, please contact: 
******************************************************************************
Raj Raina    * e-mail:  raina@ibmoto.com              * (512) 795-7211  
Address: Motorola at Somerset; MD: OE513; 9737 GH Trail, Austin, TX 78759
******************************************************************************
      


From Hakim.Bouamama@imag.fr  Fri Oct 20 03:58:15 1995
Return-Path: <Hakim.Bouamama@imag.fr>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA11943; Fri, 20 Oct 95 03:58:15 CDT
Received: from imag.imag.fr by cli.com (4.1/SMI-4.1)
	id AA15748; Fri, 20 Oct 95 03:58:01 CDT
Received: from droopy.imag.fr (droopy.imag.fr [129.88.42.10]) by imag.imag.fr (8.6.11/8.6.9) with ESMTP id JAA20776 for <nqthm-users@cli.com>; Fri, 20 Oct 1995 09:57:54 +0100
Received: from ametista.imag.fr (ametista.imag.fr [129.88.40.20]) by droopy.imag.fr (8.6.10/8.6.9) with ESMTP id JAA02849 for <nqthm-users@cli.com>; Fri, 20 Oct 1995 09:57:43 +0100
From: Hakim Bouamama <Hakim.Bouamama@imag.fr>
Received: (bouamama@localhost) by ametista.imag.fr (8.6.11/8.6.9) id JAA03881; Fri, 20 Oct 1995 09:55:26 GMT
Date: Fri, 20 Oct 1995 09:55:26 GMT
Message-Id: <199510200955.JAA03881@ametista.imag.fr>
To: nqthm-users@cli.com
Subject: PROBLEM WITH ASSIGNING A LIST IN NQTHM



Hello every body.
I am writting a shell to represent LIST, and I defined two functions
on this shell: NTH and ASSIGN-SLICE

NTH gives the Nth element of a list starting at zero.

X: |------------------|
    
 0     N

ASSIGN-SLICE replaces a SLICE of a list with another SLICE.



X: |-----******-------|
   0---->A
         1--->B

SLICE:   |********|


So, my problem is to prove that under some conditions we have:

 (EQUAL 
       (NTH (ASSIGNE-SLICE X A B SLICE) N)
       (NTH SLICE (DIFFERENCE N A))
 )
 
If any one has an idea about that or is able to prove it, please
contact me.

Thank you in advance.


Here below the complete source code of my SHELL LIST and functions
related to it.

;**********
;SOURCE
;**********

(ADD-SHELL LCONS LEMPTY P{LIST}
           ((LCAR (NONE-OF ERRORP) FALSE)
            (LCDR (ONE-OF P{LIST}) LEMPTY)))

(DEFN LEMPTYP (V)
  (EQUAL V (LEMPTY)))

(DEFN SIZE (A)
  (IF (P{LIST} A)
     (IF (EQUAL A (LEMPTY))
          0
          (ADD1 (SIZE (LCDR A))))
      0))

;****
;NTH FUNCTION
;****
(DEFN LNTH (X N)
  (IF (NUMBERP N)
    (IF (LEMPTYP X)
      F
      (IF (EQUAL 0 N)
          (LCAR X)
          (LNTH (LCDR X) (SUB1 N))))
      F))

;****
;ASSIGN-SLICE FUNCTION
;****
(DEFN ASSIGN-SLICE (X A B SLICE)
 (IF (LEMPTYP X)
      (LEMPTY)
      (IF (LEMPTYP SLICE)
          X
          (IF (ZEROP B)
              X
              (IF (ZEROP A)
                  (LCONS (LCAR SLICE)
                        (ASSIGN-SLICE (LCDR X) A (SUB1 B) (LCDR SLICE)))
                  (LCONS (LCAR X)
                        (ASSIGN-SLICE (LCDR X) (SUB1 A) B SLICE))))))
 ((LESSP (PLUS A B)))
)


From kaufmann@cli.com  Tue Oct 31 07:40:12 1995
Return-Path: <kaufmann@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA17607; Tue, 31 Oct 95 07:40:12 CST
Received: from thunder.cli.com by cli.com (4.1/SMI-4.1)
	id AA20922; Tue, 31 Oct 95 07:40:12 CST
From: kaufmann@cli.com (Matt Kaufmann)
Received: by thunder.cli.com (4.1) id AA05316; Tue, 31 Oct 95 07:40:11 CST
Date: Tue, 31 Oct 95 07:40:11 CST
Message-Id: <9510311340.AA05316@thunder.cli.com>
To: Hakim.Bouamama@imag.fr
Cc: nqthm-users@cli.com
In-Reply-To: <199510200955.JAA03881@ametista.imag.fr> (message from Hakim Bouamama on Fri, 20 Oct 1995 09:55:26 GMT)
Subject: Re: PROBLEM WITH ASSIGNING A LIST IN NQTHM

Hello --

Here is a solution to the problem you raised in your message last Friday,
regarding indexing into a list after inserting a slice into that list.  It
was a fun and interesting challenge; I recommend it to everyone on the list
who wants to improve Nqthm skills.  (By the way, I found it useful to use
Pc-Nqthm to help me "debug" my proof, though the final result, included at
the end of this message, replays in Nqthm.)

The theorem I proved was:

(prove-lemma nth-assign-slice (rewrite)
  (implies (and (numberp n) ; necessary because of definition of lnth
                (not (lessp n a))
                (lessp n b)
                (lessp n (plus a (size slice)))
                (not (lessp (size x) b)))
           (equal (lnth (assign-slice x a b slice) n)
                  (lnth slice (difference n a))))
  ((use (nth-assign-slice-lemma (slice-index (difference n a))))))

You'll notice from the hint that I chose to prove this by way of a lemma.  I
find it helpful sometimes to avoid reasoning about difference if I can instead
reason about plus:

(prove-lemma nth-assign-slice-lemma ()
  ;; slice-index = n - a, so n = a + slice-index
  (implies (and (numberp slice-index) ; necessary because of definition of lnth
                (not (lessp b a))
                (lessp (plus a slice-index) b)
                (lessp slice-index (size slice))
                ;; Strengthen (not (lessp (size x) b)) so induction goes thru:
                (lessp (plus a slice-index) (size x)))
           (equal (lnth (assign-slice x a b slice) (plus a slice-index))
                  (lnth slice slice-index)))
  ((induct (induction-hint x a b slice slice-index))))

Notice that this lemma takes an induction hint.  That's because I want
slice-index to "step down" as it is "supposed to."  (Sorry for the poor
explanation.  If someone insists then I'll try to make this point clearer.)
The induction scheme is much like the definition of assign-slice, but modified
so that slice-index also changes:

(defn induction-hint (x a b slice slice-index)
  (if (lemptyp x)
      (lempty)
    (if (lemptyp slice)
        x
      (if (zerop b)
          x
        (if (zerop a)
            (induction-hint (lcdr x) a (sub1 b) (lcdr slice)
                            (sub1 slice-index))
          (induction-hint (lcdr x) (sub1 a) b slice slice-index)))))
  ((lessp (plus a b))))

Here is the entire script, but modified slightly to improve your original
definition of lnth so that non-numbers are treated the same as 0.  This
simplifies the final theorem a bit, and can simplify some of the interaction
with the prover by eliminating special consideration of non-numbers.  If anyone
wants a script solving the original problem, let me know; I've got it as well.

-- Matt Kaufmann [script follows]
==============================

(boot-strap nqthm)

(ADD-SHELL ERR NIL ERRORP ())

(ADD-SHELL LCONS LEMPTY P{LIST}
           ((LCAR (NONE-OF ERRORP) FALSE)
            (LCDR (ONE-OF P{LIST}) LEMPTY)))

(DEFN LEMPTYP (V)
  (EQUAL V (LEMPTY)))

(DEFN SIZE (A)
  (IF (P{LIST} A)
     (IF (EQUAL A (LEMPTY))
          0
          (ADD1 (SIZE (LCDR A))))
      0))

;****
;NTH FUNCTION
;****
(DEFN LNTH (X N)
  (IF (LEMPTYP X)
      F
      (IF (zerop n)
          (LCAR X)
          (LNTH (LCDR X) (SUB1 N)))))

;****
;ASSIGN-SLICE FUNCTION
;****
(DEFN ASSIGN-SLICE (X A B SLICE)
 (IF (LEMPTYP X)
      (LEMPTY)
      (IF (LEMPTYP SLICE)
          X
          (IF (ZEROP B)
              X
              (IF (ZEROP A)
                  (LCONS (LCAR SLICE)
                        (ASSIGN-SLICE (LCDR X) A (SUB1 B) (LCDR SLICE)))
                  (LCONS (LCAR X)
                        (ASSIGN-SLICE (LCDR X) (SUB1 A) B SLICE))))))
 ((LESSP (PLUS A B)))
)

(defn induction-hint (x a b slice slice-index)
  (if (lemptyp x)
      (lempty)
    (if (lemptyp slice)
        x
      (if (zerop b)
          x
        (if (zerop a)
            (induction-hint (lcdr x) a (sub1 b) (lcdr slice)
                            (sub1 slice-index))
          (induction-hint (lcdr x) (sub1 a) b slice slice-index)))))
  ((lessp (plus a b))))

(prove-lemma nth-assign-slice-lemma ()
  ;; slice-index = n - a, so n = a + slice-index
  (implies (and (not (lessp b a))
                (lessp (plus a slice-index) b)
                (lessp slice-index (size slice))
                ;; Strengthen (not (lessp (size x) b)) so induction goes thru:
                (lessp (plus a slice-index) (size x)))
           (equal (lnth (assign-slice x a b slice) (plus a slice-index))
                  (lnth slice slice-index)))
  ((induct (induction-hint x a b slice slice-index))))

(prove-lemma plus-difference-lemma (rewrite)
  (equal (plus a (difference n a))
         (if (lessp a n)
             n
           (fix a))))

(prove-lemma nth-assign-slice (rewrite)
  (implies (and (not (lessp n a))
                (lessp n b)
                (lessp n (plus a (size slice)))
                (not (lessp (size x) b)))
           (equal (lnth (assign-slice x a b slice) n)
                  (lnth slice (difference n a))))
  ((use (nth-assign-slice-lemma (slice-index (difference n a))))))

;;; end


From: boyer (Robert S. Boyer)
Received: by dilbert.cli.com (4.1) id AA13865; Fri, 15 Sep 95 09:34:17 CDT
Date: Fri, 15 Sep 95 09:34:17 CDT
Message-Id: <9509151434.AA13865@dilbert.cli.com>
To: nqthm-users@cli.com
Subject: Announcing the Availability of More Nqthm-Checked Theorems
Sender: owner-nqthm-users
Precedence: bulk


Below we describe how to obtain, install, and mechanically proof-check some
files containing Nqthm-checked theorems over and above those in the `examples'
directory distributed with Nqthm-1992.

These additional files include:

  *  Much of the `Clinc Stack'
	 a.  The FM9001 microprocessor 
	     (Brock & Hunt, with contributions from Kaufmann) 
	     [fm9001-piton/fm9001-replay.events]
	 b.  The Piton assembler (Moore)
	     [fm9001-piton/piton.events]
	 c.  The `big-add' Piton example (Moore)   
	     [fm9001-piton/big-add.events]
	 d.  A Piton program that wins at Nim (Wilding)
	     [fm9001-piton/nim-piton.events]

  *   A Paris-Harrington Ramsey theorem (Kunen)
	 [kunen/paris-harrington.events]

  *   An illustration of the surprising power of EVAL$ (Kunen)
	 [kunen/induct.events] (surprising to Boyer and Moore anyway)

  *   The arithmetic-geometric mean theorem
	 (Kaufmann & Pecchiari)
	 [numbers/arithmetic-geometric-mean.events]

  *   The mutilated checkerboard theorem in the general NxN case 
	 (Subramanian)
	 [subramanian/mutilated-checkerboard.events]

  *   A simple real-time system, the classic train example (Young)
	 [young/train.events]

  *   A theorem about coin tossing probabilities (Kaufmann)
	 [numbers/tossing.events]

  *   A proof of correctness of a real-time scheduling algorithm
	 (Wilding)
	 [numbers/scheduler.events]

Some documentation for some of the above proof efforts may be found as follows:

* FM9001 microprocessor            http://www.cli.com/hardware/fm9001.html
* Piton assembler                  http://www.cli.com/reports/files/022.ps
* Nim playing program in Piton     http://www.cli.com/reports/files/078.ps
* Paris-Harrington Ramsey          http://www.cs.wisc.edu/~kunen/ramsey.ps
* EVAL$                            http://www.cs.wisc.edu/~kunen/nqthm.ps
* Arithmetic-geometric mean        http://www.cli.com/reports/files/100.ps
* Real time train                  http://www.cli.com/reports/files/093.ps
* Mutilated checker board
  ftp://ftp.cli.com/pub/nqthm/nqthm-1992/examples/subramanian/mutilated-checkerboard.ps
* Real-time scheduling             ftp://ftp.cli.com/home/wilding/scheduler-proof.ps

The source files for these theorems, named within square brackets above, may be
obtained individually from the directory
ftp://ftp.cli.com/pub/nqthm/nqthm-1992/examples/ or altogether in the single
file ftp://ftp.cli.com/pub/nqthm/nqthm-1992/1995-examples.tar.Z.

Also included on the tar file are new `driver' files for doing a replay of all
the examples under Nqthm-1992, both these new examples and those previously
distributed with Nqthm-1992.  A Gnu Emacs TAGS file for all the event commands
in all the examples is also provided.

Supposing that one has obtained the file
ftp://ftp.cli.com/pub/nqthm/nqthm-1992/1995-examples.tar.Z, and assuming that
Nqthm-1992 has been installed, and resides in the directory `nqthm-1992',
proceed as follows:

1.  Move the file `1995-examples.tar.Z' to the `nqthm-1992' directory.
2.  % cd nqthm-1992
3.  % uncompress 1995-examples.tar.Z
4.  % tar xvf 1995-examples.tar
5.  % rm 1995-examples.tar  (optional, to save space)

Assuming that Nqthm-1992 has been installed correctly, it should now be
possible to execute the following command, when connected to the `nqthm-1992'
directory, to have all the new event files proof-checked by Nqthm-1992.  This
checking process will take many hours on a contemporary work station.

6.  % make giant-test

On operating systems not Unix related, instead of the previous command one may
load the files `examples/driver.lisp' and `examples/driver-sk.lisp' to recheck
the theorems.  See the file examples/README for further details.

Bob Boyer and J Moore

September 1995

P. S. This message may also be found as the file
examples/README-for-1995-examples on the tar file mentioned above.

P. P. S.  For information on obtaining the Nqthm prover itself, please see
ftp://ftp.cli.com/pub/nqthm/nqthm-1992/nqthm-1992.announcement



From kepser@cis.uni-muenchen.de  Thu Nov 23 16:56:41 1995
Return-Path: <kepser@cis.uni-muenchen.de>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA13120; Thu, 23 Nov 95 16:56:41 CST
Received: from thecube.cis.uni-muenchen.de by cli.com (4.1/SMI-4.1)
	id AA01133; Thu, 23 Nov 95 16:55:23 CST
Received: by thecube.cis.uni-muenchen.de (NX5.67f2/NX3.0M)
	id AA18452; Thu, 23 Nov 95 23:55:07 +0100
Date: Thu, 23 Nov 95 23:55:07 +0100
From: Stephan Kepser <kepser@cis.uni-muenchen.de>
Message-Id: <9511232255.AA18452@thecube.cis.uni-muenchen.de>
To: nqthm-users@cli.com
Subject: CfParticipation  Unif'96



    UNIF'96        Call for participation       UNIF'96


         Tenth INTERNATIONAL WORKSHOP ON UNIFICATION 


         Thursday, June 6 - Saturday, June 8, 1996
                Herrsching (Munich) Germany



This workshop is the tenth in a series of international meetings, the
last three having been in Boston (USA, 1993) and Val d'Ajol (France,
1994), and Sitges (Spain, 1995).  As its predecessors, UNIF'96 is
meant to be an opportunity to meet old and new colleagues, to present
recent work, and to discuss new ideas and trends related to
unification and all its extensions that nowadays have replaced
standard unification in many applications, like dis-, E- or
higher-order unification or other more general symbolic constraint
solving techniques.  It is also a good opportunity for researchers
working in related areas to get an overview of the current state of
the art in the field. 

UNIF'96 will be organized by Klaus U. Schulz and Stephan Kepser, and
partially supported by CIS, University of Munich. We intend to have
sessions with short talks (15 or 30 minutes), followed by discussions,
panel discussions on actual topics, and system demonstrations.  The
following is a (non-exclusive) list of possible topics: 

* Foundations  
* Typed Unification     
* Special Unification algorithms 
* Narrowing    
* Combination problems  
* Higher-Order Unification       
* Disunification                 
* Type reconstruction            
* Constraint solving             
* Applications                   
* Implementations               
* General E-unification and Calculi 


Herrsching is a nice village at the ``Ammersee'', a lake 25 km
south-west of Munich. It can easily be reached by S-Bahn from Munich
Airport or from the main railway station. The address of the workshop
place is

Bildungsstaette des Bayerischen Bauernverbands Herrsching
Rieder Strasse 70
D-82211 Herrsching
Germany

Participants are expected to arrive for dinner on Wednesday,
June 5. The total cost will be 440 DM (German Marks) for single rooms,
covering full board.  There will be no additional registration fees.

Because of the size of the facilities, places at the workshop will be
limited to about 45 people, which means that we cannot guarantee
participation to everybody.  The final list of talks and participants
will be selected by Claude Kirchner and Klaus U. Schulz.

If you intend to participate in the workshop, please apply to 
  schulz@cis.uni-muenchen.de, indicating: (i) full name and address,
(ii) whether you intend to give a talk, and (iii) preference for
single or double room (in the latter case, joint applications for both
people are recommended).  Please apply soon, but in any case
before March 27, 1996 (early applications will have a higher
priority).  Abstracts of the talks will be due by May 15, 1996.

If you have any questions, please send an e-mail to 
  schulz@cis.uni-muenchen.de 

WWW: http://www.cis.uni-muenchen.de/hot/unif96.html

-------------------- LaTeX Version --------------------------------------
\documentstyle[12pt]{article}
\pagestyle{empty}
\setlength{\oddsidemargin}{2.55mm}
\setlength{\evensidemargin}{2.55mm}
\setlength{\textwidth}{165mm}
\setlength{\topmargin}{5.55mm}
\setlength{\headheight}{0cm}
\setlength{\footheight}{3cm}
\setlength{\headsep}{0cm}
\setlength{\textheight}{230mm}
\begin{document}

\begin{center}
{\Large\bf UNIF'96}
{\bf \ \ Call for participation\ \ }
{\Large\bf UNIF'96}
\medskip

{\bf Tenth INTERNATIONAL WORKSHOP ON UNIFICATION }
\medskip

Thursday, June 6 - Saturday, June 8, 1996\\ Herrsching (Munich) Germany
\end{center}
 
 
This workshop is the tenth in a series of international meetings, the
last three having been in Boston (USA, 1993) and Val d'Ajol (France,
1994), and Sitges (Spain, 1995).  As its predecessors, UNIF'96 is
meant to be an opportunity to meet old and new colleagues, to present
recent work, and to discuss new ideas and trends related to
unification and all its extensions that nowadays have replaced
standard unification in many applications, like dis-, E- or
higher-order unification or other more general symbolic constraint
solving techniques.  It is also a good opportunity for researchers
working in related areas to get an overview of the current state of
the art in the field.  \medskip


UNIF'96 will be organized by Klaus U. Schulz and Stephan Kepser, and
partially supported by CIS, University of Munich. We intend to have
sessions with short talks (15 or 30 minutes), followed by discussions,
panel discussions on actual topics, and system demonstrations.  The
following is a (non-exclusive) list of possible topics: \smallskip

{\em\begin{tabular}{lll}
$\bullet$ Foundations                           &
$\bullet$ Typed Unification                     &
$\bullet$ Special Unification algorithms        \\     
%
$\bullet$ Narrowing                             &      
$\bullet$ Combination problems                  &
$\bullet$ Higher-Order Unification              \\           
%
$\bullet$ Disunification                        &
$\bullet$ Type reconstruction                   &
$\bullet$ Constraint solving                    \\                 
%
$\bullet$ Applications                          &
$\bullet$ Implementations                       &      
$\bullet$ General E-unification and Calculi     \\  
\end{tabular}}

Herrsching is a nice village at the ``Ammersee'', a lake 25 km
south-west of Munich. It can easily be reached by S-Bahn from Munich
Airport or from the main railway station. The address of the workshop
place is
\begin{center}
Bildungsst\"atte des Bayerischen Bauernverbands Herrsching\\
Rieder Stra{\ss}e 70\\
D-82211 Herrsching\\
Germany
\end{center}
Participants are expected to arrive for dinner
on Wednesday, June~5. The total cost
will be 440 DM (German Marks) for single rooms, covering full
board.  There will be no additional registration fees.

Because of the size of the facilities, places at the workshop will be
limited to about 45 people, which means that we cannot guarantee
participation to everybody.  The final list of talks and participants
will be selected by Claude Kirchner and Klaus U. Schulz.

If you intend to participate in the workshop, please apply to {\tt
  schulz@cis.uni-muenchen.de}, indicating: (i) full name and address,
(ii) whether you intend to give a talk, and (iii) preference for
single or double room (in the latter case, joint applications for both
people are recommended).  Please {\bf apply soon}, but in any case
{\bf before March 27, 1996} (early applications will have a higher
priority).  Abstracts of the talks will be due by {\bf May 15, 1996}.

If you have any questions, please send an e-mail to {\tt
  schulz@cis.uni-muenchen.de}. 

WWW: {\tt http://www.cis.uni-muenchen.de/hot/unif96.html}
\end{document}

From Julia.Dushina@imag.fr  Tue Nov 28 10:31:31 1995
Return-Path: <Julia.Dushina@imag.fr>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA00494; Tue, 28 Nov 95 10:31:31 CST
Received: from imag.imag.fr by cli.com (4.1/SMI-4.1)
	id AA12557; Tue, 28 Nov 95 10:31:25 CST
Received: from droopy.imag.fr (droopy.imag.fr [129.88.42.10]) by imag.imag.fr (8.6.11/8.6.9) with ESMTP id RAA19826 for <nqthm-users@cli.com>; Tue, 28 Nov 1995 17:31:08 +0100
Received: from esmeralda.imag.fr (esmeralda.imag.fr [129.88.40.13]) by droopy.imag.fr (8.6.10/8.6.9) with ESMTP id RAA29082 for <nqthm-users@cli.com>; Tue, 28 Nov 1995 17:31:00 +0100
From: Julia Dushina <Julia.Dushina@imag.fr>
Received: (dushina@localhost) by esmeralda.imag.fr (8.6.10/8.6.9) id RAA08527 for nqthm-users@cli.com; Tue, 28 Nov 1995 17:30:40 +0100
Date: Tue, 28 Nov 1995 17:30:40 +0100
Message-Id: <199511281630.RAA08527@esmeralda.imag.fr>
To: nqthm-users@cli.com
Subject: PROBLEM WITH DIVISION


Hello everybody.


I am interested in proof:

 (EQUAL (QUOTIENT (ADD1 (TIMES 2 A)
                  (TIMES 2 B)
        (QUOTIENT A B))

where A and B are the natural numbers.

Thanks in advance.

From wilding@cli.com  Wed Nov 29 11:13:10 1995
Return-Path: <wilding@cli.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA00923; Wed, 29 Nov 95 11:13:10 CST
Received: from somerville.cli.com by cli.com (4.1/SMI-4.1)
	id AA17540; Wed, 29 Nov 95 11:13:08 CST
Received: by somerville.cli.com (4.1) id AA00803; Wed, 29 Nov 95 11:13:05 CST
Date: Wed, 29 Nov 95 11:13:05 CST
Message-Id: <9511291713.AA00803@somerville.cli.com>
From: Matt Wilding <wilding@cli.com>
To: Julia.Dushina@imag.fr
Cc: nqthm-users@cli.com
In-Reply-To: <199511281630.RAA08527@esmeralda.imag.fr> (message from Julia
	Dushina on Tue, 28 Nov 1995 17:30:40 +0100)
Subject: Re: PROBLEM WITH DIVISION

Julia Dushina <Julia.Dushina@imag.fr> writes:

> I am interested in proof:
> 
>  (EQUAL (QUOTIENT (ADD1 (TIMES 2 A)
>                   (TIMES 2 B)
>         (QUOTIENT A B))
> 
> where A and B are the natural numbers.


Nqthm proves this lemma using the naturals library distributed with
Nqthm-1992.  The naturals library has rules proved about "plus" rather
than "add1", so we first prove a version of the lemma that uses plus.

Matt Wilding

----
(note-lib "/slocal/src/nqthm-1992/examples/numbers/naturals" t)

(prove-lemma quotient-plus-times-cancel nil
  (implies
   (lessp 1 b)
   (equal (quotient (plus 1 (times b x)) (times b y)) (quotient x y)))
  ((disable plus-add1-arg1 plus)))

(prove-lemma quotient-add1-times2-fact nil
  (equal (quotient (add1 (times 2 a)) (times 2 b)) (quotient a b))
  ((use (quotient-plus-times-cancel (b 2) (x a) (y b)))))



From felty@research.att.com  Wed Dec 13 08:13:54 1995
Return-Path: <felty@research.att.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA08291; Wed, 13 Dec 95 08:13:54 CST
Received: from research.att.com (ns.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA25244; Wed, 13 Dec 95 08:13:50 CST
Received: from research by ns; Wed Dec 13 09:10:15 EST 1995
Received: by research.att.com; Wed Dec 13 09:10 EST 1995
Received: from lutece.research.att.com by hunny.research.att.com with smtp
	(Smail3.1.29.1 #2) id m0tPrtG-000d8VC; Wed, 13 Dec 95 09:10 EST
Received: by lutece.research.att.com (Smail3.1.29.1 #2)
	id m0tPrt8-003kG3C; Wed, 13 Dec 95 09:10 EST
Message-Id: <m0tPrt8-003kG3C@lutece.research.att.com>
Date: Wed, 13 Dec 95 09:10 EST
To: nqthm-users@cli.com
Subject: CADE-13 Second Call for Papers (text & LaTeX)
From: felty@research.att.com (Amy Felty)
Reply-To: cade-request@research.att.com

[This announcement is being sent to email lists.  Our apologies for
multiple copies.]


     The Thirteenth International Conference on Automated Deduction
     --------------------------------------------------------------

                            Rutgers University
                      New Brunswick, New Jersey, USA

                         30 July - 3 August, 1996

                     CADE-13:  Second Call for Papers

The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction. Original research
papers, descriptions of working reasoning systems, and problem sets
that provide innovative, challenging tests for automated reasoning
systems, are solicited.

CADE conferences cover all aspects of automated deduction:

  First vs. Higher Order Logics          Classical vs. Non-Classical Logics
  Special vs. General Purpose Inference  Interactive vs. Automatic Systems

Specific topics of interest include (but are not limited to):

    Resolution		Sequent Calculus        Decision Procedures
    Unification		Rewrite Rules           Mathematical Induction

and any applications of automated deduction, including:

    Deductive Databases         Logic and Functional Programming
    Commonsense Reasoning       Software and Hardware Development
    Distributed Theorem Proving Learning Search Heuristics

******************************************************************
** Papers on commercial or industrial applications of automated **
** deduction are especially encouraged.				**
******************************************************************

CADE-13 will be held as part of the Federated Logic Conference (FLoC'96)
to be held at Rutgers University from Saturday, July 27, to Saturday,
August 3. As well as CADE, other conferences participating in FLoC'96
will be CAV (Conference on Computer-Aided Verification), LICS (IEEE
Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications). The goal of FLoC is to battle
fragmentation of the technical community by bringing together synergetic
conferences that relate logic to computer science.

The Proceedings of CADE-13 will be published by Springer-Verlag in
their Lecture Notes in Artificial Intelligence Series. Research papers
should not exceed 15 (fifteen) proceedings pages. System descriptions
and problem sets should not exceed 5 (five) proceedings pages. Springer
style files should be used if possible. These can be obtained from
http://www.research.att.com/lics/FLoC.

The title page of the submission should include the name, address (with
email address if possible) and telephone number of each author. To
assist in the refereeing process, please indicate one or at most two of
the following areas into which your paper falls, or if it does not fall
into any of these areas, please specify the area into which it falls:

      LOGIC: first order, higher order, classical, non-classical,
      constructive, type theory, induction, modal, non-monotonic.

      MECHANISMS: resolution, matrix, sequent calculus, natural
      deduction, semantic tableau, rewrite rules, unification,
      decision procedures, tactics, meta-level, interactive,
      analogy.

      APPLICATIONS: mathematics, geometry, databases, logic
      programming, functional programming, software/hardware
      verification/transformation/synthesis/termination, commonsense
      reasoning, expert systems, learning.

Papers must be unpublished and not submitted for publication
elsewhere. Submissions which are late, too long, or which require
major revision, will not be considered.

The Program Committee may ask authors to furnish evidence of
scientific claims, eg computer programs, detailed proofs, or full
experimental data.

          +-----------------------------------------------+
          | Submission deadline: 12 January, 1996         |
          | Notification of acceptance: 20 March, 1996    |
          | Camera-ready copy due: 26 April, 1996         |
          +-----------------------------------------------+

Authors should send 4 (four) copies of their submission to the Program
Co-Chairs. Further information about the conference may be obtained
from the Local Arrangements Chair or at the CADE-13 world wide web
site: http://www.research.att.com/lics/FLoC.


      Program Co-Chairs                      Local Arrangements Chair

      Michael McRobbie & John Slaney         Amy Felty
      Centre for Information                 AT&T Bell Laboratories
      Science Research                       600 Mountain Avenue 
      The Australian National University     Murray Hill NJ 07974
      ACT 0200                               United States of America
      Australia

      Tel: [+61] 6-2492035                   Tel: [+1] 908-5824049 
      Fax: [+61] 6-2490747                   Email: cade13-la@cisr.anu.edu.au
      Email: cade13@cisr.anu.edu.au

                            Program Committee

O. Astrachan (Duke)                     J. Avenhaus (Kaiserslautern)
L. Bachmair (Stonybrook)                D. Basin (Max-Planck)
W. Bibel (Darmstadt)                    B. Buchberger (Linz)
F. Bry (Munich)                         R. Caferra (Grenoble)
K.S. Choi (KAIST)                       A. Cohn (Leeds)
L. Farinas del Cerro (Toulouse)         W. Farmer (MITRE)
A. Felty (AT&T Bell Labs)               M. Fitting (CUNY)
M. Fujita (MRI)                         S. Garland (MIT)
F. Giunchiglia (IRST)                   E. Gunter (AT&T Bell Labs)
R. Hasegawa (Kyushu)                    L. Henschen (North Western)
L. Hines (Texas)                        S. Hoelldobler (Dresden)
M. Kaufman (Motorola)                   A. Leitsch (Vienna)
E. Lusk (Argonne)                       U. Martin (St Andrews)
D. McAllester (MIT)                     W. McCune (Argonne)
H.-J. Ohlbach (Max-Planck)              J. Posegga (Karlsruhe)
W. Pase (ORA Canada)                    F. Pfenning (Carnegie Mellon)
F. Pirri (Rome)                         D. Plaisted (North Carolina)
U. Reddy (Illinois)                     M. Rusinowitch (INRIA)
K. Satoh (Hokkaido)                     J. Schumann (Munich)
C. Schwind (Marseille)                  N. Shankar (SRI)
J. Siekman (Saarbruecken)               A. Smaill (Edinburgh)
G. Smolka (Saarbruecken)                M. Stickel (SRI)
G. Sutcliffe (James Cook)               E. Tiden (Siemens)
A. Voronkov (Uppsala)                   L. Wallen (Oxford)
D. Wang (Grenoble)                      H. Zhang (Iowa)

-------------------------------------------------------------------------------

% For LaTeX2e use
\documentclass[a4paper]{article}
% if you have LaTeX2e and if you have "winning-logo.epsi" then 
% uncomment the following line.
%\usepackage{graphicx}
% else, for LaTeX 2.09 comment out the two lines above and uncomment:
% \documentstyle{article}
% Furthermore, if you do not have the file "winning-logo.epsi", 
% and if you do not have LaTeX2e comment out a line in the text 
% below, which contains "\includegraphics".

\addtolength{\topmargin}{-2cm}
\addtolength{\textheight}{3cm}
\addtolength{\textwidth}{4.2cm}
\addtolength{\oddsidemargin}{-2cm}

\font\logofont=cmbsy10 scaled 3000
\font\logofontt=cmtt10 scaled 3000

\def\cadeC{{\logofont\char'032}}
\def\cadeA{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'070}}}
\def\cadeD{{\logofont\char'033}}
\def\cadeE{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'071}}}
\def\cadeArrow{{\logofont\char'041}}
\def\cadetwlv{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 12}}}
\def\cadethrt{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 13}}}

%\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadetwlv}
\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadethrt}

\def\cadewww{{\tt http://www.research.att.com/lics/FLoC/cade13}}

\parskip=1ex plus0.3ex minus 0.3ex

\pagestyle{empty}

\begin{document}

% comment out the following "\includegraphics" line, if you do not
% have LaTeX2e and if you do not have the file "winning-logo.epsi".
%\noindent
%{\hskip-1.5cm{\vskip-2cm\hskip-1.5cm\includegraphics[scale=0.2]{winning-logo.epsi}}}

\begin{center}
\Large\bf
Thirteenth International Conference on Automated Deduction \\[1ex]
Rutgers University, New Brunswick, USA \\[1ex]
30 July--3 August, 1996

\vskip0.4cm
{\cadelogo}

\vskip0.4cm
\huge\bf SECOND CALL FOR PAPERS
\end{center}

\vskip0.5cm
\noindent 
The CADE conferences are the major forum for the presentation of
new research in all aspects of automated deduction.  Original
research papers, descriptions of working reasoning systems, and
problem sets that provide innovative, challenging tests for
automated reasoning systems, are solicited. 

\vskip0.25cm
CADE conferences cover all aspects of automated deduction:
\begin{center}
\begin{tabular}{ll}
First {\em vs.}\ Higher Order Logics &
Classical {\em vs.}\  Non-Classical Logics \\
Special {\em vs.}\  General Purpose Inference &
Interactive {\em vs.}\ Automatic Systems
\end{tabular}
\end{center}

Specific topics of interest include (but are not limited to):
\begin{center}
\begin{tabular}{lll}
Resolution & Sequent Calculus & Decision Procedures \\
Unification & Rewrite Rules & Mathematical Induction
\end{tabular}
\end{center}

and any applications of automated deduction, including:
\begin{center}
\begin{tabular}{ll}
Deductive Databases & Logic and Functional Programming \\
Commonsense Reasoning & Software and Hardware Development \\ 
Distributed Theorem Proving & Learning Search Heuristics
\end{tabular}
\end{center}

{\em Papers on commercial or industrial applications of automated deduction
are especially encouraged.}

\vskip0.25cm
CADE-13
will be held as part of the Federated Logic Conference (FLoC'96) to be
hosted by the Center for Discrete Mathematics and Computer Science
(DIMACS) at Rutgers University from
Saturday, 27 July to Saturday, 3 August.  As well as CADE, other
conferences participating in FLoC'96 will be CAV, (Conference on
Computer-Aided Verification), LICS (IEEE Symposium on Logic in Computer
Science), and RTA (Conference on Rewriting Techniques and
Applications). % The goal of FLoC is to battle fragmentation of the
%technical community by bringing together synergetic conferences that
%relate logic to computer science.

The Proceedings of CADE-13 will be published by Springer-Verlag in
their Lecture Notes in Artificial Intelligence Series.  Research 
papers should not exceed fifteen (15) proceedings pages.  System 
descriptions and problem sets should not exceed five (5) 
proceedings pages.  Springer style files should be used if possible. 
These can be obtained from 
\ \cadewww.

The title page of the submission should include the name, address
(with email address if possible) and telephone number of each author.
To assist in the refereeing process, please indicate one, or at most
two, of the following areas into which your paper falls or if it does
not fall into any of these areas, please specify the area into which
it does fall:

LOGIC:  first order, higher order, classical, non-classical,
constructive, type theory, induction, modal, non-monotic.

MECHANISMS:  resolution, matrix, sequent calculus, natural deduction,
semantic tableau, rewrite rules, unification, decision procedures,
tactics, meta-level, interactive, analogy.

APPLICATIONS:  mathematics, geometry, databases, logic programming,
functional programming, software/hardware
verification/transformation/synthesis/termination, commonsense
reasoning, expert systems, learning.

Papers must be unpublished and not submitted for publication elsewhere.
Submissions which are late, too long, or which require major revision,
will not be considered.

The Program Committee may ask authors to furnish evidence of
scientific claims, e.g. computer programs, detailed proofs, or full
experimental data.

\begin{center}
\framebox{\begin{tabular}{ll}
Submission deadline:          & 12 January, 1996 \\
Notification of acceptance:   & 20 March, 1996 \\
Camera-ready copy due:        & 26 April, 1996 \\
\end{tabular}}
\end{center}


Authors should send 4~(four) copies of their submission to the Program
Co-Chairs.  Further information about the conference may be obtained
from the Local Arrangements Chair or at the CADE-13 world wide web
site: \ \cadewww.

\begin{center}
\begin{tabular}{l@{\hspace{2em}}l}
\begin{tabular}[t]{l}
{\bf Program Co-Chairs\/}\\[1ex]
Michael McRobbie and John Slaney \\
Centre for Information Science Research \\
The Australian National University\\
ACT  0200 \\
Australia
\end{tabular}
&
\begin{tabular}[t]{l}
{\bf Local Arrangements Chair\/}\\[1ex]
Amy Felty\\
AT\&T Bell Laboratories \\
Room 2A-425 \\
600 Mountain Avenue \\
Murray Hill  NJ  07974  \\
United States of America \\

\end{tabular}\\
\hbox{}\\
\begin{tabular}[t]{l}
 Tel: [+61] 6-249-2035 \\
 Fax: [+61] 6-249-0747 \\
 Email: {\tt cade13}{\rm @}{\tt cisr.anu.edu.au}% 
\end{tabular}
&
\begin{tabular}[t]{l}
 Tel: [+1 ] 908-5824049 \\
 Fax: [+1 ] 908-5827550 \\
 Email: {\tt cade13-la}{\rm @}{\tt cisr.anu.edu.au}
\end{tabular}
\end{tabular}
\end{center}

\vskip0.5cm
\begin{center}
{\bf Program Committee\/}
\end{center}

\begin{center}
\begin{tabular}{lll}
O.~Astrachan (Duke)& J.~Avenhaus (Kaiserslautern)& L.~Bachmair (Stonybrook)\\
D.~Basin (Max-Planck)& W.~Bibel (Darmstadt)& B.~Buchberger (Linz)\\
F.~Bry (Munich)& R.~Caferra (Grenoble)& K.~S.~Choi (KAIST)\\
A.~Cohn (Leeds)& L.~Farinas del Cerro (Toulouse)& W.~Farmer (MITRE)\\
A.~Felty (AT\&T Bell Labs)& M.~Fitting (CUNY)& M.~Fujita (MRI)\\
S.~Garland (MIT)& F.~Giunchiglia (IRST)& E.~Gunter (AT\&T Bell Labs)\\
R.~Hasegawa (Kyushu)& L.~Henschen (North Western)& L.~Hines (Texas)\\
S.~H\"olldobler (Dresden)& M.~Kaufmann (Motorola)& A.~Leitsch (Vienna)\\
E.~Lusk (Argonne)& U.~Martin (St.~Andrews)& D.~McAllester (MIT)\\
W.~McCune (Argonne)& H.-J.~Ohlbach (Max-Planck)& J.~Posegga (Karlsruhe)\\
W.~Pase (ORA Canada)& F.~Pfenning (Carnegie Mellon)& F.~Pirri (Rome)\\
D.~Plaisted (North Carolina)& U.~Reddy (Illinois)& M.~Rusinowitch (INRIA)\\
K.~Satoh (Hokkaido)& J.~Schumann (Munich)&  C.~Schwind (Marseille)\\
N.~Shankar (SRI)& J.~Siekmann (Saarbr\"ucken)& A.~Smaill~(Edinburgh)\\
G.~Smolka~(Saarbr\"ucken)& M.~Stickel~(SRI)& G.~Sutcliffe (James Cook)\\
E.~Tiden (Siemens)& A.~Voronkov (Uppsala)& L.~Wallen (Oxford)\\
D.~Wang (Grenoble)& H.~Zhang (Iowa)& \\
\end{tabular}
\end{center}
\end{document}

From kepser@cis.uni-muenchen.de  Fri Dec 22 15:54:38 1995
Return-Path: <kepser@cis.uni-muenchen.de>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA12106; Fri, 22 Dec 95 15:54:38 CST
Received: from cis.uni-muenchen.de (thecube.cis.uni-muenchen.de) by cli.com (4.1/SMI-4.1)
	id AA16478; Fri, 22 Dec 95 15:53:44 CST
Received: (from kepser@localhost) by cis.uni-muenchen.de (8.7.3/8.7.2) id WAA04805 for nqthm-users@cli.com; Fri, 22 Dec 1995 22:53:41 +0100 (MET)
Date: Fri, 22 Dec 1995 22:53:41 +0100 (MET)
From: Stephan Kepser <kepser@cis.uni-muenchen.de>
Message-Id: <199512222153.WAA04805@cis.uni-muenchen.de>
To: nqthm-users@cli.com
Subject: Call for Participation FroCoS'96 (LaTeX)

% Our appologies if you receive multiple copies

% Call for Participation

% FroCoS'96

% Frontiers of Combining Systems

\documentstyle[a4]{article}

\pagestyle{empty}
\setlength{\headsep}{0in}
\setlength{\headheight}{0in}
\sloppy


\small

\newcommand{\next}{\newline\hspace*{4mm}}
\newcommand{\zero}{\makebox[0cm]{}}
\newcommand{\sbf}{\bf}

\newlength{\talktimelength}
\newlength{\talknamelength}
\settowidth{\talktimelength}{\sf{}00:000}
%\setlength{\talknamelength}{\textwidth}
\setlength{\talknamelength}{10.2cm}
\addtolength{\talknamelength}{-\talktimelength}
\newcommand{\talk}[3]%
{
%\zero\\
\noindent 
\parbox[t]{\talktimelength}{\sf #1}%
\parbox[t]{\talknamelength}{{\it #2} {#3}}
}

\newcommand{\sessionskip}{\vspace{1ex}}
\newcommand{\firsttalkskip}{\newline\vspace{-9pt}}

\begin{document}

% ******** TITLE PAGE *************

\unitlength1cm

\begin{picture}(9.8,21)
\framebox(12.8,21)[c]{
\begin{minipage}[h]{10.2cm}
\begin{center}
{Call for Participation \& Preliminary Program}\\[3mm]
{\large\bf First International Workshop}\\[3mm]
{\Large\bf Frontiers of Combining Systems}\\[5mm]
{\huge\bf FroCoS'96}\\[3mm]
\makebox[1mm]{}\\
{\bf March 26-29, 1996}\\
{\bf University of Munich, Germany}\\[1.0in]

\vskip 4cm
{\sf Organized by}\\[1mm]
{\sl Ludwig-Maximilians-Universit\"at M\"unchen}\\[6mm]

{\sf Sponsored by (December 1995)}\\[1mm]
{\sl M\"unchener Universit\"atsgesellschaft}\\
{\sl CIS}\\[6mm]

{\sf Hosted by}\\[1mm]
{\sl Ludwig-Maximilians-Universit\"at M\"unchen}\\[6mm]

\end{center}
\end{minipage}
}
\end{picture}

\newpage

% ************ FORMS ****************
\begin{picture}(9.8,21)
\framebox(12.8,21)[t]{
\begin{minipage}[h]{10.2cm}
\bigskip

\noindent
{\bf FroCoS'96  REGISTRATION FORM}\hfill\\
{\it Please type or print.}

\medskip
\noindent
Last Name\hrulefill\zero\\[1mm]
First Name\hrulefill\zero\\[1mm]
Affiliation\hrulefill\zero\\[1mm]
Street Address\hrulefill\zero\\[1mm]
\zero\hrulefill\zero\\[1mm]
City\hrulefill\zero \\[1mm]
State/Zip\hrulefill \\[1mm]
Country\hrulefill\zero  \\[1mm]
Phone(s)\hrulefill \\[1mm]
Fax\hrulefill \zero\\[1mm]
E-mail \hrulefill\zero\\[1mm]
Special dietary requirement \hrulefill\zero\\[1mm]

{\bf Registration rates.} \ \
The registration fee is DM 230.\hfill\\
All fees are in German currency.\hfill\\
(We are waiting for the decision of another potential sponsor. 
A positive decision would lead to a decreased registration fee. 
Please do not hesitate do complete your registration. If the registration fee 
can be decreased, we shall refund the difference.) \\[5mm]

\begin{tabular}{ll}
{\it Payment (tick one):} & $\Box$ Eurocheque, enclosed \\
                          & $\Box$ Bank Transfer (include copy)
\end{tabular}\\[1cm]

{\bf Accomodation.} \ \
A list of hotels (with prices, phone and fax numbers, location) is 
available under WWW at\hfill\\ 
{\tt http://www.cis.uni-muenchen.de/hot/frocos96.html} \\
Other arrangements can be made by contacting
\begin{verse}\sl
Munich Tourist Office\\
80313 M\"unchen\\
Germany\\
Tel: +49 89 233 0300 \\ 
Fax: +49 89 23 33 0233
\end{verse}


% END FORMS
\end{minipage}
}
\end{picture}

\newpage

\begin{picture}(9.8,21)
\framebox(12.8,21)[t]{
\begin{minipage}[h]{10.2cm}
\bigskip
\begin{center}
{\large\bf General Information}
\end{center}

\noindent{\sbf Workshop Office.} \ \ 
Please address registration form and inquiries to
%
\begin{verse}\sl
Klaus U. Schulz \\
CIS \\
Universit\"at M\"unchen\\
Wagm\"ullerstr. 23\\
80538 M\"unchen\\
Germany\\
Email: {\tt frocos@cis.uni-muenchen.de} \\
{\small {\tt http://www.cis.uni-muenchen.de/hot/frocos96.html}} \\
Tel: +49 89 211 0667 \\
Fax: +49 89 211 0674
\end{verse}

\medskip


{\sbf Registration.} \ \ The registration form should be sent to the
workshop office. Registration without payment will not be considered.  Fees will be
returned in full for any written cancellation received before February, 15. No
refund will be made after this date.

The registration fee (230 DM) includes workshop participation, the
proceedings published by Kluwers, coffee breaks, the welcome reception 
with light buffet, and the conference dinner.\\

Payment must be in German currency, and can be made by crossed Eurocheque
payable to ``Prof.\ Klaus U. Schulz'', or by bank transfer to:\\[3mm]

\begin{tabular}{ll}
Bank: & Stadtsparkasse M\"unchen \\
Bank code: & 701 500 00 \\
Account no: & 83-192179 \\
Account holder: & Prof.\ Klaus U. Schulz\\
Intended use: & Registration Fee FroCoS'96\\[4mm]
\end{tabular}

SWIFT code is SSKM DE MM. Bank transfers should specify registrant's name.
{\bf Please make sure that the transfer is arranged free of charges to the
  beneficiary!}\\

\end{minipage}
}
\end{picture}

\newpage

\begin{picture}(9.8,21)
\framebox(12.8,21)[t]{
\begin{minipage}[h]{10.2cm}
\bigskip

\begin{center}
{\large\bf Travel Information}
\end{center}
 Munich is located in the heart of Bavaria, at the
south-east corner of Germany. The city is home to 1.3 million
people, and has excellent museums, concert halls, restaurants, 
and two football clubs in the first division. Munich is close
to the Bavarian Alps and Austria.  The weather in March is unpredictable,  
temperatures below $0^{\circ}$C are not unusual, but also temperatures 
around $20^{\circ}$C are possible.\\ 
Munich offers superb access by air, rail, and road. Munich
International Airport has frequent flights to and from all major
cities. A local train (``S-Bahn'') connects the airport with the 
city. By rail, the city offers easy access to all major European
centres.\\[0.2cm] 
\begin{center}
{\large\bf Workshop Location}
\end{center}
The workshop (registration, welcome reception, talks, coffee breaks) 
will take place in \\
\begin{center}
Room E 07\\
Schellingstr. 3\\
(Front building)\\
M\"unchen\\
\end{center}
The building Schellingstr. 3  is close to exit ``Universit\"at'' 
of underground lines U3 and U6 ($<$ 100m).\\[0.6cm] 

% ************ PROGRAM **************

\begin{center}
{\Large\bf Workshop Program}
\end{center}
Abstracts of all talks will be available under WWW at\\ 
{\tt http://www.cis.uni-muenchen.de/hot/frocos96.html} \\
Participants will receive a printed copy.\\[0.5cm] 
\begin{center}
{\sf TUESDAY, March 26}
\end{center}

{\bf Registration} {\sf \hfill (16:00--18:00)}

\sessionskip

{\bf Welcome Reception (Light Buffet)} {\sf \hfill (17:00--19:00)}

\medskip



\end{minipage}
}

\end{picture}

\newpage



\begin{picture}(9.8,21)
%\framebox(9.8,21)[t]{
\framebox(12.8,21)[t]{
\begin{minipage}[h]{10.2cm}
\bigskip


\begin{center}
{\sf WEDNESDAY, March 27}
\end{center}

{\bf Registration} \hfill {\sf  (8:30--9:00)}

\sessionskip

{\bf Welcome} \hfill {\sf (9:00--9:15)}

\sessionskip

{\bf Invited Talk} \hfill {\sf (9:15--10:15)}
\talk{\ }
{Combination of Logics}
{\\ Dov M. Gabbay (London)}
\begin{center}
Coffee break
\end{center}
{\bf Session 1: Combination of Logics} \hfill {\sf (10:45--12:15)}
\talk{10:45}%
{Generalizing Propositional Modal Logic\\  Using Labelled Deductive Systems} 
{\\ Alessandra Russo (London)} %
\talk{11:15}%
{A Topography of Labelled Modal Logics}
{\\ David Basin, Se\'an Matthews,  Luca Vigan\`o (Saarbr\"ucken)}
\talk{11:45}%
{Combining Classical and Intuitionistic Logic, or:\\
 Intuitionistic Implication as a Conditional} 
{\\ Luis Fari\~nas del Cerro, Andreas Herzig (Toulouse)} 
%
%
\begin{center}
\rule{10.2cm}{.2mm}\\ 
{\bf Lunch} {\sf (12:15--14:00)}\\ 
\rule{10.2cm}{.2mm}\\
\end{center}
%
%
{\bf Invited Talk} \hfill {\sf (14:00--15:00)}
\talk{\ }
{Theory Resolution: Problems and Promise}
{\\ Mark E. Stickel (SRI)}

\sessionskip

{\bf Session 2: Automated Deduction I}
\mbox{} \hfill {\sf (15:00--16:00)}
\talk{15:00}%
{An Improved Version of the  Nelson-Oppen\\ Combination Procedure}
{\\ Cesare Tinelli,  Mehdi Harandi (Urbana)}
\talk{15:30}%
{Cooperation of Decision Procedures for the \\ Satisfiability Problem}
{\\ Christophe Ringeissen (Nancy)}
\begin{center}
Coffee break
\end{center}
{\bf Session 3: Automated Deduction II} \hfill {\sf (16:30--18:00)}
\talk{16:30}%
{Combining Model Generation with Theorem Proving:\\ Problems and Prospects}
{\\ John Slaney, Timothy J. Surendonk (Canberra)}
\talk{17:00}%
{Reasoning Theories -- Towards an Architecture for \\ Open Mechanized Reasoning Systems}
{\\ Fausto Giunchiglia (Trento),  Paolo Pecchiari (Genova), \\ Carolyn Talcott (Stanford)}
\talk{17:30}%
{Natural Language Representation and Combination\\ of Automatically Generated Proofs}
{\\ Bernd I. Dahn (Berlin), Andreas Wolf (M\"unchen)}

\end{minipage}
}

\end{picture}

\newpage
\begin{picture}(9.8,21)
\framebox(12.8,21)[t]{
\begin{minipage}[h]{10.2cm}
\bigskip

\begin{center}
{\sf THURSDAY, March 28}
\end{center}

\sessionskip
\noindent
{\bf Invited Talk} \hfill {\sf (9:00--10:00)}
\talk{\ }
{Symbolic Computation: Algebra plus Proving}
{\\ Bruno Buchberger (Linz)}
\begin{center}
Coffee break
\end{center}
{\bf Session 4: Coordination Models}
\mbox{} \hfill {\sf (10:30--12:00)}
\talk{10:30}%
{Classification of Communication and Cooperation\\  
Mechanisms for Logical and Symbolic\\ Computation Systems}
{\\ Jacques Calmet, Karsten Homann (Karlsruhe)}
\talk{11:00}%
{Logic Tuple Spaces for the Coordination of \\ Heterogeneous Agents}
{\\ Enrico Denti, Antonio Natali,  Andrea Omicini,\\ Marco Venuti (Bologna)}
\talk{11:30}%
{Integration Systems and Interaction Spaces}
{\\ Christopher Landauer (Herndon),\\ Kirstie L. Bellman (Arlington)}
\begin{center}
\rule{10.2cm}{.2mm}\\ 
{\bf Lunch} {\sf (12:00--14:00)}\\ 
\rule{10.2cm}{.2mm}\\
\end{center}
{\bf Invited Talk} \hfill {\sf (14:00--15:00)}
\talk{\ }
{Mixing Constraint Domains: The Prolog IV Case}
{\\ Alain Colmerauer (Marseille)}

\sessionskip

{\bf Session 5: CLP I}
\mbox{} \hfill {\sf (15:00--16:00)}
\talk{15:00}%
{Combining Constraint Solvers in a \\ Meta CLP Architecture}
{\\ Evelina Lamma, Michela Milano (Bologna), \\ Paolo Mello (Bari)}
\talk{15:30}%
{Membership-Constraints and Complexity \\ in Logic Programming with Sets}
{\\ Frieder Stolzenburg (Koblenz)}
\begin{center}
Coffee break
\end{center}
{\bf Session 6: CLP II} \hfill {\sf (16:30--17:30)}
\talk{16:30}%
{Integrating Lists, Multisets, and Sets \\ in a Logic Programming Framework}
{\\ Agostino Dovier (Pisa), Alberto Policriti (Udine), \\ Gianfranco Rossi (Parma)}
\talk{17:00}%
{CLP($\chi$) for Proving Program Properties}
{\\ Fred Mesnard, S\'ebastien Hoarau, \\ Alexandra Maillard (Saint-Denis)}

\sessionskip

\noindent
{\bf Conference Dinner} \hfill {\sf (19:30)}
\noindent

\end{minipage}
}
\end{picture}

\newpage

\begin{picture}(9.8,21)
\framebox(12.8,21)[t]{
\begin{minipage}[h]{10.2cm}
\bigskip


\begin{center}
{\sf FRIDAY, September 9}
\end{center}

\sessionskip
\noindent
{\bf Invited Talk} \hfill {\sf (9:30--10:30)}
\talk{\ }%
{Evolving Algebras: from Theoretical Foundations\\  to Applied Systems Analysis}
{\\ Uwe Gl\"asser (Paderborn)}
\begin{center}
Coffee break
\end{center}
{\bf Session 7:} \hfill {\sf (11:00--12:30)}
\talk{11:00}%
{First-order Constrained Lambda Calculus}
{\\ John N. Crossley (Clayton), Luis Mandel, \\ Martin Wirsing (M\"unchen)}
\talk{11:30}%
{Unified Relational Framework for \\ Programming Paradigms Combination}
{\\ N. Habra, B. Le Charlier (Namur)}
\talk{12:00}%
{ACTL Constrained Processes}
{\\ Xiao Jun Chen (Roma)}

\sessionskip

\begin{center}
\rule{10.2cm}{.2mm}\\ 
{\bf End of FroCoS'96}\\ 
\rule{10.2cm}{.2mm}\\
\end{center}



\end{minipage}
}
\end{picture}
\newpage

\begin{picture}(9.8,21)
\framebox(12.8,21)[t]{
\begin{minipage}[h]{10.2cm}
\bigskip




\noindent
\begin{flushleft}
{\bf Local Organization:} {\rm S.~Kepser, K.U.~Schulz}\\[1.7mm]
{\bf Program Chair:} {\rm F.~Baader, K.U.~Schulz}\\[1.7mm]
{\bf Program Committee:}
F.~Baader, P.~Baumgartner, P.~Blackburn, A.~Bockmayr, A.~Boudet, J.~Calmet, A.~Colmerauer, D.M.~Gabbay, 
H.~Kirchner, H.J.~Ohlbach, J.~Pfalzgraf, M.~de Rijke, W.~Rounds, M.~Schmidt-Schau{\ss}, K.U.~Schulz.
 \\[1mm]
\end{flushleft}
\vskip 4.7cm
\end{minipage}
}
\end{picture}

\end{document}

From ppregler@risc.uni-linz.ac.at  Thu Jan  4 14:31:57 1996
Return-Path: <ppregler@risc.uni-linz.ac.at>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA17242; Thu, 4 Jan 96 14:31:57 CST
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Received: from melmac.risc.uni-linz.ac.at by cli.com (4.1/SMI-4.1)
	id AA18166; Thu, 4 Jan 96 14:31:51 CST
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Received: by melmac.risc.uni-linz.ac.at id AA22122
  (5.67b8/IDA-1.5 for nqthm-users@cli.com); Thu, 4 Jan 1996 21:32:41 +0100
Date: Thu, 4 Jan 1996 21:32:41 +0100
Message-Id: <199601042032.AA22122@melmac.risc.uni-linz.ac.at>
To: nqthm-users@cli.com
From: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Reply-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Subject: First CFP AISMC-3

First Call for Papers for the Third International Conference on 

 Artificial Intelligence and Symbolic Mathematical Computation

                           (AISMC-3)

           Steyr -- Austria (September 23-25, 1996)



The international conference AISMC-3 continues the successful events
AISMC-1, organised by Jacques Calmet (Karlsruhe 1992) and AISMC-2,
organised by John A. Campbell (Cambridge, UK, 1994).  The AISMC 
initiative is an interdisciplinary forum bringing people from
different areas of research and application fields together with
emphasis on the interaction of methods and problem solving approaches
from AI and symbolic mathematical computation. 

A broad, new branch will be incorporated and sponsored in AISMC now, 
namely ``Engineering and Industrial Applications'' with corresponding 
invited programme committee members.  Besides that, persons from
science management have confirmed to participate actively.

AISMC-3 will be organised by RISC-Linz, Johannes Kepler University Linz,
Austria.

Areas of interest for the conference are the wide field of AI methods 
and symbolic mathematical computation, and applications in engineering 
and industry.


Suggestion: 
DISCO '96 (Design and Implementation of Symbolic Computation Systems) will
be held in Karlsruhe, Germany, from September 18-20; participation at both
conferences is easily possible: the weekend in-between would lend itself
to trips and sightseeing.


Steering Committee: 
J. Calmet (Karlsruhe), J.A. Campbell (London) and J. Pfalzgraf (Linz, 
Conference Chair).


Programme Committee:
L.Aiello (Rome)          F. Arlabosse (Paris)       B. Buchberger (Linz)
G. Butler (Montreal)     R. Caferra (Grenoble)      J. Calmet (Karlsruhe)
J.A. Campbell (London)   H. Clausen (Salzburg)      A.M. Cohen (Eindhoven)
J. Cunningham (London)   J. Geiger (Munich)         R. Goebl (Vienna)
K. Hingerl (Steyr)       D. Kapur (Albany, NY)      L. Kerschberg (Fairfax, VA)
H. Kobayashi (Tokyo)     R. Leisen (Bonn)           A. Miola (Rome)
E. Orlowska (Warsaw)     J. Pfalzgraf (Linz, Chair) F. Pfenning (Pittsburgh)
G. Reinhart (Munich)     M. Rigg (Bracknell)        W. Roque (Porto Alegre) 
J. Rosicky (Brno)        E. Sandewall (Linkoping)   K.U. Schulz (Munich)
A. Semenov (Novosibirsk) T. Takeshima (Shizuoka)    T. Wilson (Ithaca, NY) 


Invited Speakers:
A. Cohn (Leeds), R. Dillmann (Karlsruhe), D.S. Scott (Pittsburgh), 
D. Wang (Grenoble).


Local Organisation:
M. Schleicher, V. Sofronie, K. Stokkermans (email: aismc3@risc.uni-linz.ac.at).


Deadline for submission:     March 15, 1996
Notification of acceptance:  May 15, 1996
Final version due:           June 20, 1996


Submission of Papers: Authors are invited to submit papers up to 15 pages in
English.  The affiliation of the authors, including email address or a telefax
number should be given.  Submission can be made by electronic mail in LaTeX
format.  Results must be unpublished and not submitted for publication 
elsewhere.  Previous proceedings have appeared as Springer LNCS 737 and 958.
Proceedings of AISMC-3 will appear in the same series.  Send four copies of
a complete paper to the following address: 

Jochen Pfalzgraf, 
RISC-Linz, 
Johannes Kepler University Linz,
A-4040 Linz,
Austria, 
email: aismc3@risc.uni-linz.ac.at


=================== cut here for LaTeX file =================================
\documentstyle[11pt,epsf]{article}   
\textwidth 16.5cm          
\textheight 26cm
\topmargin -10mm
\evensidemargin 2mm
\oddsidemargin -2mm
\parindent 0em
\pagestyle{empty}

\begin{document}

\fbox{\shortstack{ $\mbox{}$ \\
First Call for Papers for the Third International Conference on 
\\
{\Large \bf Artificial Intelligence and Symbolic Mathematical Computation}
\\
{\Large \bf (AISMC-3)}
\\
{\sf Steyr -- Austria, September 23-25, 1996}
\\
$\mbox{}$
}}

\medskip

\noindent
The international conference AISMC-3 continues the successful events
AISMC-1, organised by Jacques Calmet (Karlsruhe 1992) and AISMC-2,
organised by John A.~Campbell (Cambridge, UK, 1994).  The AISMC 
initiative is an interdisciplinary forum bringing people from
different areas of research and application fields together with
emphasis on the interaction of methods and problem solving approaches
from AI and symbolic mathematical computation. 

\noindent
A broad, new branch will be incorporated and sponsored in AISMC now, namely
``Engineering and Industrial Applications'' with corresponding invited
programme committee members. 
Besides that, persons from science management have confirmed to participate
actively.

\noindent
AISMC-3 will be organised by RISC-Linz, Johannes Kepler University Linz,
Austria.

\noindent
Areas of interest for the conference are the wide field of AI methods and
symbolic mathematical computation, and applications in engineering and
industry.


\noindent
{\sf Suggestion}: 
DISCO '96 
(Design and Implementation of Symbolic Computation
Systems) will be held in Karlsruhe, Germany, from September 18-20;
participation at both conferences is easily
possible:
the weekend in-between would lend itself to trips and sightseeing.

\medskip

\noindent
{\bf Steering Committee:} 

\noindent
\begin{tabular}{lll}
J.~Calmet (Karlsruhe)  & J.A.~Campbell (London) & 
J.~Pfalzgraf (Linz, Conference Chair) \\
\end{tabular}

\noindent
{\bf Programme Committee:} 

\noindent
\begin{tabular}{lll}
L.~Aiello (Rome) &
F.~Arlabosse (Paris) &
B.~Buchberger (Linz) \\
G.~Butler (Montreal) & R.~Caferra (Grenoble) &
J.~Calmet (Karlsruhe) \\
J.A.~Campbell (London) & H.~Clausen (Salzburg) &
A.M.~Cohen (Eindhoven) \\
J.~Cunningham (London) & J.~Geiger (Munich) &
R.~Goebl (Vienna) \\ K.~Hingerl (Steyr) &
D.~Kapur (Albany, NY) & L.~Kerschberg (Fairfax, VA) \\
H.~Kobayashi (Tokyo) & R.~Leisen (Bonn) &
A.~Miola (Rome) \\ E.~Orlowska (Warsaw) & J.~Pfalzgraf (Linz, Chair) &
F.~Pfenning (Pittsburgh, PA) \\ G.~Reinhart (Munich) &
M.~Rigg (Bracknell) & W.~Roque (Porto Alegre) \\
J.~Rosicky (Brno) & E.~Sandewall (Link\"oping) &
K.U.~Schulz (Munich) \\ A.~Semenov (Novosibirsk) &
T.~Takeshima (Shizuoka) & T.~Wilson (Ithaca, NY) \\
\end{tabular}


\medskip

\noindent
{\bf Invited Speakers:} A.~Cohn (U Leeds),
R.~Dillmann (U Karlsruhe), D.S.~Scott (Carnegie Mellon, Pittsburgh),
D.~Wang (IMAG Grenoble)

\medskip

\noindent
{\bf Local Organisation:}\\
M.~Schleicher, V.~Sofronie, K.~Stokkermans
(email: {\tt aismc3@risc.uni-linz.ac.at}).


\medskip

\noindent
{\bf Deadline for submission:}  March 15, 1996

\noindent
{\bf Notification of acceptance:}  May 15, 1996

\noindent
{\bf Final version due:} June 20, 1996

\medskip

\noindent
{\bf Submission of Papers:} Authors are invited to submit papers up to
15 pages in English.  The affiliation of the authors, including email
address or a telefax number should be given.  Submission can be made by
electronic mail in \LaTeX format.  Results must be unpublished and not
submitted for publication elsewhere.  
Previous proceedings have appeared as Springer LNCS 737 and 958.
Proceedings of AISMC-3 will appear in the same series.
Send four copies of a complete
paper to the following address: 

\smallskip
\noindent
{\sf Jochen Pfalzgraf, 
RISC-Linz, 
Johannes Kepler University Linz,
A-4040 Linz,
Austria}, \\
email: {\tt aismc3@risc.uni-linz.ac.at}
\end{document}

From kepser@cis.uni-muenchen.de  Tue Jan 16 16:06:37 1996
Return-Path: <kepser@cis.uni-muenchen.de>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA01244; Tue, 16 Jan 96 16:06:37 CST
Received: from cis.uni-muenchen.de (thecube.cis.uni-muenchen.de) by cli.com (4.1/SMI-4.1)
	id AA13337; Tue, 16 Jan 96 15:59:14 CST
Received: (from kepser@localhost) by cis.uni-muenchen.de (8.7.3/8.7.2) id WAA23845 for nqthm-users@cli.com; Tue, 16 Jan 1996 22:58:46 +0100 (MET)
Date: Tue, 16 Jan 1996 22:58:46 +0100 (MET)
From: Stephan Kepser <kepser@cis.uni-muenchen.de>
Message-Id: <199601162158.WAA23845@cis.uni-muenchen.de>
To: nqthm-users@cli.com
Subject: CfParticipation  FroCoS'96


                       Call for Participation

                    First International Workshop

                 ``Frontiers of Combining Systems''
                             FroCoS'96

                 March 26-29, 1996, Munich, Germany.


Information and Program in the WWW:
  http://www.cis.uni-muenchen.de/hot/frocos96.thml


In various areas of logic, computation, language processing, and
artificial intelligence there is an obvious need for using specialized
formalisms and inference mechanisms for special tasks. In order to be
usable in practice, these specialized systems must be combined with
each other, and they must be integrated into general purpose systems.
The development of general techniques for the combination and
integration of special systems has been initiated in many areas,
and the Workshop ``Frontiers of Combining Systems'' intends to offer a
common forum for these research activities. Furthermore, it gives the
possibility to present results on particular instances of combination
and integration, and on their practical use.

Topics of the workshop are:

 * combination of logics (e.g., modal logics, logics in AI, ...)

 * combination of constraint solving techniques  
     (unification and matching algorithms, general symbolic
      constraints, numerical constraints, ...)
     and combination of decision procedures

 * integration of equational and other theories into deductive systems
     (e.g. theory resolution, constraint resolution, constraint
      paramodulation, ...)

 * combination of term rewriting systems

 * integration of data structures (e.g., sets, multisets, lists) into
     CLP formalisms and deduction processes

 * hybrid systems in computational linguistics, knowledge representation,
     natural language semantics, and human computer interaction

 * logic modelling of multi-agent systems.


Invited Speakers:

A. Colmerauer, D. Gabbay, U. Glaesser, M. Stickel


Program Committee:

F. Baader, P. Baumgartner, P. Blackburn, A. Bockmayr, A. Boudet,
J. Calmet, A. Colmerauer, D.M. Gabbay, H. Kirchner, H.J. Ohlbach,
J. Pfalzgraf, M. de Rijke, W. Rounds, M. Schmidt-Schauss,
K.U. Schulz. 


Program Chair:

F. Baader  &  K.U. Schulz.


Local Organization:

K.U. Schulz, 
CIS, University of Munich, 
Wagmuellerstr. 23, 
D-80538 Muenchen, 
Germany
E-mail: schulz@cis.uni-muenchen.de


From kepser@cis.uni-muenchen.de  Tue Jan 23 16:08:18 1996
Return-Path: <kepser@cis.uni-muenchen.de>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA04216; Tue, 23 Jan 96 16:08:18 CST
Received: from cis.uni-muenchen.de (thecube.cis.uni-muenchen.de) by cli.com (4.1/SMI-4.1)
	id AA02303; Tue, 23 Jan 96 16:07:43 CST
Received: (from kepser@localhost) by cis.uni-muenchen.de (8.7.3/8.7.2) id XAA15952 for nqthm-users@cli.com; Tue, 23 Jan 1996 23:07:40 +0100 (MET)
Date: Tue, 23 Jan 1996 23:07:40 +0100 (MET)
From: Stephan Kepser <kepser@cis.uni-muenchen.de>
Message-Id: <199601232207.XAA15952@cis.uni-muenchen.de>
To: nqthm-users@cli.com
Subject: CORRECTED Call  FroCoS'96


			    CORRECTED

                       Call for Participation

                    First International Workshop

                 ``Frontiers of Combining Systems''
                             FroCoS'96

                 March 26-29, 1996, Munich, Germany.


Information and Program in the WWW:
  http://ww-lti.informatik.rwth-aachen.de/~stephan/frocos96.html

  (http://www.cis.uni-muenchen.de/hot/frocos96.html)


Due to serious problems with the net, the originally mentioned WWW
address may be unreachable. Please use the first one stated above.

Also, for some obscure reason the list of invited speakers was
incomplete. It should read instead.

Invited Speakers:

B. Buchberger, A. Colmerauer, D. Gabbay, U. Glaesser, M. Stickel


Sorry for this inconvenience. 

Stephan Kepser

From kstokker@risc.uni-linz.ac.at  Fri Feb  2 10:17:34 1996
Return-Path: <kstokker@risc.uni-linz.ac.at>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA08578; Fri, 2 Feb 96 10:17:34 CST
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Received: from melmac.risc.uni-linz.ac.at by cli.com (4.1/SMI-4.1)
	id AA24148; Fri, 2 Feb 96 10:16:42 CST
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Received: by melmac.risc.uni-linz.ac.at id AA17149
  (5.67b8/IDA-1.5 for nqthm-users@cli.com); Fri, 2 Feb 1996 17:16:10 +0100
Date: Fri, 2 Feb 1996 17:16:10 +0100
Message-Id: <199602021616.AA17149@melmac.risc.uni-linz.ac.at>
To: nqthm-users@cli.com
From: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Reply-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Subject: Second CFP AISMC-3

Second Call for Papers for the Third International Conference on 

 Artificial Intelligence and Symbolic Mathematical Computation

                           (AISMC-3)

           Steyr -- Austria (September 23-25, 1996)



The international conference AISMC-3 continues the successful events
AISMC-1, organised by Jacques Calmet (Karlsruhe 1992) and AISMC-2,
organised by John A. Campbell (Cambridge, UK, 1994).  The AISMC 
initiative is an interdisciplinary forum bringing people from
different areas of research and application fields together with
emphasis on the interaction of methods and problem solving approaches
from AI and symbolic mathematical computation. 

A broad, new branch will be incorporated and sponsored in AISMC now, 
namely ``Engineering and Industrial Applications'' with corresponding 
invited programme committee members.  Besides that, persons from
science management have confirmed to participate actively.

AISMC-3 will be organised by RISC-Linz, Johannes Kepler University Linz,
Austria.

Areas of interest for the conference are the wide field of AI methods 
and symbolic mathematical computation, and applications in engineering 
and industry.


Suggestion: 
DISCO '96 (Design and Implementation of Symbolic Computation Systems) will
be held in Karlsruhe, Germany, from September 18-20; participation at both
conferences is easily possible: the weekend in-between would lend itself
to trips and sightseeing.


Steering Committee: 
J. Calmet (Karlsruhe), J.A. Campbell (London) and J. Pfalzgraf (Linz, 
Conference Chair).


Programme Committee:
L.Aiello (Rome)          F. Arlabosse (Paris)       B. Buchberger (Linz)
G. Butler (Montreal)     R. Caferra (Grenoble)      J. Calmet (Karlsruhe)
J.A. Campbell (London)   H. Clausen (Salzburg)      A.M. Cohen (Eindhoven)
J. Cunningham (London)   J. Geiger (Munich)         R. Goebl (Vienna)
K. Hingerl (Steyr)       D. Kapur (Albany, NY)      L. Kerschberg (Fairfax, VA)
H. Kobayashi (Tokyo)     R. Leisen (Bonn)           A. Miola (Rome)
E. Orlowska (Warsaw)     J. Pfalzgraf (Linz, Chair) F. Pfenning (Pittsburgh)
G. Reinhart (Munich)     M. Rigg (Bracknell)        W. Roque (Porto Alegre) 
J. Rosicky (Brno)        E. Sandewall (Linkoping)   K.U. Schulz (Munich)
A. Semenov (Novosibirsk) T. Takeshima (Shizuoka)    T. Wilson (Ithaca, NY) 


Invited Speakers:
A. Cohn (Leeds), R. Dillmann (Karlsruhe), D.S. Scott (Pittsburgh), 
D. Wang (Grenoble).


Local Organisation:
M. Schleicher, V. Sofronie, K. Stokkermans (email: aismc3@risc.uni-linz.ac.at).
URL: http://info.risc.uni-linz.ac.at:70/0/labs-info/catlab/aismc-3.html


Deadline for submission:     March 15, 1996
Notification of acceptance:  May 15, 1996
Final version due:           June 20, 1996


Submission of Papers: Authors are invited to submit papers up to 15 pages in
English.  The affiliation of the authors, including email address or a telefax
number should be given.  Submission can be made by electronic mail in LaTeX
format.  Results must be unpublished and not submitted for publication 
elsewhere.  Previous proceedings have appeared as Springer LNCS 737 and 958.
Proceedings of AISMC-3 will appear in the same series.  Send four copies of
a complete paper to the following address: 

Jochen Pfalzgraf, 
RISC-Linz, 
Johannes Kepler University Linz,
A-4040 Linz,
Austria, 
email: aismc3@risc.uni-linz.ac.at


=================== cut here for LaTeX file =================================

\documentstyle[11pt,epsf]{article}   
\textwidth 16.5cm          
\textheight 26cm
\topmargin -10mm
\evensidemargin 2mm
\oddsidemargin -2mm
\parindent 0em
\pagestyle{empty}

\begin{document}

\fbox{\shortstack{ $\mbox{}$ \\
Second Call for Papers for the Third International Conference on 
\\
{\Large \bf Artificial Intelligence and Symbolic Mathematical Computation}
\\
{\Large \bf (AISMC-3)}
\\
{\sf Steyr -- Austria, September 23-25, 1996}
\\
$\mbox{}$
}}

\medskip

\noindent
The international conference AISMC-3 continues the successful events
AISMC-1, organised by Jacques Calmet (Karlsruhe 1992) and AISMC-2,
organised by John A.~Campbell (Cambridge, UK, 1994).  The AISMC 
initiative is an interdisciplinary forum bringing people from
different areas of research and application fields together with
emphasis on the interaction of methods and problem solving approaches
from AI and symbolic mathematical computation. 

\noindent
A broa
``Engineering and Industrial Applications'' with corresponding invited
programme committee members. 
Besides that, persons from science management have confirmed to participate
actively.

\noindent
AISMC-3 will be organised by RISC-Linz, Johannes Kepler University Linz,
Austria.

\noindent
Areas of interest for the conference are the wide field of AI methods and
symbolic mathematical computation, and applications in engineering and
industry.


\noindent
{\sf Suggestion}: 
DISCO '96 
(Design and Implementation of Symbolic Computation
Systems) will be held in Karlsruhe, Germany, from September 18-20;
participation at both conferences is easily
possible:
the weekend in-between would lend itself to trips and sightseeing.

\medskip

\noindent
{\bf Steering Committee:} 

\noindent
\begin{tabular}{lll}
J.~Calmet (Karlsruhe)  & J.A.~Campbell (London) & 
J.~Pfalzgraf (Linz, Conference Chair) \\
\end{tabular}

\noindent
{\bf Programme Committee:} 

\noindent
\begin{tabular}{lll}
L.~Aiello (Rome) &
F.~Arlabosse (Paris) &
B.~Buchberger (Linz) \\
G.~Butler (Montreal) & R.~Caferra (Grenoble) &
J.~Calmet (Karlsruhe) \\
J.A.~Campbell (London) & H.~Clausen (Salzburg) &
A.M.~Cohen (Eindhoven) \\
J.~Cunningham (London) & J.~Geiger (Munich) &
R.~Goebl (Vienna) \\ K.~Hingerl (Steyr) &
D.~Kapur (Albany, NY) & L.~Kerschberg (Fairfax, VA) \\
H.~Kobayashi (Tokyo) & R.~Leisen (Bonn) &
A.~Miola (Rome) \\ E.~Orlowska (Warsaw) & J.~Pfalzgraf (Linz, Chair) &
F.~Pfenning (Pittsburgh, PA) \\ G.~Reinhart (Munich) &
M.~Rigg (Bracknell) & W.~Roque (Porto Alegre) \\
J.~Rosicky (Brno) & E.~Sandewall (Link\"oping) &
K.U.~Schulz (Munich) \\ A.~Semenov (Novosibirsk) &
T.~Takeshima (Shizuoka) & T.~Wilson (Ithaca, NY) \\
\end{tabular}


\medskip

\noindent
{\bf Invited Speakers:} A.~Cohn (U Leeds),
R.~Dillmann (U Karlsruhe), D.S.~Scott (Carnegie Mellon, Pittsburgh),
D.~Wang (IMAG Grenoble)

\medskip

\noindent
{\bf Local Organisation:}\\
M.~Schleicher, V.~Sofronie, K.~Stokkermans
(email: {\tt aismc3@risc.uni-linz.ac.at}).

\noindent
URL: {\tt http://info.risc.uni-linz.ac.at:70/0/labs-info/catlab/aismc-3.html}

\medskip

\noindent
{\bf Deadline for submission:}  March 15, 1996

\noindent
{\bf Notification of acceptance:}  May 15, 1996

\noindent
{\bf Final version due:} June 20, 1996

\medskip

\noindent
{\bf Submission of Papers:} Authors are invited to submit papers up to
15 pages in English.  The affiliation of the authors, including email
address or a telefax number should be given.  Submission can be made by
electronic mail in \LaTeX format.  Results must be unpublished and not
submitted for publication elsewhere.  
Previous proceedings have appeared as Springer LNCS 737 and 958.
Proceedings of AISMC-3 will appear in the same series.
Send four copies of a complete
paper to the following address: 

\smallskip
\noindent
{\sf Jochen Pfalzgraf, 
RISC-Linz, 
Johannes Kepler University Linz,
A-4040 Linz,
Austria}, \\
email: {\tt aismc3@risc.uni-linz.ac.at}
\end{document}

From iglobe@ix.netcom.com  Sat Feb  3 12:28:30 1996
Return-Path: <iglobe@ix.netcom.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA09474; Sat, 3 Feb 96 12:28:30 CST
Received: from ix4.ix.netcom.com by cli.com (4.1/SMI-4.1)
	id AA14709; Sat, 3 Feb 96 12:28:27 CST
Received: from  by ix4.ix.netcom.com (8.6.12/SMI-4.1/Netcom)
	id KAA20684; Sat, 3 Feb 1996 10:26:22 -0800
Date: Sat, 3 Feb 1996 10:26:22 -0800
Message-Id: <199602031826.KAA20684@ix4.ix.netcom.com>
From: iglobe@ix.netcom.com (Robert Shatikian )
Subject: Complementery Investment Newsletter
To: bmw@rider.cactus.org
To: bong@lestat.compaq.com
To: bonsai@cms.cc.wayne.edu
To: mytery@introl.com
To: BosNet@cu23.crl.aecl.ca
To: bruins@cristal.umd.edu
To: nqthm-users@cli.com
To: bpm@andrew.cmu.edu
To: bras-net@cs.ucla.edu
To: multicast@arizona.edu
To: BTHS-ENews-L@cornell.edu
To: bugs-386bsd@ms.uky.edu
To: bx-talk@qiclab.scn.rain.com
Cc: Robert.Shatikain@trw.com
Mime-Version: 1.0
Content-Type: multipart/mixed;boundary="itdwmyyuaiagqtxhijyxwujobfieyr"


This is multipart MIME message.


--itdwmyyuaiagqtxhijyxwujobfieyr
Content-Type:text/plain; charset=US-ASCII; name="NCZ135E.TMP"

The attached document is in Word 6.0


--itdwmyyuaiagqtxhijyxwujobfieyr
Content-Type: application/octet-stream; name="glob_feb.dot"
Content-Transfer-Encoding:base64

0M8R4KGxGuEAAAAAAAAAAAAAAAAAAAAAOwADAP7/CQAGAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAA
EAAABQAAAAEAAAD+////AAAAAAEAAAD/////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////9S
AG8AbwB0ACAARQBuAHQAcgB5AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAFgAFAP//////////AwAAAAAJAgAAAAAAwAAAAAAAAEYAAAAAAAAAAAAAAACGq6Njm/G6
AQcAAADAAwAAAAAAAAEAQwBvAG0AcABPAGIAagAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAASAAIB////////////////AAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAGIAAAAAAAAAVwBvAHIAZABEAG8AYwB1AG0AZQBuAHQAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABoAAgH/////BAAAAP////8AAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAAAl0wAAAAAAABPAGIAagBlAGMAdABQAG8A
bwBsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFgABAQEAAAAC
AAAA/////wAAAAAAAAAAAAAAAAAAAAAAAAAAhtmhxeXwugGG2aHF5fC6AQAAAAAAAAAAAAAAAAIA
AAD9/////v///////////////v///xIAAAAGAAAA//////7///8LAAAADAAAAC4AAAD/////////
//////////////////7/////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
//////////////8vAAAAMAAAADEAAAAyAAAAOwAAADQAAAA1AAAANgAAADcAAAA4AAAAOQAAADoA
AABDAAAAPAAAAD0AAAA+AAAAPwAAAEAAAABBAAAAQgAAADMAAABEAAAARQAAAEYAAABHAAAASAAA
AEkAAABKAAAASwAAAEwAAABNAAAATgAAAE8AAABRAAAA/////wkAAAD/////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////BQBT
AHUAbQBtAGEAcgB5AEkAbgBmAG8AcgBtAGEAdABpAG8AbgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAACgAAgD///////////////8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC
AAAAIAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAP///////////////wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA////////////////AAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////////
//////8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABSAG8A
bwB0ACAARQBuAHQAcgB5AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAFgAFAP//////////AwAAAAAJAgAAAAAAwAAAAAAAAEYAAAAAAAAAAAAAAACGlu3yfPG6AQ8A
AADAAwAAAAAAAAEAQwBvAG0AcABPAGIAagAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAASAAIB////////////////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAGIAAAAAAAAAVwBvAHIAZABEAG8AYwB1AG0AZQBuAHQAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABoAAgH/////BAAAAP////8AAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAWEsAAAAAAABPAGIAagBlAGMAdABQAG8AbwBs
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFgABAQEAAAACAAAA
/////wAAAAAAAAAAAAAAAAAAAAAAAAAAhtmhxeXwugGG2aHF5fC6AQAAAAAAAAAAAAAAAP//////
/////////wgAAAD9/////////////////////v/////////////////////////+////EgAAAA4A
AAARAAAAEwAAAP7///8UAAAAFQAAABYAAAAXAAAAGAAAADsAAAAaAAAAGwAAABwAAAAdAAAAHgAA
AB8AAAAgAAAAIQAAACIAAAAjAAAAJAAAACUAAAAmAAAAJwAAACgAAAApAAAAKgAAACsAAAAsAAAA
LQAAAFAAAAD/////////////////////////////////////////////////////////////////
////PAAAAD0AAAA+AAAAPwAAAEAAAABBAAAAQgAAABkAAAD/////////////////////////////
/////////////////////////////////////////v//////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////AQAAAP7/
//8DAAAABAAAAAUAAAAGAAAABwAAAAgAAAAJAAAACgAAAAsAAAAMAAAADQAAAA4AAAD+////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////9QYXRrZQAA
AAAAAAAAAAAAAAAAAB4AAAAOAAAASm9obiBILiBQYXRrZQAAAAAAAAAAAAAAAAAAAEAAAACGcRi8
5fC6AQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAEAAAACG6bdXm/G6AQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AEAAAAAAAqpMJQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB4AAAATAAAATWljcm9zb2Z0IFdv
cmQgNi4wAAAAAAAAAAAAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB4AAAAC
AAAAOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAANDPEeChsRrhAAAAAAAAAAAAAAAAAAAAADsAAwD+/wkAci4NDdDPEeChsRrhAAAA
AAAAAAAAAAAAAAAAADsAAwD+/wkABgAAAAAAAAAAAAAAAQAAAAEAAAAAAAAAABAAAAEA/v8DCgAA
/////wAJAgAAAAAAwAAAAAAAAEYcAAAATWljcm9zb2Z0IFdvcmQgNi4wIERvY3VtZW50AAoAAABN
U1dvcmREb2MAEAAAAFdvcmQuRG9jdW1lbnQuNgAAAAAAOwADAP7/CQAGAAAAAAAAAAAAAAABAAAA
AQAAAAAA/v8AAAMKAAAAAAAAAAAAAAAAAAAAAAAAAQAAAOCFn/L5T2gQq5EIACsns9kwAAAA8AIA
AA4AAAAHAAAAmAAAAAIAAADcAAAABAAAAEABAAAIAAAAZAEAAAwAAACIAQAACwAAAKwBAAANAAAA
0AEAAA8AAAD0AQAAEAAAABgCAAAKAAAAPAIAABIAAABgAgAADgAAAIQCAAAJAAAAqAIAABMAAADM
AgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAeAAAAJwAAAEM6XFdJTkRPV1NcV0lO
V09SRFxURU1QTEFURVxOT1JNQUwuRE9UAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB4AAABDAAAAV2Vs
Y29tZSB0byB0aGUgZmlzdCBpc3N1ZSBvZiB0aGUgSW50ZXJnbG9iZSBJbnZlc3RtZW50IE5ld3Ns
ZXR0ZXIuAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAeAAAADgAAAEpvaG4gSC4gBQBTAHUAbQBt
AGEAcgB5AEkAbgBmAG8AcgBtAGEAdABpAG8AbgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgA
AgD///////////////8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAIAMA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAP///////////////wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA////////////////AAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD///////////////8A
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABACD
EAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJCNwAAAAQldlbGNvbWUgdG8gdGhlIGZpc3QgaXNz
dWUgb2YgdGhlIEludGVyZ2xvYmUgSW52ZXN0bWVudCBOZXdzbGV0dGVyLgAAAA1Kb2huIEguIFBh
dGtlDUpvaG4gSC4gUGF0a2UAAAAAAAAAAAAA0M8R4KGxGuEAAAAAAAAAAAAAAAAAAAAAOwADAP7/
CQAGAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAEAAABQAAAAEAAAD+////AAAAAAEAAAD/////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////9ylZQAzwAkEAABk
AGUAAAAAAAAAAAAAAAADAABEAwAAl0wAAAAAAAAAAAAAAAAAAAAAAAADFAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAagAAAAAIAABqAAAAcigAAAAAAAByKAAAAAAAAHIoAAAA
AAAAcigAAAAAAAByKAAAFAAAAOAqAAAAAAAArCgAADQCAADgKgAAAAAAAOAqAAAAAAAA4CoAAAAA
AADgKgAAKAAAAAgrAAAQAAAA4CoAAAAAAACiSwAAMQAAABgrAAAAAAAAGCsAAAAAAAAYKwAAAAAA
ABgrAAAAAAAAGCsAAAAAAAAYKwAAAAAAABgrAAAAAAAAGCsAAAAAAADILAAAAgAAAMosAAAAAAAA
yiwAAAAAAADKLAAAFAAAAN4sAACiAQAAgC4AAKIBAAAiMAAAHgAAANNLAABUAAAAJ0wAAHAAAABA
MAAAYhsAAAAAAAAAAAAAAAAAAAAAAAByKAAAAAAAABgrAAAAAAAAAAACAAMABgACABgrAAAAAAAA
GCsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGCsAAAAAAAAYKwAAAAAAAEAwAAAAAAAAGCsAAAAAAABy
KAAAAAAAAHIoAAAAAAAAGCsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGCsAAAAAAAAYKwAAAAAAABgr
AAAAAAAAGCsAAAAAAAAYKwAAAAAAAHIoAAAAAAAAGCsAAAAAAAByKAAAAAAAABgrAAAAAAAAyCwA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAhigAAA4AAACUKAAAGAAAAHIoAAAAAAAAcigAAAAAAAByKAAA
AAAAAHIoAAAAAAAAGCsAAAAAAADILAAAAAAAABgrAACwAQAAGCsAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAFdlbGNvbWUgdG8gdGhlIGZpc3QgaXNzdWUgb2YgdGhlIEludGVyZ2xv
YmUgSW52ZXN0bWVudCBOZXdzbGV0dGVyLg0NSW50ZXJnbG9iZSBJbnZlc3RtZW50IE5ld3NsZXR0
ZXJGZWJydWFyeSAxOTk2DQ1JbnRyb2R1Y3Rpb246DVdlbGNvbWUgdG8gdGhlIEludGVyZ2xvYmUg
SW52ZXN0bWVudCBOZXdzbGV0dGVyLiAgVGhpcyBtb250aGx5IGludGVybmF0aW9uYWwgIG5ld3Ns
ZXR0ZXIgaXMgYW4gaW52ZXN0bWVudCBhZHZpc29yeSB3aGljaCD///////8AAwAAQwMAAEQDAABk
AwAAcQMAAHIDAABzAwAAgAMAAIEDAACCAwAAgwMAAIQDAACFAwAAhgMAAIcDAACIAwAAiQMAAIoD
AACLAwAAjAMAAI0DAACOAwAAjwMAAJADAACRAwAAkgMAAJMDAACUAwAAlQMAAJYDAACXAwAAmAMA
AJkDAACaAwAAmwMAAJwDAACdAwAAngMAAJ8DAACgAwAAoQMAAKIDAACjAwAApAMAAKUDAACmAwAA
pwMAAKgDAACpAwAAqgMAAKsDAACsAwAArQMAAK4DAACvAwAAsAMAALEDAACyAwAAswMAALQDAAC1
AwAAuAMAAL8DAADNAwAAzgMAAOADAAD0AwAA+QMAAPoDAABqCAAAgwgAAIQIAACFCAAAhggAAIcI
AACICAAAmAgAAJkIAACcCAAApQgAAKYIAACuCAAArwgAANEIAADZCAAA2ggAANsIAADqCAAA6wgA
AO8IAAD3CAAA+AgAAPoIAAD7CAAAAgkAABcJAAD9APgA9PTy9AAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAACdQEAAlWBAAZVgVaBXgEACVWBVoFeAWMYAANjEAAAXwEAAAD+////AwAAAAQA
AAAFAAAABgAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAA/v//////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////UGF0a2UAAAAAAAAAAAAA
AAAAAAAeAAAADgAAAEpvaG4gSC4gUGF0a2UAAAAAAAAAAAAAAAAAAABAAAAAhnEYvOXwugEAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABA
AAAAhk1u43zxugEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAABbv
yCIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAeAAAAEwAAAE1pY3Jvc29mdCBXb3JkIDYuMAAA
AAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAeAAAAAgAAADcAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AADQzxHgobEa4QAAAAAAAAAAAAAAAAAAAAA7AAMA/v8JAHIuDQ3QzxHgobEa4QAAAAAAAAAAAAAA
AAAAAAA7AAMA/v8JAAYAAAAAAAAAAAAAAAEAAAABAAAAAAAAAAAQAAABAP7/AwoAAP////8ACQIA
AAAAAMAAAAAAAABGHAAAAE1pY3Jvc29mdCBXb3JkIDYuMCBEb2N1bWVudAAKAAAATVNXb3JkRG9j
ABAAAABXb3JkLkRvY3VtZW50LjYAAAAAADsAAwD+/wkABgAAAAAAAAAAAAAAAQAAAAEAAAAAAP7/
AAADCgAAAAAAAAAAAAAAAAAAAAAAAAEAAADghZ/y+U9oEKuRCAArJ7PZMAAAAPACAAAOAAAABwAA
AJgAAAACAAAA3AAAAAQAAABAAQAACAAAAGQBAAAMAAAAiAEAAAsAAACsAQAADQAAANABAAAPAAAA
9AEAABAAAAAYAgAACgAAADwCAAASAAAAYAIAAA4AAACEAgAACQAAAKgCAAATAAAAzAIAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHgAAACcAAABDOlxXSU5ET1dTXFdJTldPUkRcVEVN
UExBVEVcTk9STUFMLkRPVAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAeAAAAQwAAAFdlbGNvbWUgdG8g
dGhlIGZpc3QgaXNzdWUgb2YgdGhlIEludGVyZ2xvYmUgSW52ZXN0bWVudCBOZXdzbGV0dGVyLgAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHgAAAA4AAABKb2huIEguINylZQAzwAkEAABUAGUAAAAA
AAAAAAAAAAADAABEAwAAWEsAAAAAAAAAAAAAAAAAAAAAAAAoFAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAACAAAagAAAAAIAABqAAAAHSgAAAAAAAAdKAAAAAAAAB0oAAAAAAAAHSgA
AAAAAAAdKAAAFAAAAIsqAAAAAAAAVygAADQCAACLKgAAAAAAAIsqAAAAAAAAiyoAAAAAAACLKgAA
KAAAALMqAAAQAAAAiyoAAAAAAABjSgAAMQAAAMMqAAAAAAAAwyoAAAAAAADDKgAAAAAAAMMqAAAA
AAAAwyoAAAAAAADDKgAAAAAAAMMqAAAAAAAAwyoAAAAAAAA9LAAAAgAAAD8sAAAAAAAAPywAAAAA
AAA/LAAAFAAAAFMsAACiAQAA9S0AAKIBAACXLwAAHgAAAJRKAABUAAAA6EoAAHAAAAC1LwAArhoA
AAAAAAAAAAAAAAAAAAAAAAAdKAAAAAAAAMMqAAAAAAAAAAACAAMABgACAMMqAAAAAAAAwyoAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAwyoAAAAAAADDKgAAAAAAALUvAAAAAAAAwyoAAAAAAAAdKAAAAAAA
AB0oAAAAAAAAwyoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwyoAAAAAAADDKgAAAAAAAMMqAAAAAAAA
wyoAAAAAAADDKgAAAAAAAB0oAAAAAAAAwyoAAAAAAAAdKAAAAAAAAMMqAAAAAAAAPSwAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAMSgAAA4AAAA/KAAAGAAAAB0oAAAAAAAAHSgAAAAAAAAdKAAAAAAAAB0o
AAAAAAAAwyoAAAAAAAA9LAAAAAAAAMMqAAB6AQAAwyoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAFdlbGNvbWUgdG8gdGhlIGZpc3QgaXNzdWUgb2YgdGhlIEludGVyZ2xvYmUgSW52
ZXN0bWVudCBOZXdzbGV0dGVyLg0NSW50ZXJnbG9iZSBJbnZlc3RtZW50IE5ld3NsZXR0ZXJGZWJy
dWFyeSAxOTk2DQ1JbnRyb2R1Y3Rpb246DVdlbGNvbWUgdG8gdGhlIEludGVyZ2xvYmUgSW52ZXN0
bWVudCBOZXdzbGV0dGVyLiAgVGhpcyBtb250aGx5IGludGVybmF0aW9uYWwgIG5ld3NsZXR0ZXIg
aXMgYW4gaW52ZXN0bWVudCBhZHZpc29yeSB3aGljaCD////////+/wAAAwoAAAAAAAAAAAAAAAAA
AAAAAAABAAAA4IWf8vlPaBCrkQgAKyez2TAAAADwAgAADgAAAAcAAACYAAAAAgAAANwAAAAEAAAA
QAEAAAgAAABkAQAADAAAAIgBAAALAAAArAEAAA0AAADQAQAADwAAAPQBAAAQAAAAGAIAAAoAAAA8
AgAAEgAAAGACAAAOAAAAhAIAAAkAAACoAgAAEwAAAMwCAAABAXQcagBqBAPfJv93Bib/dwQmxF8E
JsQfJv9fJOsakB4AAAAnAAAAQzpcV0lORE9XU1xXSU5XT1JEXFRFTVBMQVRFXE5PUk1BTC5ET1QA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAHgAAAEMAAABXZWxjb21lIHRvIHRoZSBmaXN0IGlzc3VlIG9m
IHRoZSBJbnRlcmdsb2JlIEludmVzdG1lbnQgTmV3c2xldHRlci4AAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAB4AAAAOAAAASm9obiBILiBQYXRrZQAAAAAAAAAAAAAAAAAAAB4AAAAOAAAASm9obiBI
LiBQYXRrZQAAAAAAAAAAAAAAAAAAAEAAAACGcRi85fC6AQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAABDAwAARAMAAGQDAABxAwAA
cgMAAHMDAACAAwAAgQMAAIIDAACDAwAAhAMAAIUDAACGAwAAhwMAAIgDAACJAwAAigMAAIsDAACM
AwAAjQMAAI4DAACPAwAAkAMAAJEDAACSAwAAkwMAAJQDAACVAwAAlgMAAJcDAACYAwAAmQMAAJoD
AACbAwAAnAMAAJ0DAACeAwAAnwMAAKADAAChAwAAogMAAKMDAACkAwAApQMAAKYDAACnAwAAqAMA
AKkDAACqAwAAqwMAAKwDAACtAwAArgMAAK8DAACwAwAAsQMAALIDAACzAwAAtAMAALUDAAC4AwAA
vwMAAM0DAADOAwAA4AMAAPQDAAD5AwAA+gMAAGoIAACDCAAAhAgAAIUIAACGCAAAhwgAAIgIAACY
CAAAmQgAAJwIAAClCAAApggAAK4IAACvCAAA0QgAANkIAADaCAAA2wgAAOoIAADrCAAA7wgAAPcI
AAD4CAAA+ggAAPsIAAACCQAAFwkAAP0A+AD09PL0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAJ1AQACVYEABlWBVoFeAQAJVYFWgV4BYxgAA2MQAABfAAMAAEMDAABEAwAAcgMAAHMDAACB
AwAAkgkAAJMJAAAECwAABQsAABMLAAD2CwAA9wsAAOsMAADsDAAA+wwAAPsOAAD8DgAAQA8AAEEP
AABzDwAACxAAAIwQAADaEAAA/xAAAB8RAABbEQAAoREAALISAABcEwAAXRMAAJETAACSEwAAkxMA
AP4AAAAAAAD+AAHAIesA+wABwCHrAP4AAcAh6wD+AAHAIesA/gAEwCHrAP4AAcAh6wD+AATAIesA
/gABwCHrAP4AAcAh6wD+BP/AIckC/gABwCHrAP4E/8Ah1wL+AAHAIesA/gABwCHrAP4ABcAh6wD+
AAHAIesA/gABwCHrAP4AAcAh6wD+AAHAIesA2gT/wCHlAdoE/8Ah5QG8AAHAIfoAvAABwCH6ALwA
AcAh+gC8AAHAIfoAvAABwCH6ALwE/8Ah0AK8BP/AIeUB/gABwCHrAP4AAcAh6wDaAAHAIfoA/gAB
wCHrAAAAAAAAAAAAAB0AAA0LDDT/AQAIAAABAAAAAQBoAQAAAAAAALcAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAACAAAA0LEWgBE5j+DDT/AQAIAAABAAAAAQBoAQAAAAAAALcAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAUBAAEAACEOAA8ACAABAEsADwAAAAAAGgAAQPH/
AgAaAAZOb3JtYWwAAgAAAAMAYQkEAAAAAAAAAAAAAAAAAAAAAAAAACIAQUDy/6EAIgAWRGVmYXVs
dCBQYXJhZ3JhcGggRm9udAAAAAAAAAAAAAAAaWRlbnRpZmllcyBpdHMgc3Vic2NyaWJlcnMgaW4g
cG90ZW50aWFsIHByb2ZpdHMgaW4gc2VsZWN0ZWQgcHVibGljbHkgdHJhZGVkIGNvbXBhbmllcy4g
IFRoZSBzZWN1cml0aWVzIHNlbGVjdGVkICBhcmUgbW9zdGx5IGZyb20gdGhlIFUuUy4gTkFTREFR
IGFuZCBBbWVyaWNhbiBTdG9jayBleGNoYW5nZXMgYXMgd2VsbCBhcyBvdGhlciBjb3VudHJpZXMg
cHVibGljIGNvbXBhbmllcy4gIFRoZSBuZXdzbGV0dGVyIG9uY2UgaW4gYSB3aGlsZSBpbmxpZ2h0
cyBjZXJ0YWluIHJlYWwgZXN0YXRlIG9wcG9ydHVuaXRpZXMuIA0NQWxsIHRoZSBzZWN1cml0aWVz
IGFyZSBzZWxlY3RlZCBhZnRlciBhIHRob3JvdWdoLCBsZW5ndGh5IGR1ZWRlbGlnZW5jZSByZXNl
YXJjaHMsIGFuZCBpdCBpcyBleHBlY3RlZCB0aGF0IHRoZWlyIHBlcmZvcm1hbmNlIHdpbGwgb3V0
cGVyZm9ybSB0aGUgZ2VuZXJhbCBtYXJrZXRzIHNpZ25pZmljYW50bHkgb3ZlciB0aGUgbmV4dCBz
aXggdG8gdHdlbHZlIG1vbnRocy4gICBUaGUgbmV3bGV0dGVyIGludGVudGlvbiBpcyB0byBjb3Zl
ciBvbmx5IGEgaGFuZGZ1bGxsIG9mIHNlY3VyaXRpZXMgaW4gZWFjaCBpc3N1ZSBhbmQgIGhpZ2hs
aWdodCB0aGVtIHdpdGggZmV3IGZ1bmRhbWVudGFsIGFuZCB0ZWNobmljYWwgIHBhcmFtZXRlciBi
dWxsZXRzLiANDVN1YnNjcmlwdGlvbjoNVGhlIG5ld3NsZXR0ZXIgaXMgY3VycmVudGx5IHB1Ymxp
c2hlZCBhbmQgbWFpbGVkIGVsZWN0cm9uaWNhbHkgKHZpYSBlLW1haWwpIHRvIHN1c2NyaWJlcnMg
aW4gdGhlIGZpcnN0IHdlZWsgb2YgZWFjaCBtb250aC4gVGhlcmUgYXJlIHBsYW5zIGZvciB0aGUg
bmV3bGV0dHRlciB0byBiZWNvbWUgd2Vla2x5IGluIHRoZSBuZWFyIGZ1dHVyZS4gIFRoZSBzdWJz
Y3JpcHRpb24gY29zdCBpcyBGUkVFLg0NSW4gb3JkZXIgdG8gZ3VhcmFudGVlIHJlY2lldmluZyB0
aGUgSW50ZXJnbG9iZSBJbnZlc3RtZW50IE5ld3NsZXR0ZXIgZXZlcnkgbW9udGggLCB5b3UgbmVl
ZCB0byBzZW5kIGFuIGUtbWFpbCB0bzogaWdsb2JlQGl4Lm5ldGNvbS5jb20sIGFuZCBpbiB0aGUg
c3ViamVjdCBzZWN0aW9uIGp1c3Qgc2F5IJNTdWJzY3JpYmWULiAgSWYgeW91IGhhdmUgZG9uZSB0
aGlzIGFscmVhZHkgcGxlYXNlIGlnbm9yZSB0aGlzIG1lc3NhZ2UuDQ1JbiB0aGlzIGlzc3VlOg1U
aGUgVS5TLiBzdG9jayBtYXJrZXRzIGNvbnRpbnVlZCAgYnJlYWtpbmcgbmV3IGhpZ2hzIGluIEph
bnVhcnkgb2YgMTk5NiBldmVuIGFmdGVyIGEgdmVyeSBoZWFsdGh5IHJpc2UgaW4gMTk5NS4gIElu
IDE5OTUgQ29uc3VtZXIgUHJpY2UgSW5kZXggcm9zZSBvbmx5IDIuNSUsIHRoZSBGZWRlcmFsIHJl
c2VydmUgaGFzIGxvd2VyZWQgdGhlIGludGVyZXN0IHJhdGVzIGFuZCBhbmFseXN0cyBiZWxpZXZl
IG1vcmUgYXJlIGV4cGVjdGVkIHRvIGNvbWUuICBBbGwgdGhlc2UgYXJlIGdvb2Qgc2lnbnMgdGhh
dCAxOTk2IHdpbGwgYmUgYXMgZ29vZCBhcyAxOTk1IGZvciB0aGUgVVMgc3RvY2sgbWFya2V0cy4g
IE9uIHRoZSBjYXV0aW91cyBzaWRlIGp1c3QgbG9vayBhdCB0aGUgcHJpY2Ugb2YgZ29sZC4gSXRz
IHByaWNlIGhhcyBtb3ZlZCB1cCBhYm92ZSAkNDAwIGFuZCBjb250aW51b3VzIHJpc2luZyAgYWZ0
ZXIgeWVhcnMgb2Ygc3RhZ25lbnQgbW92ZXMuICAgTGV0cyBqdXN0IHN0YXkgY2F1dGlvdXMuDQ1P
dXIgcmVzZWFyY2ggc2hvd3MgcG90ZW50aWFsIG9wcG9ydHVuaXRpZXMgaW4gdGhlIGZvbGxvd2lu
ZyBzdG9ja3M6DQ1CYXkgTmV0d29ya3MgSW5jLiAoVS5TLiBPVEMsIFN5bWJvbD1CTkVULCBQcmlj
ZT0pDVRoaXMgQ2FsaWZvcm5pYSBiYXNlZCBjb21wYW55IG1hbnVmYWN0dXJlcyBuZXR3b3JraW5n
IGVxdWlwbWVudCxtYXJrZXRzLGEgbmQgc2VydmljZXMgdGhlbSBpbiBib3RoIAl0aGUgVS5TLiBh
bmQgYWJyb3VkLiAgSXQgaGFzIDExMSBvZmZpY2VzIHNlYXJjaGVzbmV3c2xldHRlcmhhbmRmdWxl
bGVjdHJvbmljYWxseXN1YnNjcmliZXJzbmV3c2xldHRlcnJlY2VpdmluZ1VTb2YgYSB5ZWFyIHN0
YWduYW50VVNlcXVpcG1lbnQsIG1hcmtldHNhbmRVU2Ficm9hZE5ldHdvcmuSc3BhcnRuZXJzYmVs
aWV2ZWQxOTk1IEVQU1VTVVMkVVMkCVVTIHBvdGVudGlhbGx5dHJhZGUgY29uc2VydmF0aXZlbHlV
U0NvcnAuVVNjb21wYW55IGJhbmtpbmdiZWxpZXZlZFVTZGl2aWRlbmRzLjE5OTUgRVBTVVNVUyAg
Zm9yIDE5OTYuVVMgdG8gMjIJYW5kLg1CYXJyZXR0IEJ1c2luZXNzIFNlcnZpY2VzIEluYy5VU0JC
U0kNVGhpcyBPcmVnb24gYmFzZWQgY29tcGFueSBjYXRlcnMgYnVzaW5lc3NlcyB3aXRoIHRlbXBv
cmFyeSBzdGFmZmluZy4NVGhlIGNvbXBhbnkgaGFzIG1vcmUgdGhhbiA1MDAgY2xpZW50cyBpbiB0
aGUgTWFyeWxhbmQsIE9yZWdvbiwgYW5kIFdhc2hpbmd0b24gc3RhdGVzLiANSW5zdGl0dXRpb25z
IGhvbGQgNDcNNlRoZXJlIHdlcmUgbGFyZ2Ugdm9sdW1lcyBvZiB0cmFkaW5nIGluIERlY2VtYmVy
IG9mIDE5OTUsIGFuZCBKYW51YXJ5IDE5OTYuDTE5OTUgRVBTVVMwLjYwIHZlcnNlcyBVUyQwLjUz
IGluIDE5OTQuCVVTMC44MyB0byAwLjg1IGZvciAxOTk2LkJhc2VkIG9uIDE5OTUgcHJpY2UgcGVy
IGVhcm5pbmdzIHJhdGlvIHRoZSBzdG9jayBzaG91bGQgdHJhZGUgYXMgaGlnaCBhcyBVUyAkMjUg
dGhpcyB5ZWFyQW5hbHlzdHMgZXhwZWN0YXRpb25zIHRvIGFjaGlldmUgdGhlIGV4cGVjdGVkIGVh
cm5pbmdzIGFyZSB2ZXJ5IGhpZ2guDSBndWFyYW50ZWVhdmFpbGFibGVpbmZsYW1tYXRpb25zc29s
aWNpdGF0aW9ucmVzZWFyY2gNDUJlc3QgV2lzaGVzIE9uIHRoZSBiZWhhbGYgb2YgdGhlIEludGVy
Z2xvYmUgSW52ZXN0bWVudCBOZXdzbGV0dGVyIGFuZCBteXNlbGYgIHdpc2hpbmcgeW91IGEgaGVh
bHRoeSwgYW5kIHByb3NwZXJvdXMgbW9udGguICBHb2QgQmxlc3MgeW91Lg1Sb2JlcnQgU2hhdGlr
aWFuLCBQcmVzaWRlbnQgJiBQdWJsaXNoZXIAAABwIAAAciAAAHggAACBIAAAiSAAAJEgAACZIAAA
myAAAJ4gAAChIAAAoiAAAKQgAAClIAAAsCAAAMQgAADGIAAAyyAAAM0gAADUIAAA1SAAANwgAADk
IAAA5iAAAO8gAADwIAAA+CAAAPogAAD9IAAAByEAAAkhAAALIQAADCEAAA0hAAAPIQAAECEAABMh
AAAUIQAAFSEAADMhAAA1IQAAOSEAADwhAABFIQAARiEAAEwhAAB9IQAAfiEAAIMhAACKIQAArCEA
ALYhAAC+IQAAwiEAAMwhAADUIQAA1SEAANYhAADoIQAA6SEAAOohAADrIQAA7CEAADciAAA/IgAA
QSIAAE0iAABPIgAAXCIAAF0iAABeIgAAYCIAAGwiAAB2IgAAvyIAAMEiAADFIgAAzyIAABQjAAAV
IwAAFiMAAB8jAAAoIwAANSMAAEEjAABJIwAASyMAAFYjAABXIwAAWSMAAFojAABeIwAAZSMAAJgj
AACnIwAAriMAAOUjAADmIwAA6CMAAOkjAAAAAAAAAAAAAAAAAAAAAAD+AAAAAAAAAAAAAAAAAAAA
AAAAAAAA/gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD6AAAAAAAA+PoA
AAAAAAAAAAAAAAAAAlWBAAZVgVaBXgEAAlaBYukjAADyIwAA/SMAAAAoAAAEKAAACigAAAsoAAAR
KAAAFCgAAB0oAAAAAP0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAnUBAAAJVVMkIDQxLjg3NTNVUyQgMTk2LjVVUyQgMTUuNzUA
AAAAKBQAAAUA/////wAA/////wIABCD//wEAAiD//wIAAAAAAFENAAAoFAAAAABHAAAAAQAAAAAA
AAAAACEAAAAvAAAAMAAAAD4AAADgAQAA4QEAAFIDAABTAwAAYQMAAEYEAABHBAAAOwUAADwFAABL
BQAAUwcAAFQHAACYBwAAmQcAANMHAABpCAAA6AgAADoJAABfCQAAfAkAALgJAAD/CQAACAsAALUL
AAC2CwAA7wsAABYNAAAtDQAAUQ0AAJgNAAC/DQAAOw4AAMoOAAADDwAABA8AAEoPAABLDwAAkA8A
AOcPAAAMEAAAIxAAAG4QAAAKEQAAZBEAAKoRAACrEQAAuREAAHETAAByEwAAgRMAAAAUAAAoFAAA
AAHAIR8BAAHAIesAAAHAIesAAAHAIesAAATAIesAAAHAIesAAATAIesAAAHAIesAAAHAIesABP/A
IckCAAHAIesABP/AIdcCAAHAIesAAAHAIesAAAXAIesAAAHAIesAAAHAIesAAAHAIesAAAHAIesA
BP/AIeUBBP/AIeUBAAHAIfoAAAHAIfoAAAHAIfoAAAHAIfoAAAHAIfoABP/AIdACBP/AIeUBAAHA
IesAAAHAIesABP/AIdACAAHAIfoAAAHAIfoAAAHAIfoAAAHAIfoABP/AIeUBBP/AIeUBAAHAIfoA
AAHAIesAAAAAAAAAAAHAIesAAAHAIfoAAAHAIfoAAAHAIfoAAAHAIfoAAAHAIfoABP/AIeUBAAHA
IfoAAAHAIfoAAAHAIesAAAHAIesAAAXAIesAAAHAIesAAAHAIesAAALAIesAAAHAIesAAAMAABcJ
AABDDQAAGRMAAHAgAADpIwAAHSgAAAIACwAMAA0AEgATAAADAACTEwAA1iMAAAMADgB6AQ1Kb2hu
IEguIFBhdGtlJUM6XFdJTkRPV1NcV0lOV09SRFxMRVRURVJTXE5XU0xUUi5GRUINSm9obiBILiBQ
YXRrZSdDOlxXSU5ET1dTXFdJTldPUkRcTEVUVEVSU1xHTE9CX0ZFQi5ET0MNSm9obiBILiBQYXRr
ZSdDOlxXSU5ET1dTXFdJTldPUkRcTEVUVEVSU1xHTE9CX0ZFQi5ET0MNSm9obiBILiBQYXRrZSdD
OlxXSU5ET1dTXFdJTldPUkRcTEVUVEVSU1xHTE9CX0ZFQi5ET0MNSm9obiBILiBQYXRrZSdDOlxX
SU5ET1dTXFdJTldPUkRcTEVUVEVSU1xHTE9CX0ZFQi5ET0MNSm9obiBILiBQYXRrZSdDOlxXSU5E
T1dTXFdJTldPUkRcTEVUVEVSU1xHTE9CX0ZFQi5ET0MNSm9obiBILiBQYXRrZSdDOlxXSU5ET1dT
XFdJTldPUkRcTEVUVEVSU1xHTE9CX0ZFQi5ET1T/QFdJTkZBWABDT00yOgBXSU5GQVgAV0lORkFY
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwADQABhAQMEAAABAAEAAAAAAAAAAAAAAPz/AAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAWWVzAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5NjAAADYwAAAAAAAA
AABOb25lAAAAAAAAAAAAAABUb25lAABDb25uZWN0AAAAAAAAAABNZWQAAAAAQzpcV0lORkFYXGRh
dGFcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAFdJTkZBWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAA0AAYQEDBAAA
AQABAAAAAAAAAAAAAAD8/wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwAAAAAFllcwAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAOTYwAAA2MAAAAAAAAAAATm9uZQAAAAAAAAAAAAAAVG9uZQAAQ29ubmVjdAAAAAAAAAAA
TWVkAAAAAEM6XFdJTkZBWFxkYXRhXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABgAEASA8AAEgPAAAHAACAAIBIDwAAAAAA
AD8PAAABCAAFAVWBVoFeAQEJABAAABEAABMAAAEPABAAABEAABMAAFWBVoFeAQKAGgAAAAAAACAA
AAAhAAAALgAAAC8AAAAwAAAAPQAAAD4AAAA/AAAAQAAAAEEAAABCAAAAQwAAAEQAAABFAAAARgAA
AEcAAABIAAAASQAAAEoAAABLAAAATAAAAE0AAABOAAAATwAAAFAAAABRAAAAUgAAAFMAAABUAAAA
VQAAAFYAAABXAAAAWAAAAFkAAABaAAAAWwAAAFwAAABdAAAAXgAAAF8AAABgAAAAYQAAAGIAAABj
AAAAZAAAAGUAAABmAAAAZwAAAGgAAABpAAAAagAAAGsAAABsAAAAbQAAAG4AAABvAAAAcAAAAHEA
AAByAAAAdQAAAHwAAACKAAAAiwAAAJ0AAACxAAAAtgAAALcAAADQAAAA0QAAANIAAADTAAAA1AAA
ANUAAADlAAAA5gAAAOkAAADyAAAA8wAAAPsAAAD8AAAAHgEAACYBAAAnAQAAKAEAADcBAAA4AQAA
PAEAAD4BAABCAQAAQwEAAEUBAABGAQAATQEAAGIBAABjAQAAbgEAAHkBAAB6AQAAfQEAAKcBAACo
AQAArwEAALIBAACzAQAAuAEAALoBAAC7AQAAvAEAAMQBAADFAQAA3gEAAN8BAADhAQAA4gEAAPQB
AAAbAgAAHgIAACcCAAAoAgAAMgIAAIACAACBAgAAlQIAAJ4CAACyAgAAtQIAALYCAAC6AgAAxAIA
ANQCAADaAgAA3gIAAN8CAADhAgAA4gIAAOkCAADsAgAA7QIAAPcCAAD6AgAA/AIAAAUDAAAKAwAA
DQMAAA4DAAAYAwAAMgMAADQDAAA9AwAAPgMAAFADAABRAwAAXwMAAGADAABhAwAAdwMAAHgDAACS
AwAAoAMAAKEDAACtAwAAsQMAALwDAAC9AwAAvwMAAMQDAADPAwAA1gMAANcDAADtAwAA8QMAAPID
AAD0AwAA9QMAAPYDAAAABAAARQQAAFIEAABdBAAAZgQAAJQEAACYBAAAmgQAAK0EAACuBAAAtwQA
ALgEAAC5BAAAzQQAAPMEAAD9BAAAGgUAABsFAAAcBQAAOgUAADwFAABJBQAASgUAAEsFAABOBQAA
TwUAAFEFAABeBQAAXwUAAGgFAABpBQAAagUAAH4FAACRBQAAnQUAALoFAAC8BQAAvQUAAOUFAADo
BQAAKwYAAHUGAAB2BgAAfgYAAIgGAACTBgAAmAYAAKgGAACpBgAAwAYAAMUGAADQBgAA0QYAANkG
AADaBgAA7QYAAO4GAADzBgAA9AYAAPcGAAAQBwAAEQcAABcHAAAZBwAAJwcAACgHAAAwBwAAMQcA
ADcHAABSBwAAVAcAAFcHAABYBwAAkAcAAJkHAACqBwAArAcAAK4HAACyBwAAxwcAAMsHAADRBwAA
CQgAABsIAAAcCAAAHwgAADYIAAA3CAAAOggAADsIAAA9CAAAQggAAEgIAABnCAAAaAgAAGkIAABt
CAAAdggAAIQIAACMCAAAyAgAAMkIAADRCAAA5ggAAOcIAADoCAAA6ggAAPcIAAD4CAAACgkAAA4J
AAAVCQAAOAkAAEwJAABNCQAAcQkAAHoJAAB7CQAAhgkAAIkJAACOCQAAjwkAALcJAADFCQAAzQkA
AP8JAAAHCgAAGwoAADcKAAA6CgAAPQoAAD4KAABACgAARgoAAFIKAABTCgAAZgoAAGcKAABqCgAA
bwoAAIAKAACBCgAAmQoAAJoKAACeCgAAqQoAAK0KAAC+CgAAwQoAAMIKAADHCgAAyAoAAM8KAADV
CgAA1woAAPUKAAAGCwAABwsAAAoLAAANCwAAMAsAADkLAAA6CwAARQsAAEsLAABUCwAAVQsAAHAL
AABxCwAAeAsAAIMLAACECwAAmAsAAKMLAAClCwAAswsAALQLAAC1CwAAxQsAAMoLAADMCwAAzgsA
ANILAADbCwAA3wsAAOcLAADtCwAA7wsAAA4MAAAQDAAAEQwAADUMAAA2DAAAOQwAAEAMAABKDAAA
TAwAAE0MAABQDAAAVAwAAF8MAABoDAAAaQwAAIQMAACLDAAAqwwAAK4MAADSDAAA6QwAAOsMAAAW
DQAAOg0AAEANAABRDQAAXg0AAGYNAABtDQAAbg0AAHENAAB1DQAAlg0AAJcNAACYDQAAoA0AAKIN
AACoDQAAsQ0AAL0NAAC+DQAAvw0AAMcNAADbDQAA9w0AAPoNAAD9DQAA/g0AAAAOAAADDgAAEg4A
ABYOAAAnDgAAKA4AACsOAAAwDgAAOg4AADsOAAB0DgAAdw4AAJcOAACYDgAAmg4AAJsOAACdDgAA
ng4AAKAOAAChDgAAog4AAKQOAAClDgAAqA4AAMgOAADJDgAAyg4AAAIPAAADDwAAIg8AACQPAAAm
DwAAKg8AADMPAAA3DwAAPw8AAEgPAABKDwAATQ8AAFYPAABXDwAAXQ8AAI4PAACPDwAAlA8AAJsP
AAC9DwAAxw8AAM8PAADTDwAA3Q8AAOUPAADmDwAA5w8AAPkPAAD6DwAA+w8AAAsQAAAMEAAAHxAA
ACAQAAAjEAAAbhAAAHYQAACKEAAAphAAAKkQAACsEAAArRAAAK8QAACxEAAAvRAAAL8QAADAEAAA
zRAAAM4QAADPEAAA0BAAANkQAADdEAAA7hAAAPAQAADzEAAA/xAAAAkRAAAKEQAAUxEAAFURAABZ
EQAAYxEAAGQRAACpEQAAqhEAALERAAC1EQAAthEAALcRAAC4EQAAuREAAMIRAADGEQAA2hEAANsR
AADtEQAA7hEAABASAAAREgAATBIAAFUSAABjEgAAZhIAAGgSAAByEgAAhBIAAJUSAACWEgAAmhIA
AKMSAACkEgAAsRIAALISAAC/EgAAwRIAAMwSAAD8EgAACBMAACcTAABMEwAAVBMAAGcTAABoEwAA
aRMAAGoTAABwEwAAchMAAH0TAAB+EwAAfxMAAIATAACBEwAAgxMAAIQTAACIEwAAjxMAAMITAADR
EwAA2BMAAA8UAAAQFAAAEhQAABMUAAAcFAAAJxQAACgUAAABBUQDAAAAAAAFQgMAAAEAAQVkAwAA
AAAABXEDAAAAAAAFcgMAAAAAAQVzAwAAAAAABYADAAAAAAEFgQMAAAAAAQWCAwAAAAABBYMDAAAA
AAEFhAMAAAAAAQWFAwAAAAABBYYDAAAAAAEFhwMAAAAAAQWIAwAAAAABBYkDAAAAAAEFigMAAAAA
AQWLAwAAAAABBYwDAAAAAAEFjQMAAAAAAQWOAwAAAAABBY8DAAAAAAEFkAMAAAAAAQWRAwAAAAAB
BZIDAAAAAAEFkwMAAAAAAQWUAwAAAAABBZUDAAAAAAEFlgMAAAAAAQWXAwAAAAABBZgDAAAAAAEF
mQMAAAAAAQWaAwAAAAABBZsDAAAAAAEFnAMAAAAAAQWdAwAAAAABBZ4DAAAAAAEFnwMAAAAAAQWg
AwAAAAABBaEDAAAAAAEFogMAAAAAAQWjAwAAAAABBaQDAAAAAAEFpQMAAAAAAQWmAwAAAAABBacD
AAAAAAEFqAMAAAAAAQWpAwAAAAABBaoDAAAAAAEFqwMAAAAAAQWsAwAAAAABBa0DAAAAAAEFrgMA
AAAAAQWvAwAAAAABBbADAAAAAAEFsQMAAAAAAQWyAwAAAAABBbMDAAAAAAEFtAMAAAAAAQW1AwAA
AAABBbgDAAAAAAEFvwMAAAAAAQXNAwAAAAABBc4DAAAAAAEF4AMAAAAAAQX0AwAAAAABBfkDAAAA
AAEFaggAAAAAAQWDCAAAAAABBYQIAAAAAAEFhQgAAAAAAQWGCAAAAAABBYcIAAAAAAEFiAgAAAAA
AQWYCAAAAAABBZkIAAAAAAEFnAgAAAAAAQWlCAAAAAABBaYIAAAAAAEFrggAAAAAAQWvCAAAAAAB
BdEIAAAAAAEF2QgAAAAAAQXaCAAAAAABBdsIAAAAAAEF6ggAAAAAAQXrCAAAAAABBe0fAAAAAAEF
8wgAAAAAAQX3CAAAAAABBfgIAAAAAAEF+ggAAAAAAQX7CAAAAAABBQIJAAAAAAEFFwkAAAAAAQUY
CQAAAAABBSMJAAAAAAEFLgkAAAAAAQUvCQAAAAABBTIJAAAAAAEFXAkAAAAAAQVdCQAAAAABBWQJ
AAAAAAEF7x8AAAAAAQVnCQAAAAABBfAfAAAAAAEFbAkAAAAAAQVtCQAAAAABBW4JAAAAAAEFdgkA
AAAAAQV3CQAAAAABBZAJAAAAAAAFkQkAAAAAAQWTCQAAAAABBZQJAAAAAAEFpgkAAAAAAQXyHwAA
AAABBfUfAAAAAAEF2QkAAAAAAQX+HwAAAAABBeMJAAAAAAEFMQoAAAAAAQUyCgAAAAABBUYKAAAA
AAEFTwoAAAAAAQVjCgAAAAABBWYKAAAAAAEFZwoAAAAAAQUIIAAAAAABBXQKAAAAAAEFhAoAAAAA
AQWKCgAAAAABBY4KAAAAAAEFjwoAAAAAAQWRCgAAAAABBRIgAAAAAAEFmwoAAAAAAQWeCgAAAAAB
BZ8KAAAAAAEFqQoAAAAAAQWsCgAAAAABBa4KAAAAAAEFtwoAAAAAAQW8CgAAAAABBb8KAAAAAAEF
wAoAAAAAAQXKCgAAAAABBeQKAAAAAAEF5goAAAAAAQXvCgAAAAABBfAKAAAAAAEFAgsAAAAAAAUD
CwAAAAABBRELAAAAAAAFEgsAAAAAAQUTCwAAAAABBSkLAAAAAAEFKgsAAAAAAQUZIAAAAAABBVEL
AAAAAAEFUgsAAAAAAQVeCwAAAAABBScgAAAAAAEFbAsAAAAAAQVtCwAAAAABBW8LAAAAAAEFdAsA
AAAAAQV/CwAAAAABBYYLAAAAAAEFhwsAAAAAAQWdCwAAAAABBaELAAAAAAEFogsAAAAAAQWkCwAA
AAABBaULAAAAAAEFMiAAAAAAAQWwCwAAAAAABfULAAAAAAEFAgwAAAAAAQU8IAAAAAABBRYMAAAA
AAEFRAwAAAAAAQVIDAAAAAABBUoMAAAAAAEFXQwAAAAAAQVeDAAAAAABBWcMAAAAAAEFaAwAAAAA
AQVpDAAAAAABBX0MAAAAAAEFowwAAAAAAQWtDAAAAAABBcoMAAAAAAEFywwAAAAAAQXMDAAAAAAA
BeoMAAAAAAEF7AwAAAAAAQX5DAAAAAAABfoMAAAAAAEF+wwAAAAAAQX+DAAAAAABBUUgAAAAAAEF
Aw0AAAAAAQUQDQAAAAABBRENAAAAAAEFGg0AAAAAAQUbDQAAAAABBRwNAAAAAAEFMA0AAAAAAQVD
DQAAAAABBU8NAAAAAAEFbA0AAAAAAQVuDQAAAAABBW8NAAAAAAEFlw0AAAAAAQWaDQAAAAABBd0N
AAAAAAEFJw4AAAAAAQUoDgAAAAABBUcgAAAAAAEFMA4AAAAAAQU7DgAAAAABBUAOAAAAAAEFUA4A
AAAAAQVRDgAAAAABBWgOAAAAAAEFbQ4AAAAAAQV4DgAAAAABBXkOAAAAAAEFgQ4AAAAAAQWCDgAA
AAABBZUOAAAAAAEFlg4AAAAAAQWbDgAAAAABBZwOAAAAAAEFnw4AAAAAAQW4DgAAAAABBbkOAAAA
AAEFvw4AAAAAAQXBDgAAAAABBc8OAAAAAAEFUSAAAAAAAQXYDgAAAAABBdkOAAAAAAEF3w4AAAAA
AAX6DgAAAAABBfwOAAAAAAEF/w4AAAAAAQUADwAAAAAABTgPAAAAAAEFQQ8AAAAAAQVSDwAAAAAB
BVkgAAAAAAEFWA8AAAAAAQVcDwAAAAABBQAoAAAAAAEFBCgAAAAAAAVxDwAAAAABBVsgAAAAAAEF
vA8AAAAAAQVtIAAAAAABBb8PAAAAAAEF1g8AAAAAAQXXDwAAAAABBdoPAAAAAAEFcCAAAAAAAQXf
DwAAAAABBXIgAAAAAAEF6g8AAAAAAQUJEAAAAAAABQoQAAAAAAEFCxAAAAAAAQV4IAAAAAABBRkQ
AAAAAAEFgSAAAAAAAQUwEAAAAAABBWwQAAAAAAEFbRAAAAAAAQV1EAAAAAABBYoQAAAAAAAFixAA
AAAAAQWMEAAAAAABBY4QAAAAAAEFmxAAAAAAAQWcEAAAAAABBVMVAAAAAAEFrhAAAAAAAQW1EAAA
AAAABdgQAAAAAAEFCigAAAAAAAXtEAAAAAABBRQRAAAAAAEFHREAAAAAAAUeEQAAAAABBSkRAAAA
AAEFLBEAAAAAAQUxEQAAAAABBTIRAAAAAAAFWhEAAAAAAQWJIAAAAAAABW8RAAAAAAEFkSAAAAAA
AQWoEQAAAAABBbwRAAAAAAEF2BEAAAAAAQXbEQAAAAABBd4RAAAAAAEFmSAAAAAAAQXjEQAAAAAB
BekRAAAAAAEF9REAAAAAAQX2EQAAAAABBQkSAAAAAAEFmyAAAAAAAQUQEgAAAAABBRUSAAAAAAEF
JhIAAAAAAQUnEgAAAAABBT8SAAAAAAEFQBIAAAAAAQVEEgAAAAABBU8SAAAAAAEFUxIAAAAAAQWe
IAAAAAABBWgSAAAAAAEFaxIAAAAAAQWhIAAAAAABBXASAAAAAAEFdxIAAAAAAQWiIAAAAAABBYES
AAAAAAEFnxIAAAAAAQWwEgAAAAAABbESAAAAAAEFtBIAAAAAAQW3EgAAAAABBdoSAAAAAAEF4xIA
AAAAAQXkEgAAAAABBe8SAAAAAAEF9RIAAAAAAQWkIAAAAAABBf4SAAAAAAEFGRMAAAAAAQUaEwAA
AAABBaUgAAAAAAEFKxMAAAAAAQWwIAAAAAABBT4TAAAAAAEFxCAAAAAAAQVNEwAAAAABBVcVAAAA
AAAFWxMAAAAAAAVcEwAAAAABBcYgAAAAAAEFcBMAAAAAAQXLIAAAAAABBXYTAAAAAAEFehMAAAAA
AQWDEwAAAAABBYcTAAAAAAEFCygAAAAAAAWPEwAAAAABBVgVAAAAAAEFdxUAAAAAAQV5FQAAAAAB
BXoVAAAAAAEFnhUAAAAAAQWfFQAAAAABBc0gAAAAAAEFqBUAAAAAAQWyFQAAAAABBbQVAAAAAAEF
tRUAAAAAAQW4FQAAAAABBbwVAAAAAAEFAB4AAAAAAQXUIAAAAAABBQkeAAAAAAEF1SAAAAAAAQUq
HgAAAAABBUoeAAAAAAEFTR4AAAAAAQVxHgAAAAABBYgeAAAAAAAFih4AAAAAAAW1HgAAAAABBecQ
AAAAAAAF7hAAAAAAAQVbEQAAAAABBdwgAAAAAAEFbxEAAAAAAQXZHgAAAAABBXcRAAAAAAEF2h4A
AAAAAQV+EQAAAAABBd4eAAAAAAAF3x4AAAAAAQXgHgAAAAABBeQgAAAAAAEF6x4AAAAAAQXmIAAA
AAABBfoeAAAAAAEF7yAAAAAAAAUGHwAAAAABBfAgAAAAAAEFqBEAAAAAAQW8EQAAAAABBdgRAAAA
AAEF2xEAAAAAAQXeEQAAAAABBfggAAAAAAEF4xEAAAAAAQUHHwAAAAABBU8SAAAAAAEFUxIAAAAA
AQUWHwAAAAABBfogAAAAAAEFGR8AAAAAAQX9IAAAAAAABR8fAAAAAAEFIB8AAAAAAQURKAAAAAAB
BVofAAAAAAEFeh8AAAAAAQUHIQAAAAABBX8fAAAAAAEFgB8AAAAAAQWCHwAAAAABBQkhAAAAAAEF
CyEAAAAAAQUMIQAAAAABBQ0hAAAAAAEFDyEAAAAAAQUQIQAAAAABBZQfAAAAAAEFEyEAAAAAAAWR
EwAAAwABBbQfAAAAAAAF7B8AAAAAAAUUIQAAAAABBXATAAAAAAEFMyEAAAAAAQV2EwAAAAABBXoT
AAAAAAEFNSEAAAAAAQWHEwAAAAABBRQoAAAAAAAFjxMAAAAAAAU5IQAAAAABBTwhAAAAAAEFRSEA
AAAAAQVGIQAAAAABBUwhAAAAAAEFfSEAAAAAAAV+IQAAAAABBYMhAAAAAAEFiiEAAAAAAQWsIQAA
AAABBbYhAAAAAAEFviEAAAAAAQXCIQAAAAABBcwhAAAAAAEF1CEAAAAAAAXVIQAAAAABBdYhAAAA
AAEF6CEAAAAAAQXpIQAAAAABBe4QAAAAAAAF6iEAAAAAAQW1HgAAAAABBeshAAAAAAAFyR4AAAAA
AAXsIQAAAAABBTciAAAAAAEFqBEAAAAAAQW8EQAAAAABBdgRAAAAAAEF2xEAAAAAAQXeEQAAAAAB
BT8iAAAAAAEF4xEAAAAAAQVBIgAAAAABBU0iAAAAAAEF4xEAAAAAAQVPIgAAAAABBVwiAAAAAAEF
DB8AAAAAAQVdIgAAAAABBQ0fAAAAAAEFTxIAAAAAAQVTEgAAAAABBV4iAAAAAAEFFx8AAAAAAQVg
IgAAAAABBWwiAAAAAAAFHx8AAAAAAQV2IgAAAAABBb8iAAAAAAEFwSIAAAAAAQXFIgAAAAAABcse
AAAAAAEFzyIAAAAAAAUUIwAAAAAABZUTAAAAAAEFnBMAAAAAAQWgEwAAAAABBa4TAAAAAAEFFSMA
AAAAAAWhEwAAAAABBaITAAAAAAEFqxMAAAAAAQWvEwAAAAABBcMTAAAAAAEFxBMAAAAAAQXWEwAA
AAABBdcTAAAAAAEF+RMAAAAAAQX6EwAAAAABBRYjAAAAAAEFPRQAAAAAAQVLFAAAAAABBU4UAAAA
AAEFUBQAAAAAAQVaFAAAAAABBWwUAAAAAAEFfRQAAAAAAQV+FAAAAAABBR8jAAAAAAEFixQAAAAA
AQUoIwAAAAABBZcUAAAAAAEFmBQAAAAAAQWlFAAAAAABBacUAAAAAAEFshQAAAAAAQU1IwAAAAAB
BewUAAAAAAEFCxUAAAAAAQVBIwAAAAABBTcVAAAAAAEFShUAAAAAAQVLFQAAAAABBUwVAAAAAAEF
TRUAAAAAAAVJIwAAAAABBUsjAAAAAAEFoBMAAAAAAQWuEwAAAAABBVYjAAAAAAAFoRMAAAAAAQVX
IwAAAAABBVkjAAADAABDAwAARAMAAHIDAABzAwAAgQMAAJIJAACTCQAABAsAAAULAAATCwAA9gsA
APcLAADrDAAA7AwAAPsMAAD7DgAA/A4AAEAPAABBDwAAcw8AAAsQAACMEAAA2hAAAP8QAAAfEQAA
WxEAAKERAACyEgAAXBMAAF0TAACREwAAkhMAAJMTAAD+AAAAAAAA/gABwCHrAPsAAcAh6wD+AAHA
IesA/gABwCHrAP4ABMAh6wD+AAHAIesA/gAEwCHrAP4AAcAh6wD+AAHAIesA/gT/wCHJAv4AAcAh
6wD+BP/AIdcC/gABwCHrAP4AAcAh6wD+AAXAIesA/gABwCHrAP4AAcAh6wD+AAHAIesA/gABwCHr
ANoE/8Ah5QHaBP/AIeUBvAABwCH6ALwAAcAh+gC8AAHAIfoAvAABwCH6ALwAAcAh+gC8BP/AIdAC
vAT/wCHlAf4AAcAh6wD+AAHAIesA2gABwCH6AP4AAcAh6wAAAAAAAAAAAAAdAAANCww0/wEACAAA
AQAAAAEAaAEAAAAAAAC3AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAANCxFoAROY
/gw0/wEACAAAAQAAAAEAaAEAAAAAAAC3AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC
AAAFAQABAAAhDgAPAAgAAQBLAA8AAAAAABoAAEDx/wIAGgAGTm9ybWFsAAIAAAADAGEJBAAAAAAA
AAAAAAAAAAAAAAAAAAAiAEFA8v+hACIAFkRlZmF1bHQgUGFyYWdyYXBoIEZvbnQAAAAAAAAAAAAA
AGlkZW50aWZpZXMgaXRzIHN1YnNjcmliZXJzIGluIHBvdGVudGlhbCBwcm9maXRzIGluIHNlbGVj
dGVkIHB1YmxpY2x5IHRyYWRlZCBjb21wYW5pZXMuICBUaGUgc2VjdXJpdGllcyBzZWxlY3RlZCAg
YXJlIG1vc3RseSBmcm9tIHRoZSBVLlMuIE5BU0RBUSBhbmQgQW1lcmljYW4gU3RvY2sgZXhjaGFu
Z2VzIGFzIHdlbGwgYXMgb3RoZXIgY291bnRyaWVzIHB1YmxpYyBjb21wYW5pZXMuICBUaGUgbmV3
c2xldHRlciBvbmNlIGluIGEgd2hpbGUgaW5saWdodHMgY2VydGFpbiByZWFsIGVzdGF0ZSBvcHBv
cnR1bml0aWVzLiANDUFsbCB0aGUgc2VjdXJpdGllcyBhcmUgc2VsZWN0ZWQgYWZ0ZXIgYSB0aG9y
b3VnaCwgbGVuZ3RoeSBkdWVkZWxpZ2VuY2UgcmVzZWFyY2hzLCBhbmQgaXQgaXMgZXhwZWN0ZWQg
dGhhdCB0aGVpciBwZXJmb3JtYW5jZSB3aWxsIG91dHBlcmZvcm0gdGhlIGdlbmVyYWwgbWFya2V0
cyBzaWduaWZpY2FudGx5IG92ZXIgdGhlIG5leHQgc2l4IHRvIHR3ZWx2ZSBtb250aHMuICAgVGhl
IG5ld2xldHRlciBpbnRlbnRpb24gaXMgdG8gY292ZXIgb25seSBhIGhhbmRmdWxsbCBvZiBzZWN1
cml0aWVzIGluIGVhY2ggaXNzdWUgYW5kICBoaWdobGlnaHQgdGhlbSB3aXRoIGZldyBmdW5kYW1l
bnRhbCBhbmQgdGVjaG5pY2FsICBwYXJhbWV0ZXIgYnVsbGV0cy4gDQ1TdWJzY3JpcHRpb246DVRo
ZSBuZXdzbGV0dGVyIGlzIGN1cnJlbnRseSBwdWJsaXNoZWQgYW5kIG1haWxlZCBlbGVjdHJvbmlj
YWx5ICh2aWEgZS1tYWlsKSB0byBzdXNjcmliZXJzIGluIHRoZSBmaXJzdCB3ZWVrIG9mIGVhY2gg
bW9udGguIFRoZXJlIGFyZSBwbGFucyBmb3IgdGhlIG5ld2xldHR0ZXIgdG8gYmVjb21lIHdlZWts
eSBpbiB0aGUgbmVhciBmdXR1cmUuICBUaGUgc3Vic2NyaXB0aW9uIGNvc3QgaXMgRlJFRS4NDUlu
IG9yZGVyIHRvIGd1YXJhbnRlZSByZWNpZXZpbmcgdGhlIEludGVyZ2xvYmUgSW52ZXN0bWVudCBO
ZXdzbGV0dGVyIGV2ZXJ5IG1vbnRoICwgeW91IG5lZWQgdG8gc2VuZCBhbiBlLW1haWwgdG86IGln
bG9iZUBpeC5uZXRjb20uY29tLCBhbmQgaW4gdGhlIHN1YmplY3Qgc2VjdGlvbiBqdXN0IHNheSCT
U3Vic2NyaWJllC4gIElmIHlvdSBoYXZlIGRvbmUgdGhpcyBhbHJlYWR5IHBsZWFzZSBpZ25vcmUg
dGhpcyBtZXNzYWdlLg0NSW4gdGhpcyBpc3N1ZToNVGhlIFUuUy4gc3RvY2sgbWFya2V0cyBjb250
aW51ZWQgIGJyZWFraW5nIG5ldyBoaWdocyBpbiBKYW51YXJ5IG9mIDE5OTYgZXZlbiBhZnRlciBh
IHZlcnkgaGVhbHRoeSByaXNlIGluIDE5OTUuICBJbiAxOTk1IENvbnN1bWVyIFByaWNlIEluZGV4
IHJvc2Ugb25seSAyLjUlLCB0aGUgRmVkZXJhbCByZXNlcnZlIGhhcyBsb3dlcmVkIHRoZSBpbnRl
cmVzdCByYXRlcyBhbmQgYW5hbHlzdHMgYmVsaWV2ZSBtb3JlIGFyZSBleHBlY3RlZCB0byBjb21l
LiAgQWxsIHRoZXNlIGFyZSBnb29kIHNpZ25zIHRoYXQgMTk5NiB3aWxsIGJlIGFzIGdvb2QgYXMg
MTk5NSBmb3IgdGhlIFVTIHN0b2NrIG1hcmtldHMuICBPbiB0aGUgY2F1dGlvdXMgc2lkZSBqdXN0
IGxvb2sgYXQgdGhlIHByaWNlIG9mIGdvbGQuIEl0cyBwcmljZSBoYXMgbW92ZWQgdXAgYWJvdmUg
JDQwMCBhbmQgY29udGludW91cyByaXNpbmcgIGFmdGVyIHllYXJzIG9mIHN0YWduZW50IG1vdmVz
LiAgIExldHMganVzdCBzdGF5IGNhdXRpb3VzLg0NT3VyIHJlc2VhcmNoIHNob3dzIHBvdGVudGlh
bCBvcHBvcnR1bml0aWVzIGluIHRoZSBmb2xsb3dpbmcgc3RvY2tzOg0NQmF5IE5ldHdvcmtzIElu
Yy4gKFUuUy4gT1RDLCBTeW1ib2w9Qk5FVCwgUHJpY2U9KQ1UaGlzIENhbGlmb3JuaWEgYmFzZWQg
Y29tcGFueSBtYW51ZmFjdHVyZXMgbmV0d29ya2luZyBlcXVpcG1lbnQsbWFya2V0cyxhIG5kIHNl
cnZpY2VzIHRoZW0gaW4gYm90aCAJdGhlIFUuUy4gYW5kIGFicm91ZC4gIEl0IGhhcyAxMTEgb2Zm
aWNlcyBzZWFyY2hlc25ld3NsZXR0ZXJoYW5kZnVsZWxlY3Ryb25pY2FsbHlzdWJzY3JpYmVyc25l
d3NsZXR0ZXJyZWNlaXZpbmdVU29mIGEgeWVhciBzdGFnbmFudFVTZXF1aXBtZW50LCBtYXJrZXRz
YW5kVVNhYnJvYWROZXR3b3JrknNwYXJ0bmVyc2JlbGlldmVkMTk5NSBFUFNVU1VTJFVTJAlVUyBw
b3RlbnRpYWxseXRyYWRlIGNvbnNlcnZhdGl2ZWx5VVNDb3JwLlVTY29tcGFueSBiYW5raW5nYmVs
aWV2ZWRVU2RpdmlkZW5kcy4xOTk1IEVQU1VTVVMgIGZvciAxOTk2LlVTIHRvIDIyCWFuZC4NQmFy
cmV0dCBCdXNpbmVzcyBTZXJ2aWNlcyBJbmMuVVNCQlNJDVRoaXMgT3JlZ29uIGJhc2VkIGNvbXBh
bnkgY2F0ZXJzIGJ1c2luZXNzZXMgd2l0aCB0ZW1wb3Jhcnkgc3RhZmZpbmcuDVRoZSBjb21wYW55
IGhhcyBtb3JlIHRoYW4gNTAwIGNsaWVudHMgaW4gdGhlIE1hcnlsYW5kLCBPcmVnb24sIGFuZCBX
YXNoaW5ndG9uIHN0YXRlcy4gDUluc3RpdHV0aW9ucyBob2xkIDQ3DTZUaGVyZSB3ZXJlIGxhcmdl
IHZvbHVtZXMgb2YgdHJhZGluZyBpbiBEZWNlbWJlciBvZiAxOTk1LCBhbmQgSmFudWFyeSAxOTk2
Lg0xOTk1IEVQU1VTMC42MCB2ZXJzZXMgVVMkMC41MyBpbiAxOTk0LglVUzAuODMgdG8gMC44NSBm
b3IgMTk5Ni5CYXNlZCBvbiAxOTk1IHByaWNlIHBlciBlYXJuaW5ncyByYXRpbyB0aGUgc3RvY2sg
c2hvdWxkIHRyYWRlIGFzIGhpZ2ggYXMgVVMgJDI1IHRoaXMgeWVhckFuYWx5c3RzIGV4cGVjdGF0
aW9ucyB0byBhY2hpZXZlIHRoZSBleHBlY3RlZCBlYXJuaW5ncyBhcmUgdmVyeSBoaWdoLg0gZ3Vh
cmFudGVlYXZhaWxhYmxlaW5mbGFtbWF0aW9uc3NvbGljaXRhdGlvbnJlc2VhcmNoDQ1CZXN0IFdp
c2hlcyBPbiB0aGUgYmVoYWxmIG9mIHRoZSBJbnRlcmdsb2JlIEludmVzdG1lbnQgTmV3c2xldHRl
ciBhbmQgbXlzZWxmICB3aXNoaW5nIHlvdSBhIGhlYWx0aHksIGFuZCBwcm9zcGVyb3VzIG1vbnRo
LiAgR29kIEJsZXNzIHlvdS4NUm9iZXJ0IFNoYXRpa2lhbiwgUHJlc2lkZW50ICYgUHVibGlzaGVy
AAAAcCAAAHIgAAB4IAAAgSAAAIkgAACRIAAAmSAAAJsgAACeIAAAoSAAAKIgAACkIAAApSAAALAg
AADEIAAAxiAAAMsgAADNIAAA1CAAANUgAADcIAAA5CAAAOYgAADvIAAA8CAAAPggAAD6IAAA/SAA
AAchAAAJIQAACyEAAAwhAAANIQAADyEAABAhAAATIQAAFCEAABUhAAAzIQAANSEAADkhAAA8IQAA
RSEAAEYhAABMIQAAfSEAAH4hAACDIQAAiiEAAKwhAAC2IQAAviEAAMIhAADMIQAA1CEAANUhAADW
IQAA6CEAAOkhAADqIQAA6yEAAOwhAAA3IgAAPyIAAEEiAABNIgAATyIAAFwiAABdIgAAXiIAAGAi
AABsIgAAdiIAAL8iAADBIgAAxSIAAM8iAAAUIwAAFSMAABYjAAAfIwAAKCMAADUjAABBIwAASSMA
AEsjAABWIwAAVyMAAFkjAABaIwAAXiMAAGUjAACYIwAApyMAAK4jAADlIwAA5iMAAOgjAADpIwAA
AAAAAAAAAAAAAAAAAAAA/gAAAAAAAAAAAAAAAAAAAAAAAAAAAP4AAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAA+gAAAAAAAPj6AAAAAAAAAAAAAAAAAAJVgQAGVYFWgV4BAAJW
gWLpIwAA8iMAAP0jAAAAKAAABCgAAAooAAALKAAAESgAABQoAAAdKAAAICgAACIoAAAqKAAAMCgA
ADIoAAA0KAAAPSgAAEQoAABQKAAAUigAAFQoAABVKAAAVigAAGIoAABjKAAAZCgAAGgoAABwKAAA
cigAAAAA/QAAAAAAAAAAAAAAAPsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAlWBAAJ1AQAA
HFVTJCA0MS44NzUzVVMkIDE5Ni41VVMkIDE1Ljc1dG8gZW5kaWxpZ2VudHNlYXJjaJJzYSBJbiBU
aGlzIElhcyAxOTk1TG9uZyB0ZXJtIGRlYnRhIGJ0TG9uZyB0ZXJtIGRlYnRhcmUgb3JtYXRpb25l
cwAAAAADFAAABAD/////BQD/////AgAEIP//AQAAIP//AgAAAAAAMg0AAAMUAAAAAEcAAAABAAAA
AAAAAAAAIQAAAC8AAAAwAAAAPgAAAN8BAADgAQAATwMAAFADAABeAwAAQwQAAEQEAAA4BQAAOQUA
AEgFAAA0BwAANQcAAHkHAAB6BwAAtAcAAEoIAADJCAAAGwkAAEAJAABcCQAAmAkAAN8JAADqCgAA
lwsAAJgLAADRCwAA+AwAAA4NAAAyDQAAeQ0AAKANAAAcDgAAqw4AAOQOAADlDgAAKw8AACwPAABx
DwAAyA8AAO0PAAADEAAAThAAAOoQAABEEQAAihEAAIsRAACZEQAATBMAAE0TAABcEwAA2xMAAAMU
AAAAAcAhHwEAAcAh6wAAAcAh6wAAAcAh6wAABMAh6wAAAcAh6wAABMAh6wAAAcAh6wAAAcAh6wAE
/8AhyQIAAcAh6wAE/8Ah1wIAAcAh6wAAAcAh6wAABcAh6wAAAcAh6wAAAcAh6wAAAcAh6wAAAcAh
6wAE/8Ah5QEE/8Ah5QEAAcAh+gAAAcAh+gAAAcAh+gAAAcAh+gAAAcAh+gAE/8Ah0AIE/8Ah5QEA
AcAh6wAAAcAh6wAE/8Ah0AIAAcAh+gAAAcAh+gAAAcAh+gAAAcAh+gAE/8Ah5QEE/8Ah5QEAAcAh
+gAAAcAh6wAAAcAh6wAAAcAh6wAAAcAh+gAAAcAh+gAAAcAh+gAAAcAh+gAAAcAh+gAE/8Ah5QEA
AcAh+gAAAcAh+gAAAcAh6wAAAcAh6wAABMAh6wAAAcAh6wAAAcAh6wAAAsAh6wAAAcAh6wAAAwAA
FwkAAEMNAAAZEwAAcCAAAOkjAAByKAAAAgALAAwADQASABMAAAMAAJMTAADWIwAAAwAOALABDUpv
aG4gSC4gUGF0a2UlQzpcV0lORE9XU1xXSU5XT1JEXExFVFRFUlNcTldTTFRSLkZFQg1Kb2huIEgu
IFBhdGtlJ0M6XFdJTkRPV1NcV0lOV09SRFxMRVRURVJTXEdMT0JfRkVCLkRPQw1Kb2huIEguIFBh
dGtlJ0M6XFdJTkRPV1NcV0lOV09SRFxMRVRURVJTXEdMT0JfRkVCLkRPQw1Kb2huIEguIFBhdGtl
J0M6XFdJTkRPV1NcV0lOV09SRFxMRVRURVJTXEdMT0JfRkVCLkRPQw1Kb2huIEguIFBhdGtlJ0M6
XFdJTkRPV1NcV0lOV09SRFxMRVRURVJTXEdMT0JfRkVCLkRPQw1Kb2huIEguIFBhdGtlJ0M6XFdJ
TkRPV1NcV0lOV09SRFxMRVRURVJTXEdMT0JfRkVCLkRPQw1Kb2huIEguIFBhdGtlJ0M6XFdJTkRP
V1NcV0lOV09SRFxMRVRURVJTXEdMT0JfRkVCLkRPVA1Kb2huIEguIFBhdGtlJ0M6XFdJTkRPV1Nc
V0lOV09SRFxMRVRURVJTXEdMT0JfRkVCLkRPVP9AV0lORkFYAENPTTI6AFdJTkZBWABXSU5GQVgA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAANAAGEBAwQAAAEAAQAAAAAAAAAAAAAA/P8AAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAABZZXMAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADk2MAAANjAAAAAAAAAA
AE5vbmUAAAAAAAAAAAAAAFRvbmUAAENvbm5lY3QAAAAAAAAAAE1lZAAAAABDOlxXSU5GQVhcZGF0
YVwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAV0lORkFYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwADQABhAQMEAAAB
AAEAAAAAAAAAAAAAAPz/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAWWVzAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAA5NjAAADYwAAAAAAAAAABOb25lAAAAAAAAAAAAAABUb25lAABDb25uZWN0AAAAAAAAAABN
ZWQAAAAAQzpcV0lORkFYXGRhdGFcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAd29y
bGR3aWRlLg1CYXkgTmV0d29ya3OScyBrZXkgYWxsaWFuY2UgcGFydGVuZXJzIGFyZSBBcHBsZSwg
QVRULCBHVEUsIEhld2xldCBQYWNrYXJkLCBJQk0sIEludGVsIGFuZCBzZXZlcmFsICAgICAgICAJ
b3RoZXIgY29tcHV0ZXIgZ2lhbnRzLg1JdHMgYnVzaW5lc3MgaXMgYmVsaWV2ZWQgdG8gYmUgaW4g
dG9wIDI1JSBvZiBpbmR1c3RyeSBncm91cHMgZm9yIHBlcmZvcm1hbmNlLg1JbnN0aXR1dGlvbnMg
aG9sZCAyNyUgb2YgaXRzIHNoYXJlcy4NTG9uZyB0ZXJtIGRlcHRoIGlzIGlzIG9ubHkgMTUlLg1D
dXJyZW50bHkgaXQgdHJhZGVzIGNsb3NlIHRvIGl0cyB0d28gbW9udGhzIG1vdmluZyBhdmVyYWdl
Lg1UaGUgc3RvY2sgaXMgYmVsaWV2ZCB0byBiZSA2MCUgbGVzcyB2b2xhdGlsZSB0aGFuIHRoZSBn
ZW5lcmFsIG1hcmtldC4NMTk5NUVQUyAoRWFybmluZ3MgUGVyIFNoYXJlIGJ1dCBub3QgZm9yIHRo
ZSBmaXNjYWwgeWVhcikgd2VyZSBVLlMuICQxLjE1LiAgVGhlcmUgd2FzIG9uZSB0aW1lIGNoYXJn
ZSBvZiAJVS5TLiAkMC4wNyBwZXIgc2hhcmUgZm9yIHRoZSBwdXJjaGFzZSBvZiBYeWxvZ2ljcyBj
b21wYW55LiAgQW5hbHlzdHMgRVBTIGV4cGVjdGF0aW9ucyBhcmUgVS5TLiAJJDEuNDAgdG8gMS40
NSwgYW5kIFUuUy4gJDEuNzAgdG8gJDEuNzUgZm9yIDE5OTYgYW5kIDE5OTcgcmVzcGVjdGl2ZWx5
LiANQmFzZWQgb24gdGhlIGF2ZXJhZ2Ugb2YgaGlnaCBhbmQgbG93IFBFIChwcmljZSBwZXIgRWFy
bmluZ3MpIHJhdGlvcyBvdmVyIHRoZWxhc3QgdGhyZWUgeWVhcnMgdGhlIHN0b2NrIAlzaG91bGQg
cG90ZW50aWFseSB0cmFkZWNuc2VydmF0aXZlbHkgYXQgYXJvdW5kIFUuUy4gJDUzIHRoaXMgeWVh
cg0NQ2Fyb2xpbmEgRmlyc3QgQ29ycCAoVS5TLiBPVEMsIFN5bWJvbD1DQUZDLCBQcmljZT0pDQ0N
DQ0NRGlzY2xhaW1lcjoNQWx0aG91Z2ggdGhlIGluZm9ybWF0aW9uIHByb3ZpZGVkIGluIHRoaXMg
bmV3c2xldHRlciB3YXMgb2J0YWluZWQgZnJvbSB2YXJpb3VzIHJlbGlhYmxlIHNvdXJjZXMsIGhv
d2V2ZXIsIG5laXRoZXIgdGhlIG5ld3NsZXR0ZXIgbm9yIGl0cyBwdWJsaXNoZXIgZ3VyYW50ZWUg
aXRzIGFjY3VyYWN5LiAgVGhlIG9waW5pb25zIGFuZCB0YXJnZXQgcHJpY2VzIGFyZSBvbmx5IGJh
c2VkIG9uIHRoZSBhdmlhbGFibGUgaW5mb21hdGlvbnMgYW5kIHB1Ymxpc2hlcpJzIGV4cGVyaWVu
Y2UuICBUaGUgaW5mb3JtYXRpb24gcHJvdmlkZWQgZG8gbm90IGNvbnN0aXR1dGUgYSBzb2xpc2l0
aW9uIHRvIGJ1eSBvciBzZWxsIGFueSBzZWN1cml0aWVzLiAgSW52ZXN0b3JzIHNob3VsZCBwZXJm
b3JtIHRoZWlyIG93biByZXNlcmNoIGJlZm9yZSBpbnZlc3RpbmcgYW55IG1vbmV5LnRoZSAuVGhp
cyBpcyB0aGUgbW90aGVyIGNvbXBhbnkgZm9yIDU1IGJhbmtpbmcgb2ZmaWNlcyBpbiBTb3V0aCBD
YXJvbGluYS4gIFRoZSBjb21hbnkgbm90IG9ubHkgaXMgaW4gdGhlIHRyYWRpdGlvbmFsAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFwkAABgJ
AAAjCQAALgkAAC8JAAAyCQAAXAkAAF0JAABkCQAAbQkAAG4JAAB2CQAAdwkAAJAJAACRCQAAkwkA
AJQJAACmCQAAMQoAADIKAABGCgAATwoAAGMKAABmCgAAZwoAAIQKAACKCgAAjgoAAI8KAACRCgAA
ngoAAJ8KAACpCgAArAoAAK4KAAC3CgAAvAoAAL8KAADACgAAygoAAOQKAADmCgAA7woAAPAKAAAC
CwAAAwsAAAULAAARCwAAEgsAABMLAAApCwAAKgsAAFELAABSCwAAXgsAAGwLAABtCwAAbwsAAHQL
AAB/CwAAhgsAAIcLAACdCwAAoQsAAKILAACkCwAApQsAALALAADwCwAA9AsAAPULAAACDAAARAwA
AEgMAABKDAAAXQwAAF4MAABnDAAAaAwAAGkMAAB9DAAAowwAAK0MAADKDAAAywwAAMwMAADqDAAA
7AwAAPkMAAD6DAAA+wwAAP4MAAAQDQAAEQ0AABoNAAAbDQAAHA0AADANAABDDQAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP7++gAAAAAAAAAAAAAAAAAAAAAA
AAD+AAAAAAAAAAAAAPgAAAAAAAAA/v76AAAAAAAAAAAAAANjFgAGVYFWgV4BAAJVgWJDDQAATw0A
AGwNAABuDQAAbw0AAJcNAACaDQAA3Q0AACcOAAAoDgAAOw4AAEAOAABQDgAAUQ4AAGgOAABtDgAA
eA4AAHkOAACBDgAAgg4AAJUOAACWDgAAmw4AAJwOAACfDgAAuA4AALkOAAC/DgAAwQ4AAM8OAADQ
DgAA2A4AANkOAADfDgAA+g4AAPwOAAD/DgAAAA8AADgPAABBDwAAUg8AAFgPAABcDwAAtQ8AANYP
AADXDwAA2g8AAAkQAAAKEAAACxAAABcQAABsEAAAbRAAAHUQAACKEAAAixAAAIwQAACOEAAAmxAA
AJwQAAC1EAAA2BAAAB0RAAAeEQAAKREAACwRAAAxEQAAMhEAAFoRAABoEQAAvBEAANgRAADbEQAA
3hEAAOkRAAD1EQAA9hEAAAkSAAAKEgAAFRIAACYSAAAnEgAAPxIAAEASAABEEgAATxIAAFMSAABp
EgAAahIAAHcSAACfEgAAsBIAALESAAC0EgAAtxIAANoSAADjEgAA5BIAAO8SAAD1EgAAGRMAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP4AAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAlaBZBkTAAAaEwAA
WxMAAFwTAABdEwAAcBMAAHYTAAB6EwAAgxMAAIcTAACREwAAkhMAAJYTAACgEwAAoRMAAKITAACr
EwAAwxMAAMQTAADWEwAA1xMAAPkTAAD6EwAASxQAAE4UAABQFAAAWhQAAGwUAAB9FAAAfhQAAJcU
AACYFAAApRQAAKcUAACyFAAACxUAAEoVAABLFQAATBUAAE0VAABTFQAAVxUAAFgVAAB3FQAAeRUA
AHoVAACeFQAAnxUAALIVAAC0FQAAtRUAALgVAAC8FQAAxxUAAAAeAABKHgAATR4AAHEeAACIHgAA
ih4AALUeAADZHgAA2h4AAN4eAADfHgAA4B4AAAcfAAAWHwAAFx8AACAfAAB6HwAAgB8AAIIfAACD
HwAAhh8AAI0fAACQHwAAtB8AAOwfAADtHwAA7x8AAPAfAADyHwAA9R8AAP4fAAAIIAAAEiAAABkg
AAAnIAAAMiAAADwgAABFIAAARyAAAFEgAABZIAAAWyAAAG0gAABwIAAAAAAAAP4AAAAAAAAA/Pz4
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD2AAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJ1AQAGVYFWgV4BAAJVgQACVoFhkxMAAJQTAACV
EwAAlhMAAKITAAC1HgAAzB4AAOAeAAAHHwAAIB8AAO0fAAAVIQAAOiEAAH8hAADWIQAA6yEAADci
AAAVIwAASiMAAEsjAADWIwAA/gABwCHrAP4AAcAh6wD+AAHAIesA/gABwCHrAN0E/8Ah0AK/AAHA
IfoAvwABwCH6AL8AAcAh+gC/BP/AIeUBvwABwCH6AP4AAcAh6wD+AAHAIesA3QABwCH6AL8AAcAh
+gC/AAHAIfoAvwABwCH6AL8AAcAh+gD+AAXAIesA/gABwCHrAP4AAsAh6wAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB0AAA0LDDT/AQAIAAABAAAAAQBoAQAAAAAA
ALcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAA0LEWgBE5j+DDT/AQAIAAABAAAA
AQBoAQAAAAAAALcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAABQgYmFua2luZyxi
dXQgYWxzbyBpdCBoYXMgYSBtb3J0Z2FnZSBibmtpbmcgYW5kIGF1dG9tb2JpbGUgZmluYW5jZSBj
b21wYW55LiAgVGhyZWUgb2YgaXRzIGJyYW5jaGVzIGFyZSBpbiBncm9jZXJ5IHN0b3Jlcy4gIFRo
ZXJlIGFyZSBwbGFucyB0byBvcGVuIGEgYnJhbmNoIGluIHRoZSBIaWx0b24gSGVhZCBob3RlbC4N
TG9uZyB0ZXJtIGRlcHRoIGlzIDElLg1JbnN0aXR1dGlvbnMgNW1vcmUuDUl0IHBheXMgVVMgJDAu
MDcgZGl2aWRlbnRzIHBlciBxdWFydGVyDS4wMi4gIEFuYWx5c3RzIAkgICQxLjMwLg1CYXNlZCBv
biB0aGUgY3VycmVudCBtb2Rlc3QgcHJpY2UgcGVyIGVhcm5pbmdzIHJhdGlvIG9mIDE3LCB0aGUg
c3RvY2sgc2hvdWxkIGVhc2lseSB0b3AgdG8gVS5TLiAkMjEgdG8gVS5TLiAJJDIyIGFuZCBjYW4g
dHJhZGUgZXZlbiBoaWdoZXIgdGhpcyB5ZWFyU2V2ZXJhbCBhbmFseXN0cyBoYXZlIHJhbmtlZCB0
aGUgc3RvY2sgQSBmb3IgdGltZWxpbmVzcy4NVVMgZW5kbyBkaWxpZ2VuY2VyZQAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABgAEAxRIAAMUSAAAJAACAAIDFEgAAAAAAAMMSAAABCAAF
AVWBVoFeAQEJABAAABEAABMAAAEPABAAABEAABMAAFWBVoFeAQI0GwAAAAAAACAAAAAhAAAALgAA
AC8AAAAwAAAAPQAAAD4AAAA/AAAAQAAAAEEAAABCAAAAQwAAAEQAAABFAAAARgAAAEcAAABIAAAA
SQAAAEoAAABLAAAATAAAAE0AAABOAAAATwAAAFAAAABRAAAAUgAAAFMAAABUAAAAVQAAAFYAAABX
AAAAWAAAAFkAAABaAAAAWwAAAFwAAABdAAAAXgAAAF8AAABgAAAAYQAAAGIAAABjAAAAZAAAAGUA
AABmAAAAZwAAAGgAAABpAAAAagAAAGsAAABsAAAAbQAAAG4AAABvAAAAcAAAAHEAAAByAAAAdQAA
AHwAAACKAAAAiwAAAJ0AAACxAAAAtgAAALcAAADCAAAAxQAAANMAAADUAAAA1QAAAOUAAADmAAAA
6QAAAPIAAADzAAAA+wAAAPwAAAAeAQAAJgEAACcBAAAoAQAANwEAADgBAAA8AQAAPgEAAEIBAABD
AQAARQEAAEYBAABNAQAAYgEAAGMBAABuAQAAeQEAAHoBAAB9AQAApwEAAKgBAACvAQAAsAEAALIB
AAC3AQAAuQEAALoBAAC7AQAAwwEAAMQBAADdAQAA3gEAAOABAADhAQAA8wEAABoCAAAiAgAAIwIA
ACUCAAArAgAAeQIAAHoCAACOAgAAlwIAAKsCAACuAgAArwIAALMCAAC9AgAAvwIAAM8CAADVAgAA
2QIAANoCAADcAgAA3QIAAOQCAADnAgAA6AIAAPICAAD1AgAA9wIAAAADAAAFAwAACAMAAAkDAAAT
AwAAGgMAABwDAAAvAwAAMQMAADoDAAA7AwAATQMAAE4DAABcAwAAXQMAAF4DAAB0AwAAdQMAAI8D
AACdAwAAngMAAKoDAACuAwAAuQMAALoDAAC8AwAAwQMAAMwDAADTAwAA1AMAAOoDAADuAwAA7wMA
APEDAADyAwAA8wMAAP0DAABCBAAATwQAAFoEAABjBAAAkQQAAJUEAACXBAAAqgQAAKsEAAC0BAAA
tQQAALYEAADKBAAA8AQAAPoEAAAXBQAAGAUAABkFAAA3BQAAOQUAAEIFAABGBQAARwUAAEgFAABL
BQAATAUAAE4FAABbBQAAXAUAAGUFAABmBQAAZwUAAHsFAACOBQAAmgUAALcFAAC5BQAAugUAAOIF
AADlBQAAKAYAAHIGAABzBgAAewYAAIIGAACJBgAAigYAAKEGAACmBgAAsQYAALIGAAC6BgAAuwYA
AM4GAADPBgAA1AYAANUGAADYBgAA8QYAAPIGAAD4BgAA+gYAAAgHAAAJBwAAEQcAABIHAAAYBwAA
MwcAADUHAAA4BwAAOQcAAHEHAAB6BwAAiwcAAI0HAACPBwAAkwcAAKgHAACsBwAAsgcAAOoHAAD8
BwAA/QcAAAAIAAAXCAAAGAgAABsIAAAcCAAAHggAACMIAAApCAAASAgAAEkIAABKCAAATggAAFcI
AABlCAAAbQgAAKkIAACqCAAAsggAAMcIAADICAAAyQgAAMsIAADYCAAA2QgAAOsIAADvCAAA9ggA
ABkJAAAtCQAALgkAAEAJAABMCQAATgkAAFEJAABaCQAAWwkAAGYJAABpCQAAbgkAAG8JAACXCQAA
pQkAAK0JAADfCQAA5wkAAPsJAAAXCgAAGgoAAB0KAAAeCgAAIAoAACYKAAAyCgAAMwoAADUKAABI
CgAASQoAAEwKAABRCgAAYgoAAGMKAAB7CgAAfAoAAIAKAACLCgAAjwoAAKAKAACjCgAApAoAAKkK
AACqCgAAsQoAALcKAAC5CgAA1woAAOgKAADpCgAA7AoAAO8KAAASCwAAGwsAABwLAAAnCwAALQsA
ADYLAAA3CwAAUgsAAFMLAABaCwAAZQsAAGYLAAB6CwAAhQsAAIcLAACVCwAAlgsAAJcLAACnCwAA
rAsAAK4LAACwCwAAtAsAAL0LAADBCwAAyQsAAM8LAADRCwAA8AsAAPILAADzCwAAFwwAABgMAAAb
DAAAIgwAACwMAAAuDAAALwwAADIMAAA2DAAAQQwAAEoMAABLDAAAZgwAAG0MAACNDAAAkAwAALQM
AADLDAAAzQwAAPgMAAAEDQAABQ0AAAYNAAAbDQAAIQ0AADINAAA/DQAARw0AAE4NAABPDQAAUg0A
AFYNAAB3DQAAeA0AAHkNAACBDQAAgw0AAIkNAACSDQAAng0AAJ8NAACgDQAAqA0AALwNAADYDQAA
2w0AAN4NAADfDQAA4Q0AAOQNAADzDQAA9w0AAAgOAAAJDgAADA4AABEOAAAbDgAAHA4AAFUOAABY
DgAAeA4AAHkOAAB7DgAAfA4AAH4OAAB/DgAAgQ4AAIIOAACDDgAAhQ4AAIYOAACJDgAAqQ4AAKoO
AACrDgAA4w4AAOQOAAADDwAABQ8AAAcPAAALDwAAFA8AABgPAAAgDwAAKQ8AACsPAAAuDwAANw8A
ADgPAAA+DwAAbw8AAHAPAAB1DwAAfA8AAJ4PAACoDwAAsA8AALQPAAC+DwAAxg8AAMcPAADIDwAA
2g8AANsPAADcDwAA7A8AAO0PAAD5DwAA+g8AAPsPAAD/DwAAABAAAAMQAABOEAAAVhAAAGoQAACG
EAAAiRAAAIwQAACNEAAAjxAAAJEQAACdEAAAnxAAAKAQAACtEAAArhAAAK8QAACwEAAAuRAAAL0Q
AADOEAAA0BAAANMQAADfEAAA6RAAAOoQAAAzEQAANREAADkRAABDEQAARBEAAIkRAACKEQAAkREA
AJURAACWEQAAlxEAAJgRAACZEQAAohEAAKYRAAC6EQAAuxEAAM0RAADOEQAA8BEAAPERAAAsEgAA
NRIAAEMSAABGEgAASBIAAFISAABkEgAAaBIAAHASAABxEgAAdRIAAH4SAAB/EgAAghIAAIoSAACL
EgAAmBIAAJoSAAClEgAAwxIAAMUSAADXEgAA4xIAAAITAAAnEwAALxMAAEITAABDEwAARBMAAEUT
AABLEwAATRMAAFgTAABZEwAAWhMAAFsTAABcEwAAXhMAAF8TAABjEwAAahMAAJ0TAACsEwAAsxMA
AOoTAADrEwAA7RMAAO4TAAD3EwAAAhQAAAMUAAABBEQDAAAAAAAEQgMAAAEAAQRkAwAAAAAABHED
AAAAAAAEcgMAAAAAAQRzAwAAAAAABIADAAAAAAEEgQMAAAAAAQSCAwAAAAABBIMDAAAAAAEEhAMA
AAAAAQSFAwAAAAABBIYDAAAAAAEEhwMAAAAAAQSIAwAAAAABBIkDAAAAAAEEigMAAAAAAQSLAwAA
AAABBIwDAAAAAAEEjQMAAAAAAQSOAwAAAAABBI8DAAAAAAEEkAMAAAAAAQSRAwAAAAABBJIDAAAA
AAEEkwMAAAAAAQSUAwAAAAABBJUDAAAAAAEElgMAAAAAAQSXAwAAAAABBJgDAAAAAAEEmQMAAAAA
AQSaAwAAAAABBJsDAAAAAAEEnAMAAAAAAQSdAwAAAAABBJ4DAAAAAAEEnwMAAAAAAQSgAwAAAAAB
BKEDAAAAAAEEogMAAAAAAQSjAwAAAAABBKQDAAAAAAEEpQMAAAAAAQSmAwAAAAABBKcDAAAAAAEE
qAMAAAAAAQSpAwAAAAABBKoDAAAAAAEEqwMAAAAAAQSsAwAAAAABBK0DAAAAAAEErgMAAAAAAQSv
AwAAAAABBLADAAAAAAEEsQMAAAAAAQSyAwAAAAABBLMDAAAAAAEEtAMAAAAAAQS1AwAAAAABBLgD
AAAAAAEEvwMAAAAAAQTNAwAAAAABBM4DAAAAAAEE4AMAAAAAAQT0AwAAAAABBPkDAAAAAAEEaggA
AAAAAQQdKAAAAAABBHUIAAAAAAEEgwgAAAAAAQSECAAAAAABBIgIAAAAAAEEmAgAAAAAAQSZCAAA
AAABBJwIAAAAAAEEpQgAAAAAAQSmCAAAAAABBK4IAAAAAAEErwgAAAAAAQTRCAAAAAABBNkIAAAA
AAEE2ggAAAAAAQTbCAAAAAABBOoIAAAAAAEE6wgAAAAAAQTtHwAAAAABBPMIAAAAAAEE9wgAAAAA
AQT4CAAAAAABBPoIAAAAAAEE+wgAAAAAAQQCCQAAAAABBBcJAAAAAAEEGAkAAAAAAQQjCQAAAAAB
BC4JAAAAAAEELwkAAAAAAQQyCQAAAAABBFwJAAAAAAEEXQkAAAAAAQRkCQAAAAABBCAoAAAAAAEE
ZwkAAAAAAQTwHwAAAAABBGwJAAAAAAEEbQkAAAAAAQRuCQAAAAABBHYJAAAAAAEEdwkAAAAAAQSQ
CQAAAAAABJEJAAAAAAEEkwkAAAAAAQSUCQAAAAABBKYJAAAAAAEEIigAAAAAAQTZCQAAAAABBP4f
AAAAAAEEKigAAAAAAQTjCQAAAAABBDEKAAAAAAEEMgoAAAAAAQRGCgAAAAABBE8KAAAAAAEEYwoA
AAAAAQRmCgAAAAABBGcKAAAAAAEECCAAAAAAAQQwKAAAAAABBHQKAAAAAAEEhAoAAAAAAQSKCgAA
AAABBI4KAAAAAAEEjwoAAAAAAQSRCgAAAAABBBIgAAAAAAEEmwoAAAAAAQSeCgAAAAABBJ8KAAAA
AAEEqQoAAAAAAQSsCgAAAAABBK4KAAAAAAEEtwoAAAAAAQS8CgAAAAABBL8KAAAAAAEEwAoAAAAA
AQTKCgAAAAABBDIoAAAAAAEE0QoAAAAAAQTkCgAAAAABBOYKAAAAAAEE7woAAAAAAQTwCgAAAAAB
BAILAAAAAAAEAwsAAAAAAQQRCwAAAAAABBILAAAAAAEEEwsAAAAAAQQpCwAAAAABBCoLAAAAAAEE
GSAAAAAAAQRRCwAAAAABBFILAAAAAAEEXgsAAAAAAQQnIAAAAAABBGwLAAAAAAEEbQsAAAAAAQRv
CwAAAAABBHQLAAAAAAEEfwsAAAAAAQSGCwAAAAABBIcLAAAAAAEEnQsAAAAAAQShCwAAAAABBKIL
AAAAAAEEpAsAAAAAAQSlCwAAAAABBDIgAAAAAAEEsAsAAAAAAAT1CwAAAAABBAIMAAAAAAEEPCAA
AAAAAQQWDAAAAAABBEQMAAAAAAEESAwAAAAAAQRKDAAAAAABBF0MAAAAAAEEXgwAAAAAAQRnDAAA
AAABBGgMAAAAAAEEaQwAAAAAAQR9DAAAAAABBKMMAAAAAAEErQwAAAAAAQTKDAAAAAABBMsMAAAA
AAEEzAwAAAAAAATqDAAAAAABBDQoAAAAAAEE9QwAAAAAAQT5DAAAAAAABPoMAAAAAAEE+wwAAAAA
AQT+DAAAAAABBEUgAAAAAAEEAw0AAAAAAQQQDQAAAAABBBENAAAAAAEEGg0AAAAAAQQbDQAAAAAB
BBwNAAAAAAEEMA0AAAAAAQRDDQAAAAABBE8NAAAAAAEEbA0AAAAAAQRuDQAAAAABBG8NAAAAAAEE
lw0AAAAAAQSaDQAAAAABBN0NAAAAAAEEJw4AAAAAAQQoDgAAAAABBEogAAAAAAEEPSgAAAAAAQRQ
DgAAAAABBFEOAAAAAAEEaA4AAAAAAQRtDgAAAAABBHgOAAAAAAEEeQ4AAAAAAQSBDgAAAAABBIIO
AAAAAAEElQ4AAAAAAQSWDgAAAAABBJsOAAAAAAEEnA4AAAAAAQSfDgAAAAABBLgOAAAAAAEEuQ4A
AAAAAQS/DgAAAAABBMEOAAAAAAEEzw4AAAAAAQRRIAAAAAABBNgOAAAAAAEE2Q4AAAAAAQTfDgAA
AAAABPoOAAAAAAEE/A4AAAAAAQT/DgAAAAABBAAPAAAAAAAEOA8AAAAAAQRBDwAAAAABBFIPAAAA
AAEEWSAAAAAAAQRYDwAAAAABBFwPAAAAAAEEACgAAAAAAQQEKAAAAAAABHEPAAAAAAEEWyAAAAAA
AQS8DwAAAAABBG0gAAAAAAEEvw8AAAAAAQTWDwAAAAABBNcPAAAAAAEE2g8AAAAAAQRwIAAAAAAB
BN8PAAAAAAEEciAAAAAAAQTqDwAAAAABBAkQAAAAAAAEChAAAAAAAQQLEAAAAAABBHggAAAAAAEE
GRAAAAAAAQSBIAAAAAABBDAQAAAAAAEEbBAAAAAAAQRtEAAAAAABBHUQAAAAAAEEihAAAAAAAASL
EAAAAAABBIwQAAAAAAEEjhAAAAAAAQSbEAAAAAABBJwQAAAAAAEEUxUAAAAAAQSuEAAAAAABBLUQ
AAAAAAAE2BAAAAAAAQQKKAAAAAAABO0QAAAAAAEERCgAAAAAAQRQKAAAAAABBA4RAAAAAAEEFBEA
AAAAAQQdEQAAAAAABB4RAAAAAAEEKREAAAAAAQQsEQAAAAABBDERAAAAAAEEMhEAAAAAAARaEQAA
AAABBIkgAAAAAAAEbxEAAAAAAQSRIAAAAAABBKgRAAAAAAEEvBEAAAAAAQTYEQAAAAABBNsRAAAA
AAEE3hEAAAAAAQSZIAAAAAABBOMRAAAAAAEE6REAAAAAAQT1EQAAAAABBFIoAAAAAAEE9hEAAAAA
AQQJEgAAAAABBJsgAAAAAAEEEBIAAAAAAQQVEgAAAAABBCYSAAAAAAEEJxIAAAAAAQQ/EgAAAAAB
BEASAAAAAAEERBIAAAAAAQRPEgAAAAABBFMSAAAAAAEEniAAAAAAAQRoEgAAAAABBGsSAAAAAAEE
oSAAAAAAAQRwEgAAAAABBHcSAAAAAAEEoiAAAAAAAQSBEgAAAAABBJ8SAAAAAAEEsBIAAAAAAASx
EgAAAAABBLQSAAAAAAEEtxIAAAAAAQTaEgAAAAABBOMSAAAAAAEE5BIAAAAAAQTvEgAAAAABBPUS
AAAAAAEEpCAAAAAAAQT+EgAAAAABBBkTAAAAAAEEGhMAAAAAAQSlIAAAAAABBCsTAAAAAAEEsCAA
AAAAAQQ+EwAAAAABBMQgAAAAAAEETRMAAAAAAQRXFQAAAAAABFsTAAAAAAAEXBMAAAAAAQTGIAAA
AAABBHATAAAAAAEEyyAAAAAAAQR2EwAAAAABBHoTAAAAAAEEgxMAAAAAAQSHEwAAAAABBAsoAAAA
AAAEjxMAAAAAAQRYFQAAAAABBHcVAAAAAAEEeRUAAAAAAQR6FQAAAAABBJ4VAAAAAAEEnxUAAAAA
AQTNIAAAAAABBKgVAAAAAAEEshUAAAAAAQS0FQAAAAABBLUVAAAAAAEEuBUAAAAAAQS8FQAAAAAB
BAAeAAAAAAEE1CAAAAAAAQQJHgAAAAABBNUgAAAAAAEEKh4AAAAAAQRKHgAAAAABBE0eAAAAAAEE
cR4AAAAAAQSIHgAAAAAABIoeAAAAAAEEtR4AAAAAAQRUKAAAAAABBFUoAAAAAAAExB4AAAAAAQTn
EAAAAAAABO4QAAAAAAEEWxEAAAAAAQTcIAAAAAABBG8RAAAAAAEE2R4AAAAAAQR3EQAAAAABBNoe
AAAAAAEEfhEAAAAAAQTeHgAAAAAABN8eAAAAAAEE4B4AAAAAAQTkIAAAAAABBOseAAAAAAEE5iAA
AAAAAQT6HgAAAAABBO8gAAAAAAAEBh8AAAAAAQTwIAAAAAABBKgRAAAAAAEEvBEAAAAAAQTYEQAA
AAABBNsRAAAAAAEE3hEAAAAAAQT4IAAAAAABBOMRAAAAAAEEBx8AAAAAAQRPEgAAAAABBFMSAAAA
AAEEFh8AAAAAAQT6IAAAAAABBBkfAAAAAAEE/SAAAAAAAAQfHwAAAAABBCAfAAAAAAEEESgAAAAA
AQRaHwAAAAABBHofAAAAAAEEByEAAAAAAQR/HwAAAAABBIAfAAAAAAEEgh8AAAAAAQQJIQAAAAAB
BAshAAAAAAEEDCEAAAAAAQQNIQAAAAABBA8hAAAAAAEEECEAAAAAAQSUHwAAAAABBBMhAAAAAAAE
kRMAAAMAAQS0HwAAAAAABOwfAAAAAAAEFCEAAAAAAQRwEwAAAAABBDMhAAAAAAEEdhMAAAAAAQR6
EwAAAAABBDUhAAAAAAEEhxMAAAAAAQQUKAAAAAAABI8TAAAAAAAEOSEAAAAAAQQ8IQAAAAABBEUh
AAAAAAEERiEAAAAAAQRMIQAAAAABBH0hAAAAAAAEfiEAAAAAAQSDIQAAAAABBIohAAAAAAEErCEA
AAAAAQS2IQAAAAABBL4hAAAAAAEEwiEAAAAAAQTMIQAAAAABBNQhAAAAAAAE1SEAAAAAAQTWIQAA
AAABBOghAAAAAAEE6SEAAAAAAQTuEAAAAAAABOohAAAAAAEEVigAAAAAAQRiKAAAAAABBGMoAAAA
AAEExB4AAAAAAQTrIQAAAAAABMkeAAAAAAAE7CEAAAAAAQQ3IgAAAAABBKgRAAAAAAEEvBEAAAAA
AQTYEQAAAAABBNsRAAAAAAEE3hEAAAAAAQQ/IgAAAAABBOMRAAAAAAEEQSIAAAAAAQRNIgAAAAAB
BOMRAAAAAAEETyIAAAAAAQRcIgAAAAABBAwfAAAAAAEEXSIAAAAAAQQNHwAAAAABBE8SAAAAAAEE
UxIAAAAAAQReIgAAAAABBBcfAAAAAAEEYCIAAAAAAQRsIgAAAAAABB8fAAAAAAEEdiIAAAAAAQS/
IgAAAAABBMEiAAAAAAEExSIAAAAAAATLHgAAAAABBM8iAAAAAAAEFCMAAAAAAASVEwAAAAABBJwT
AAAAAAEEoBMAAAAAAQSuEwAAAAABBBUjAAAAAAAEoRMAAAAAAQSiEwAAAAABBKsTAAAAAAEErxMA
AAAAAQTDEwAAAAABBMQTAAAAAAEE1hMAAAAAAQTXEwAAAAAAAQVaIwAAAAABBV4jAAAAAAEFZSMA
AAAAAQWYIwAAAAABBacjAAAAAAAFriMAAAAAAQXlIwAAAAABBeYjAAAAAAEF6CMAAAAAAQXpIwAA
AAABBfIjAAAAAAAFQwMAAAUAMQAVFpABAABUaW1lcyBOZXcgUm9tYW4ADBaQAQIAU3ltYm9sAAsm
kAEAAEFyaWFsACIABAABCIgYAADQAgAAaAEAAAAAKg0ChqwTAqYAAAAABwD5AAAAAAAAAAAAAAAA
AAAAAAAEAIMQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAkI3AAAABCV2VsY29tZSB0byB0aGUg
ZmlzdCBpc3N1ZSBvZiB0aGUgSW50ZXJnbG9iZSBJbnZlc3RtZW50IE5ld3NsZXR0ZXIuAAAADUpv
aG4gSC4gUGF0a2UNSm9obiBILiBQYXRrZQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEE+RMAAAAAAQT6EwAAAAABBBYjAAAA
AAEEPRQAAAAAAQRLFAAAAAABBE4UAAAAAAEEUBQAAAAAAQRaFAAAAAABBGQoAAAAAAEEdRQAAAAA
AQR9FAAAAAABBH4UAAAAAAEEHyMAAAAAAQSLFAAAAAABBCgjAAAAAAEEaCgAAAAAAQSXFAAAAAAB
BJgUAAAAAAEEpRQAAAAAAQSnFAAAAAABBLIUAAAAAAEEcCgAAAAAAQTQFAAAAAABBDUjAAAAAAEE
7BQAAAAAAQQLFQAAAAABBEEjAAAAAAEENxUAAAAAAQRKFQAAAAABBEsVAAAAAAEETBUAAAAAAQRN
FQAAAAAABEkjAAAAAAEESyMAAAAAAQSgEwAAAAABBK4TAAAAAAEEViMAAAAAAAShEwAAAAABBFcj
AAAAAAEEWSMAAAAAAQRaIwAAAAABBF4jAAAAAAEEZSMAAAAAAQSYIwAAAAABBKcjAAAAAAAEriMA
AAAAAQTlIwAAAAABBOYjAAAAAAEE6CMAAAAAAQTpIwAAAAABBPIjAAAAAAAEQwMAAAUAMQAVFpAB
AABUaW1lcyBOZXcgUm9tYW4ADBaQAQIAU3ltYm9sAAsmkAEAAEFyaWFsACIABAABCIgYAADQAgAA
aAEAAAAAKg0ChpYUAqYAAAAACAALAQAAAAAAAAAAAA==
--itdwmyyuaiagqtxhijyxwujobfieyr--


From melanie@greatnet.uwcv.edu  Sat Feb 10 11:55:37 1996
Return-Path: <melanie@greatnet.uwcv.edu>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA12965; Sat, 10 Feb 96 11:55:37 CST
Received: from gold.chem.hawaii.edu by cli.com (4.1/SMI-4.1)
	id AA00415; Sat, 10 Feb 96 11:55:35 CST
Received: from [204.162.179.229] (chi-pm2-5.freeppp.com) by gold.chem.hawaii.edu (4.1/gold-MX-1.9)
	id AA01166; Sat, 10 Feb 96 05:50:33 HST
X-Sender: melanie@greatnet.uwcv.edu (Unverified)
Message-Id: <v01530500ad4264312d16@[204.162.179.237]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Reply-To: fax.number.or.smail.address.shown.below@thank.you
Approved: moderator
X-Priority: 2 (High)
Date: Fri, 9 Feb 1996 07:59:32 +0100
To: melanie@greatnet.uwcv.edu
From: 1melanie@greatnet.uwcv.edu (Melanie Tsai)
Subject: =====>>> *Fantastic* FREE offer I discovered on the 'net

-----> NOTE:   Please first read my note which appears below the "Request
for more info Form."  Then, to get more info, just fill out the "Request
for More Info" form completely and *FAX* or *SMAIL* it back to the company.
You will get a quick reply via email within 1 business day of receipt of
the info request form below.

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* if
your fax:
1. has a cover page;
2. is more than one page
3. does not begin with the "cut here/begin" line from the below form
4. does not end with the "cut here/end" line from the below form.
5. has any handwritten info. on it (info must must be filled out *only*
    with your computer keyboard or typewriter keyboard).  This last
    provision re:  no handwriting on the form applies to requests sent in
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.  If you
have trouble getting through to their fax, or do not have a fax machine at
work or at home, just drop the below form to them via smail (airmail or
first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.  :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Melanie Tsai.
021096-lnlnln

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as
     you still have to know how to deal with an attached file.  It will cut
     your download time by 75%.   Expands out to the same ~525K file in
     option #2.  See option #2 for more info on what you will need to be
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Melanie Tsai and I recently started using a magazine
subscription club in the USA that has a FREE 1 yr. magazine subscription
deal with your first paid order- and I have been very pleased with them.
They have over 1,500 different USA titles that they can ship to any country
on a subscription basis.   As for computer magazines from the USA, they
more of a selection than I ever knew even existed.  They have magazines for
most every area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half
of what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people
buy magazines and then toss them after reading them for just a few minutes
or hours.  They are so cheap in the USA!   Well, this company would like to
make it the same way for their overseas members.  They are also cheaper
than all their competitors in the USA and overseas, including the
publishers themselves!   This is their price guarantee.  Around one-half
their business comes from overseas, so they are very patient with new
members who only speak limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

Please do not email me as I am just a happy customer and a *busy* student.
I don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are
less than half of the next best deal I have been able to find and other
times, just a little cheaper - but I have never found a lower rate yet.
They assured me that if I ever do, they will beat it.

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from
a special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a
charge for FPH (foreign postage and handling) (on both paid and freebie
subs) that varies from magazine to magazine.  I have found their staff to
be very friendly and courteous.  They even helped me with an address change
when I moved from one country to another.

The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls
you personally on the phone to explain how he works his deal, or sometimes
he has one of his assistants call.  He is kind of quirky sometimes - he
insists on setting up new members by phone so he can say hi to everyone (I
sure wouldn't want to have his phone bills!),  but you can place future
orders (after your first order) via E-mail.

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas,
he will even call you there, as long as you are interested, but I think he
still makes all his overseas calls on the weekends, I guess cause the long
distance rates are cheaper then.

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had
a 2-3 week waiting list for new members to be called back so that they
could join up. (Once you are an existing member, they help you immediately
when you call. )  I think they are able to get back to prospective new
members  the same day or within a few days now, as they have increased
their staff.  I am not sure about this.........but if you email the above
form to them, that is the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what
he sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Melanie Tsai


ps.  please forward a copy of this message to all your friends on the net
who you think might be interested in it!  It is a great deal!  If you join
and then they join after you, you will earn a free 1 yr. subscription for
each new person you get to join after you join!   If you exceed 25
referrals, they let you use them to give away as gifts, for Christmas,
Chanukah or any other occasion.  Please be kind enough to mention my name
when you join.   I will then get a free magazine for a year for referring
you.
Thank you.




From kepser@cis.uni-muenchen.de  Mon Feb 12 16:00:04 1996
Return-Path: <kepser@cis.uni-muenchen.de>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA13744; Mon, 12 Feb 96 16:00:04 CST
Received: from cis.uni-muenchen.de (thecube.cis.uni-muenchen.de) by cli.com (4.1/SMI-4.1)
	id AA05373; Mon, 12 Feb 96 15:59:54 CST
Received: (from kepser@localhost) by cis.uni-muenchen.de (8.7.3/8.7.2) id WAA05111 for nqthm-users@cli.com; Mon, 12 Feb 1996 22:59:25 +0100 (MET)
Date: Mon, 12 Feb 1996 22:59:25 +0100 (MET)
From: Stephan Kepser <kepser@cis.uni-muenchen.de>
Message-Id: <199602122159.WAA05111@cis.uni-muenchen.de>
To: nqthm-users@cli.com
Subject: CfParticipation  FroCoS'96


                       Call for Participation

                    First International Workshop

                 ``Frontiers of Combining Systems''
                             FroCoS'96

                 March 26-29, 1996, Munich, Germany.


Information and Program in the WWW:
  http://www-lti.informatik.rwth-aachen.de/~stephan/frocos96.html

  (http://www.cis.uni-muenchen.de/hot/frocos96.html)


In order to simplify our organisation we would kindly ask you to

	register no later than 11.03.1996.
 

In various areas of logic, computation, language processing, and
artificial intelligence there is an obvious need for using specialized
formalisms and inference mechanisms for special tasks. In order to be
usable in practice, these specialized systems must be combined with
each other, and they must be integrated into general purpose systems.
The development of general techniques for the combination and
integration of special systems has been initiated in many areas,
and the Workshop ``Frontiers of Combining Systems'' intends to offer a
common forum for these research activities. Furthermore, it gives the
possibility to present results on particular instances of combination
and integration, and on their practical use.

Topics of the workshop are:

 * combination of logics (e.g., modal logics, logics in AI, ...)

 * combination of constraint solving techniques  
     (unification and matching algorithms, general symbolic
      constraints, numerical constraints, ...)
     and combination of decision procedures

 * integration of equational and other theories into deductive systems
     (e.g. theory resolution, constraint resolution, constraint
      paramodulation, ...)

 * combination of term rewriting systems

 * integration of data structures (e.g., sets, multisets, lists) into
     CLP formalisms and deduction processes

 * hybrid systems in computational linguistics, knowledge representation,
     natural language semantics, and human computer interaction

 * logic modelling of multi-agent systems.


Invited Speakers:

B. Buchberger, A. Colmerauer, D. Gabbay, U. Glaesser, M. Stickel


Program Committee:

F. Baader, P. Baumgartner, P. Blackburn, A. Bockmayr, A. Boudet,
J. Calmet, A. Colmerauer, D.M. Gabbay, H. Kirchner, H.J. Ohlbach,
J. Pfalzgraf, M. de Rijke, W. Rounds, M. Schmidt-Schauss,
K.U. Schulz. 


Program Chair:

F. Baader  &  K.U. Schulz.


Local Organization:

K.U. Schulz, 
CIS, University of Munich, 
Wagmuellerstr. 23, 
D-80538 Muenchen, 
Germany
E-mail: schulz@thecube.cis.uni-muenchen.de


From sandel@cli.com  Mon Feb 12 16:04:54 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA13751; Mon, 12 Feb 96 16:04:54 CST
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA05411; Mon, 12 Feb 96 16:04:53 CST
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA02105; Mon, 12 Feb 96 16:04:53 CST
Date: Mon, 12 Feb 96 16:04:53 CST
Message-Id: <9602122204.AA02105@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: Non-member submission from [Stephan Kepser <kepser@cis.uni-muenchen.de>]


>From kepser@cis.uni-muenchen.de (kepser@cis.uni-muenchen.de)  Mon Feb 12 15:59:54 1996
>Return-Path: <kepser@cis.uni-muenchen.de>
>Received: from cis.uni-muenchen.de (thecube.cis.uni-muenchen.de) by cli.com (4.1/SMI-4.1)
>	id AA05373; Mon, 12 Feb 96 15:59:54 CST
>Received: (from kepser@localhost) by cis.uni-muenchen.de (8.7.3/8.7.2) id WAA05111 for nq>thm-users@cli.com; Mon, 12 Feb 1996 22:59:25 +0100 (MET)
>Date: Mon, 12 Feb 1996 22:59:25 +0100 (MET)
>From: Stephan Kepser <kepser@cis.uni-muenchen.de>
>Message-Id: <199602122159.WAA05111@cis.uni-muenchen.de>
>To: nqthm-users@cli.com
>Subject: CfParticipation  FroCoS'96


                       Call for Participation

                    First International Workshop

                 ``Frontiers of Combining Systems''
                             FroCoS'96

                 March 26-29, 1996, Munich, Germany.


Information and Program in the WWW:
  http://www-lti.informatik.rwth-aachen.de/~stephan/frocos96.html

  (http://www.cis.uni-muenchen.de/hot/frocos96.html)


In order to simplify our organisation we would kindly ask you to

	register no later than 11.03.1996.
 

In various areas of logic, computation, language processing, and
artificial intelligence there is an obvious need for using specialized
formalisms and inference mechanisms for special tasks. In order to be
usable in practice, these specialized systems must be combined with
each other, and they must be integrated into general purpose systems.
The development of general techniques for the combination and
integration of special systems has been initiated in many areas,
and the Workshop ``Frontiers of Combining Systems'' intends to offer a
common forum for these research activities. Furthermore, it gives the
possibility to present results on particular instances of combination
and integration, and on their practical use.

Topics of the workshop are:

 * combination of logics (e.g., modal logics, logics in AI, ...)

 * combination of constraint solving techniques  
     (unification and matching algorithms, general symbolic
      constraints, numerical constraints, ...)
     and combination of decision procedures

 * integration of equational and other theories into deductive systems
     (e.g. theory resolution, constraint resolution, constraint
      paramodulation, ...)

 * combination of term rewriting systems

 * integration of data structures (e.g., sets, multisets, lists) into
     CLP formalisms and deduction processes

 * hybrid systems in computational linguistics, knowledge representation,
     natural language semantics, and human computer interaction

 * logic modelling of multi-agent systems.


Invited Speakers:

B. Buchberger, A. Colmerauer, D. Gabbay, U. Glaesser, M. Stickel


Program Committee:

F. Baader, P. Baumgartner, P. Blackburn, A. Bockmayr, A. Boudet,
J. Calmet, A. Colmerauer, D.M. Gabbay, H. Kirchner, H.J. Ohlbach,
J. Pfalzgraf, M. de Rijke, W. Rounds, M. Schmidt-Schauss,
K.U. Schulz. 


Program Chair:

F. Baader  &  K.U. Schulz.


Local Organization:

K.U. Schulz, 
CIS, University of Munich, 
Wagmuellerstr. 23, 
D-80538 Muenchen, 
Germany
E-mail: schulz@thecube.cis.uni-muenchen.de

From sandel@cli.com  Mon Feb 12 16:55:04 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA13758; Mon, 12 Feb 96 16:55:04 CST
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA05566; Mon, 12 Feb 96 16:55:03 CST
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA02119; Mon, 12 Feb 96 16:55:03 CST
Date: Mon, 12 Feb 96 16:55:03 CST
Message-Id: <9602122255.AA02119@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: Non-member submission from Stephan Kepser


Due to the recent unsolicited advertisement that was posted to the
NQTHM-USERS mailing list, the NQTHM-USERS mailing list now rejects postings
from addresses which are not members of the list.  The enclosed message
was sent by Stephan Kepser and seems appropriate for the list.




>From kepser@cis.uni-muenchen.de (kepser@cis.uni-muenchen.de)  Mon Feb 12 15:59:54 1996
>Return-Path: <kepser@cis.uni-muenchen.de>
>Received: from cis.uni-muenchen.de (thecube.cis.uni-muenchen.de) by cli.com (4.1/SMI-4.1)
>	id AA05373; Mon, 12 Feb 96 15:59:54 CST
>Received: (from kepser@localhost) by cis.uni-muenchen.de (8.7.3/8.7.2) id WAA05111 for nq>thm-users@cli.com; Mon, 12 Feb 1996 22:59:25 +0100 (MET)
>Date: Mon, 12 Feb 1996 22:59:25 +0100 (MET)
>From: Stephan Kepser <kepser@cis.uni-muenchen.de>
>Message-Id: <199602122159.WAA05111@cis.uni-muenchen.de>
>To: nqthm-users@cli.com
>Subject: CfParticipation  FroCoS'96


                       Call for Participation

                    First International Workshop

                 ``Frontiers of Combining Systems''
                             FroCoS'96

                 March 26-29, 1996, Munich, Germany.


Information and Program in the WWW:
  http://www-lti.informatik.rwth-aachen.de/~stephan/frocos96.html

  (http://www.cis.uni-muenchen.de/hot/frocos96.html)


In order to simplify our organisation we would kindly ask you to

	register no later than 11.03.1996.
 

In various areas of logic, computation, language processing, and
artificial intelligence there is an obvious need for using specialized
formalisms and inference mechanisms for special tasks. In order to be
usable in practice, these specialized systems must be combined with
each other, and they must be integrated into general purpose systems.
The development of general techniques for the combination and
integration of special systems has been initiated in many areas,
and the Workshop ``Frontiers of Combining Systems'' intends to offer a
common forum for these research activities. Furthermore, it gives the
possibility to present results on particular instances of combination
and integration, and on their practical use.

Topics of the workshop are:

 * combination of logics (e.g., modal logics, logics in AI, ...)

 * combination of constraint solving techniques  
     (unification and matching algorithms, general symbolic
      constraints, numerical constraints, ...)
     and combination of decision procedures

 * integration of equational and other theories into deductive systems
     (e.g. theory resolution, constraint resolution, constraint
      paramodulation, ...)

 * combination of term rewriting systems

 * integration of data structures (e.g., sets, multisets, lists) into
     CLP formalisms and deduction processes

 * hybrid systems in computational linguistics, knowledge representation,
     natural language semantics, and human computer interaction

 * logic modelling of multi-agent systems.


Invited Speakers:

B. Buchberger, A. Colmerauer, D. Gabbay, U. Glaesser, M. Stickel


Program Committee:

F. Baader, P. Baumgartner, P. Blackburn, A. Bockmayr, A. Boudet,
J. Calmet, A. Colmerauer, D.M. Gabbay, H. Kirchner, H.J. Ohlbach,
J. Pfalzgraf, M. de Rijke, W. Rounds, M. Schmidt-Schauss,
K.U. Schulz. 


Program Chair:

F. Baader  &  K.U. Schulz.


Local Organization:

K.U. Schulz, 
CIS, University of Munich, 
Wagmuellerstr. 23, 
D-80538 Muenchen, 
Germany
E-mail: schulz@thecube.cis.uni-muenchen.de


From iglobe@ix.netcom.com  Mon Feb 12 23:31:47 1996
Return-Path: <iglobe@ix.netcom.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA13829; Mon, 12 Feb 96 23:31:47 CST
Received: from ix12.ix.netcom.com by cli.com (4.1/SMI-4.1)
	id AA06287; Mon, 12 Feb 96 23:31:46 CST
Received: from  by ix12.ix.netcom.com (8.6.12/SMI-4.1/Netcom)
	id VAA07076; Mon, 12 Feb 1996 21:31:06 -0800
Date: Mon, 12 Feb 1996 21:31:06 -0800
Message-Id: <199602130531.VAA07076@ix12.ix.netcom.com>
From: iglobe@ix.netcom.com (Robert Shatikian )
Subject: Complementery Investment Newsletter
To: c2man@research.canon.oz.au
To: nqthm-users@cli.com
To: ctf-discuss@cis.upenn.edu
To: ectl-request@snowhite.cis.uoguelph.ca
To: att-pc+ssbn.wlk.com@ix.netcom.com
To: pubnet@chinacat.unicom.com
To: fbus_users@theus.rain.com
To: r.c.karsmakers@stud.let.ruu.nl
To: virus-i@ibm1.cc.lehigh.edu
To: alspa-users@ssyx.ucsc.edu
To: cdrom-list@ben.com
To: apE-info@ferkel.ucsb.edu
To: appware-info@serious.uchicago.edu
To: auc-tex@iesd.auc.uk
To: ccnews%educom.bitnet@CUNYVM.CUNY.EDU
To: IGLOBE@ix.netcom.com
To: announce@cs.ucdavis.edu
To: cussnet@stat.com
To: stein@watson.ibm.com
To: decnews@ubvm.buffalo.edu
To: dirt-users@ukc.ac.uk
To: dist-users@msu.edu
To: dp-friends-request@aiai.ed.ac.uk

Interglobe Investment Newsletter
February 1996

Introduction:
Welcome to the Interglobe Investment Newsletter.  This monthly international  newsletter is an investment advisory which identifies to its subscribers potential profits in selected publicly traded companies.  The securiti
es selected  are mostly from the US NASDAQ and American Stock exchanges as well as other countries public companies.  The newsletter once in a while enlightens certain real estate opportunities. 

All the securities are selected after a thorough, lengthy diligent research, and it is expected that their performance will outperform the general markets significantly over the next six to twelve months.   The newsletter
’s intention is to cover only a handful of securities in each issue and  highlight them with a few fundamental and technical  parameter bullets. 

Subscription:
The newsletter is currently published and mailed electronically (via e-mail) to subscribers in the first week of each month. There are plans for the newsletter to become weekly in the near future.  The subscription cost i
s FREE.

In order to guarantee receiving the Interglobe Investment Newsletter every month , you need to send an e-mail to: iglobe@ix.netcom.com, and in the subject section just say “Subscribe”.  If you have done this already pleas
e ignore this message.

In This Issue:
The US stock markets continued  breaking new highs in January of 1996 even after a very healthy rise in 1995.  In 1995 Consumer Price Index rose only 2.5%, the Federal reserve has lowered the interest rates and analysts b
elieve more are expected to come.  All these are good signs that 1996 will be as good a year as 1995.  On the cautious side just look at the price of gold. Its price has moved up above $400 and continuous rising  after ye
ars of stagnant moves.   Lets just stay cautious.

Our research shows potential opportunities in the following stocks:

Bay Networks Inc. (US OTC, Symbol=BNET, Price=US$ 41.875)
· This California based company manufactures networking equipment, markets and services them in both 	the US and abroad.  It has 111 offices worldwide.
· Bay Network’s key alliance partners are Apple, ATT, GTE, Hewlet Packard, IBM, Intel and several        	other computer giants.
· Its business is believed to be in the top 25% of industry groups for performance.
· Institutions hold 37% of its shares.
· Long term debt is only 15%.
· Currently it trades close to its two months moving average.
· The stock is believed to be 60% less volatile than the general market.
· 1995 EPS (Earnings Per Share but not for the fiscal year) were US $1.15.  There was a one time charge of 	US$0.07 per share for the purchase of Xylogics company.  Analysts EPS expectations are US$ 1.40 	to 1.45, and US 
$1.70 to $1.75 for 1996 and 1997 respectively. 
· Based on the average of high and low PE (price per Earnings) ratios 
over the last three years the stock 	should potentially trade 
conservatively at around US $53 this year.

Carolina First Corp. (US OTC, Symbol=CAFC, Price=US$ 19)
· This is the mother company for 55 banking offices in South Carolina.  
The company not only is in the traditional banking, but also it has a 
mortgage banking and automobile finance company.  Three of its branches 
are in 
grocery stores.  There are plans to open a branch in the Hilton Head 
hotel.
· Long term debt is 1%.
· Institutions hold 2% of its shares.
· The stock is believed to be 50% more volatile than the general 
market.
· It pays US$0.07 dividends per quarter.
· 1995 EPS (Earnings Per Share but not for the fiscal year) were US 
$1.02.  Analysts EPS expectations are 	US $1.30 for 1996.
· Based on the current modest price per earnings ratio of 16.5, the 
stock should easily top to US $21 to 22	and can trade even higher this 
year.
· Several analysts have ranked the stock A for timeliness.

Barrett Business Services Inc. (US OTC, Symbol=BBSI, Price=US$ 15.75)

· This Oregon based company caters businesses with temporary staffing.
· The company has more than 500 clients in the Maryland, Oregon, and 
Washington states. 
· Institutions hold 47% of its shares.
· Long term debt is 6%.
· There were large volumes of trading in December of 1995, and January 
1996.
· 1995 EPS (Earnings Per Share but not for the fiscal year) were US 
$0.60 verses US $0.53 in 1994. 	Analysts EPS expectations are US  
$0.83 to 0.85 for 1996.
· Based on 1995 price per earnings ratio the stock should trade as high 
as US $25 this year
· Analysts expectations to achieve the expected earnings are very high.

Disclaimer:  
Although the information provided in this newsletter was obtained from 
various reliable sources, however, neither the newsletter nor its 
publisher guarantee its accuracy.  The opinions and target prices are 
based on the a
vailable information and publisher’s experience.  The information 
provided does not constitute a solicitation to buy or sell any 
securities.  Investors should perform their own research before 
investing any money.

Best Wishes:  
On the behalf of the Interglobe Investment Newsletter and myself  
wishing you a healthy, and prosperous month.  God Bless you.
Robert Shatikian, President & Publisher


From mccune@mcs.anl.gov  Wed Feb 14 17:14:18 1996
Return-Path: <mccune@mcs.anl.gov>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA14463; Wed, 14 Feb 96 17:14:18 CST
Received: from antares.mcs.anl.gov (mcs.anl.gov) by cli.com (4.1/SMI-4.1)
	id AA06717; Wed, 14 Feb 96 17:14:16 CST
Received: from lutra (lutra.mcs.anl.gov [140.221.5.137]) by antares.mcs.anl.gov (8.6.10/8.6.10)  with ESMTP
	id RAA13790 for <nqthm-users@cli.com>; Wed, 14 Feb 1996 17:14:15 -0600
From: William McCune <mccune@mcs.anl.gov>
Date: Wed, 14 Feb 1996 17:14:14 -0600
Message-Id: <199602142314.RAA22448@lutra>
To: nqthm-users@cli.com
Subject: floatint point verification


Can anyone point me to work on floating point verification
with nqthm or other systems?  So far I have found 3 papers
by Paul Miner and Victor Carreno (of NASA Langley) on
IEEE Floating Point Standards with HOL and PVS.  In particular,
I'm interested in table-driven algorithms for floating-point
functions.  Thanks.

  Bill McCune

From wilding@cli.com  Thu Feb 15 09:32:27 1996
Return-Path: <wilding@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA14927; Thu, 15 Feb 96 09:32:27 CST
Received: from somerville.cli.com by cli.com (4.1/SMI-4.1)
	id AA21948; Thu, 15 Feb 96 09:32:27 CST
Received: by somerville.cli.com (4.1) id AA09642; Thu, 15 Feb 96 09:32:26 CST
Date: Thu, 15 Feb 96 09:32:26 CST
Message-Id: <9602151532.AA09642@somerville.cli.com>
From: Matt Wilding <wilding@cli.com>
To: mccune@mcs.anl.gov
Cc: nqthm-users@cli.com
In-Reply-To: <199602142314.RAA22448@lutra> (message from William McCune on
	Wed, 14 Feb 1996 17:14:14 -0600)
Subject: Re: floatint point verification

> Can anyone point me to work on floating point verification with
> nqthm or other systems?  So far I have found 3 papers by Paul Miner
> and Victor Carreno (of NASA Langley) on IEEE Floating Point
> Standards with HOL and PVS.  In particular, I'm interested in
> table-driven algorithms for floating-point functions.  Thanks.

CLI report 56, A Mechanically-Checked Correctness Proof of a
Floating-Point Search Program, describes a modest PC-Nqthm checked
floating-point proof.  The proved algorithm is not table-driven. It is
available through the CLI home page, http://www.cli.com/.

From wilding@cli.com  Thu Feb 15 11:20:44 1996
Return-Path: <wilding@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA15724; Thu, 15 Feb 96 11:20:44 CST
Received: from dilbert.cli.com by cli.com (4.1/SMI-4.1)
	id AA22455; Thu, 15 Feb 96 11:20:43 CST
Received: by dilbert.cli.com (4.1) id AA15847; Thu, 15 Feb 96 11:20:43 CST
Date: Thu, 15 Feb 96 11:20:43 CST
Message-Id: <9602151720.AA15847@dilbert.cli.com>
From: Matt Wilding <wilding@cli.com>
To: mccune@mcs.anl.gov
Cc: nqthm-users@cli.com
In-Reply-To: <199602142314.RAA22448@lutra> (message from William McCune on
	Wed, 14 Feb 1996 17:14:14 -0600)
Subject: Re: floatint point verification


> Can anyone point me to work on floating point verification with
> nqthm or other systems?  So far I have found 3 papers by Paul Miner
> and Victor Carreno (of NASA Langley) on IEEE Floating Point
> Standards with HOL and PVS.  In particular, I'm interested in
> table-driven algorithms for floating-point functions.  Thanks.

CLI report 56, A Mechanically-Checked Correctness Proof of a
Floating-Point Search Program, describes a modest PC-Nqthm checked
floating-point proof.  The proved algorithm is not table-driven. It is
available through the CLI home page, http://www.cli.com/.

From boyer@cli.com  Wed Feb 21 17:58:16 1996
Return-Path: <boyer@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA18535; Wed, 21 Feb 96 17:58:16 CST
Received: from blanco (blanco.cli.com) by cli.com (4.1/SMI-4.1)
	id AA04525; Wed, 21 Feb 96 17:58:15 CST
Received: by blanco (SMI-8.6) id RAA22754; Wed, 21 Feb 1996 17:58:15 -0600
Date: Wed, 21 Feb 1996 17:58:15 -0600
Message-Id: <199602212358.RAA22754@blanco>
From: "Robert S. Boyer" <boyer@cli.com>
To: nqthm-users@cli.com
Subject: Dissertation

I am most happy to point to the splendid new UT Ph. D. dissertation of
Matt Wilding (wilding@cli.com):

   ftp://ftp.cs.utexas.edu/pub/boyer/wilding-diss.ps.gz

Lots of fascinating Nqthm (and Pc-Nqthm) work.  Includes treatment of
real-time programming problems via mechanized formal methods, such as
a theorem about optimal scheduling and an actual (both formalized and
physically realized) real-time application built on top of the Clinc
stack, rooted in the fabricated-and-verified FM9001 microprocessor.

Here is the abstract:

   Real-time systems are usually complex and sometimes safety-critical.
   We ensure their proper behavior with mathematical proof and check our
   work using Nqthm, a proof system also known as the Boyer-Moore theorem
   prover.

   A real-time scheduling policy and a theorem about its optimality are
   presented.  The theorem statement formalizes aspects of real-time
   scheduling, a common approach to real-time system development.

   The execution of an application written in Piton, a language for which
   there exists a proved compiler, is proved optimal and timely.  A
   method for structuring the proof supports development of large
   verified programs.

   A real-time model of the FM9001 microprocessor and a timed automata
   specification method for real-time system properties are developed.
   The correct operation of a small real-time system, a quiz-show
   signaling system, is specified and proved using our microprocessor
   model to describe computation and timed automata to describe relevant
   system properties.  We demonstrate the concreteness of our
   computation model by physically constructing the example, and show how
   complex proofs bridging the semantic gap from machine code bits to
   abstract system properties benefit from machine-checking.

Bob Boyer

From allison.eng@uwcr.edu  Sun Feb 25 03:59:06 1996
Return-Path: <allison.eng@uwcr.edu>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA20175; Sun, 25 Feb 96 03:59:06 CST
Received: from ix.ix.netcom.com by cli.com (4.1/SMI-4.1)
	id AA04772; Sun, 25 Feb 96 03:59:05 CST
Received: from [152.52.116.129] by ix.ix.netcom.com (8.6.12/SMI-4.1/Netcom)
	id AAA10649; Sun, 25 Feb 1996 00:47:23 -0800
X-Sender: allison.eng@uwcr.edu (Unverified)
Message-Id: <v01530530ad5591451369@[152.52.116.129]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Reply-To: please.reply.via.fax.to.fax.number.shown@or.via.airmail.to.smail.address.shown
Approved: moderator
X-Priority: 1 (Highest)
Date: Fri, 23 Feb 1996 09:59:02 +0900
To: allison.eng13@uwcr.edu
From: allison.eng13@uwcr.edu (Allison Eng)
Subject: ===>> FREE 1 yr. Magazine Sub sent worldwide- 295+ Popular USA Titles

-----> NOTE:   Please first read my note which appears below the "Request
for more info Form."  Then, to get more info, just fill out the "Request
for More Info" form completely and *FAX* or *SMAIL* it back to the company.
You will get a quick reply via email within 1 business day of receipt of
the info request form below.

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* if
your fax:
1. has a cover page;
2. is more than one page
3. does not begin with the "cut here/begin" line from the below form
4. does not end with the "cut here/end" line from the below form.
5. has any handwritten info. on it (info must must be filled out *only*
    with your computer keyboard or typewriter keyboard).  This last
    provision re:  no handwriting on the form applies to requests sent in
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.  If you
have trouble getting through to their fax, or do not have a fax machine at
work or at home, just drop the below form to them via smail (airmail or
first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.  :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Allison Eng.
022396-l

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as
     you still have to know how to deal with an attached file.  It will cut
     your download time by 75%.   Expands out to the same ~525K file in
     option #2.  See option #2 for more info on what you will need to be
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Allison Eng and I recently started using a magazine subscription
club in the USA that has a FREE 1 yr. magazine subscription deal with your
first paid order- and I have been very pleased with them.    They have over
1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of
a selection than I ever knew even existed.  They have magazines for most
every area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half
of what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people
buy magazines and then toss them after reading them for just a few minutes
or hours.  They are so cheap in the USA!   Well, this company would like to
make it the same way for their overseas members.  They are also cheaper
than all their competitors in the USA and overseas, including the
publishers themselves!   This is their price guarantee.  Around one-half
their business comes from overseas, so they are very patient with new
members who only speak limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

Please do not email me as I am just a happy customer and a *busy* student.
I don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are
less than half of the next best deal I have been able to find and other
times, just a little cheaper - but I have never found a lower rate yet.
They assured me that if I ever do, they will beat it.

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from
a special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a
charge for FPH (foreign postage and handling) (on both paid and freebie
subs) that varies from magazine to magazine.  I have found their staff to
be very friendly and courteous.  They even helped me with an address change
when I moved from one country to another.

The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls
you personally on the phone to explain how he works his deal, or sometimes
he has one of his assistants call.  He is kind of quirky sometimes - he
insists on setting up new members by phone so he can say hi to everyone (I
sure wouldn't want to have his phone bills!),  but you can place future
orders (after your first order) via E-mail.

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas,
he will even call you there, as long as you are interested, but I think he
still makes all his overseas calls on the weekends, I guess cause the long
distance rates are cheaper then.

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had
a 2-3 week waiting list for new members to be called back so that they
could join up. (Once you are an existing member, they help you immediately
when you call. )  I think they are able to get back to prospective new
members  the same day or within a few days now, as they have increased
their staff.  I am not sure about this.........but if you email the above
form to them, that is the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what
he sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Allison Eng


ps.  please forward a copy of this message to all your friends on the net
who you think might be interested in it!  It is a great deal!  If you join
and then they join after you, you will earn a free 1 yr. subscription for
each new person you get to join after you join!   If you exceed 25
referrals, they let you use them to give away as gifts, for Christmas,
Chanukah or any other occasion.  Please be kind enough to mention my name
when you join.   I will then get a free magazine for a year for referring
you.
Thank you.




From kstokker@risc.uni-linz.ac.at  Thu Feb 29 08:48:31 1996
Return-Path: <kstokker@risc.uni-linz.ac.at>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA21617; Thu, 29 Feb 96 08:48:31 CST
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Received: from melmac.risc.uni-linz.ac.at by cli.com (4.1/SMI-4.1)
	id AA23785; Thu, 29 Feb 96 08:41:26 CST
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Received: by melmac.risc.uni-linz.ac.at id AA28926
  (5.67b8/IDA-1.5 for nqthm-users@cli.com); Thu, 29 Feb 1996 15:41:15 +0100
Date: Thu, 29 Feb 1996 15:41:15 +0100
Message-Id: <199602291441.AA28926@melmac.risc.uni-linz.ac.at>
To: nqthm-users@cli.com
From: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Reply-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Subject: Second CFP AISMC-3
 PLEASE DISTRIBUTE   ----   PLEASE DISTRIBUTE   ----  PLEASE DISTRIBUTE

Third and Final Call for Papers for the Third International Conference on 

      Artificial Intelligence and Symbolic Mathematical Computation

                                (AISMC-3)

                Steyr -- Austria (September 23-25, 1996)



The international conference AISMC-3 continues the successful events
AISMC-1, organised by Jacques Calmet (Karlsruhe 1992) and AISMC-2,
organised by John A. Campbell (Cambridge, UK, 1994).  The AISMC 
initiative is an interdisciplinary forum bringing people from
different areas of research and application fields together with
emphasis on the interaction of methods and problem solving approaches
from AI and symbolic mathematical computation. 

A broad, new branch will be incorporated and sponsored in AISMC now, 
namely ``Engineering and Industrial Applications'' with corresponding 
invited programme committee members.  Besides that, persons from
science management have confirmed to participate actively.

AISMC-3 will be organised by RISC-Linz, Johannes Kepler University Linz,
Austria.

Areas of interest for the conference are the wide field of AI methods 
and symbolic mathematical computation, and applications in engineering 
and industry.


Suggestion: 
DISCO '96 (Design and Implementation of Symbolic Computation Systems) will
be held in Karlsruhe, Germany, from September 18-20; participation at both
conferences is easily possible: the weekend in-between would lend itself
to trips and sightseeing.


Steering Committee: 
J. Calmet (Karlsruhe), J.A. Campbell (London) and J. Pfalzgraf (Linz, 
Conference Chair).


Programme Committee:
L.Aiello (Rome)          F. Arlabosse (Paris)       B. Buchberger (Linz)
G. Butler (Montreal)     R. Caferra (Grenoble)      J. Calmet (Karlsruhe)
J.A. Campbell (London)   H. Clausen (Salzburg)      A.M. Cohen (Eindhoven)
J. Cunningham (London)   J. Geiger (Munich)         R. Goebl (Vienna)
K. Hingerl (Steyr)       D. Kapur (Albany, NY)      L. Kerschberg (Fairfax, VA)
H. Kobayashi (Tokyo)     R. Leisen (Bonn)           A. Miola (Rome)
E. Orlowska (Warsaw)     J. Pfalzgraf (Linz, Chair) F. Pfenning (Pittsburgh)
G. Reinhart (Munich)     M. Rigg (Bracknell)        W. Roque (Porto Alegre) 
J. Rosicky (Brno)        E. Sandewall (Linkoping)   K.U. Schulz (Munich)
A. Semenov (Novosibirsk) T. Takeshima (Shizuoka)    T. Wilson (Ithaca, NY) 


Invited Speakers:
A. Cohn (Leeds), R. Dillmann (Karlsruhe), D.S. Scott (Pittsburgh), 
D. Wang (Grenoble).


Local Organisation:
M. Schleicher, V. Sofronie, K. Stokkermans (email: aismc3@risc.uni-linz.ac.at).
URL: http://info.risc.uni-linz.ac.at:70/0/labs-info/catlab/aismc-3.html


Deadline for submission:     March 15, 1996
Notification of acceptance:  May 15, 1996
Final version due:           June 20, 1996


Submission of Papers: Authors are invited to submit papers up to 15 pages in
English.  The affiliation of the authors, including email address or a telefax
number should be given.  Submission can be made by electronic mail in LaTeX
format.  Results must be unpublished and not submitted for publication 
elsewhere.  Previous proceedings have appeared as Springer LNCS 737 and 958.
Proceedings of AISMC-3 will appear in the same series.  Send four copies of
a complete paper to the following address: 

Jochen Pfalzgraf, 
RISC-Linz, 
Johannes Kepler University Linz,
A-4040 Linz,
Austria, 
email: aismc3@risc.uni-linz.ac.at


=================== cut here for LaTeX file =================================

\documentstyle[11pt,epsf]{article}   
\textwidth 16.5cm          
\textheight 26cm
\topmargin -10mm
\evensidemargin 2mm
\oddsidemargin -2mm
\parindent 0em
\pagestyle{empty}

\begin{document}

\fbox{\shortstack{ $\mbox{}$ \\
Third and Final Call for Papers for the Third International Conference on 
\\
{\Large \bf Artificial Intelligence and Symbolic Mathematical Computation}
\\
{\Large \bf (AISMC-3)}
\\
{\sf Steyr -- Austria, September 23-25, 1996}
\\
$\mbox{}$
}}

\medskip

\noindent
The international conference AISMC-3 continues the successful events
AISMC-1, organised by Jacques Calmet (Karlsruhe 1992) and AISMC-2,
organised by John A.~Campbell (Cambridge, UK, 1994).  The AISMC 
initiative is an interdisciplinary forum bringing people from
different areas of research and application fields together with
emphasis on the interaction of methods and problem solving approaches
from AI and symbolic mathematical computation. 

\noindent
A broa
``Engineering and Industrial Applications'' with corresponding invited
programme committee members. 
Besides that, persons from science management have confirmed to participate
actively.

\noindent
AISMC-3 will be organised by RISC-Linz, Johannes Kepler University Linz,
Austria.

\noindent
Areas of interest for the conference are the wide field of AI methods and
symbolic mathematical computation, and applications in engineering and
industry.


\noindent
{\sf Suggestion}: 
DISCO '96 
(Design and Implementation of Symbolic Computation
Systems) will be held in Karlsruhe, Germany, from September 18-20;
participation at both conferences is easily
possible:
the weekend in-between would lend itself to trips and sightseeing.

\medskip

\noindent
{\bf Steering Committee:} 

\noindent
\begin{tabular}{lll}
J.~Calmet (Karlsruhe)  & J.A.~Campbell (London) & 
J.~Pfalzgraf (Linz, Conference Chair) \\
\end{tabular}

\noindent
{\bf Programme Committee:} 

\noindent
\begin{tabular}{lll}
L.~Aiello (Rome) &
F.~Arlabosse (Paris) &
B.~Buchberger (Linz) \\
G.~Butler (Montreal) & R.~Caferra (Grenoble) &
J.~Calmet (Karlsruhe) \\
J.A.~Campbell (London) & H.~Clausen (Salzburg) &
A.M.~Cohen (Eindhoven) \\
J.~Cunningham (London) & J.~Geiger (Munich) &
R.~Goebl (Vienna) \\ K.~Hingerl (Steyr) &
D.~Kapur (Albany, NY) & L.~Kerschberg (Fairfax, VA) \\
H.~Kobayashi (Tokyo) & R.~Leisen (Bonn) &
A.~Miola (Rome) \\ E.~Orlowska (Warsaw) & J.~Pfalzgraf (Linz, Chair) &
F.~Pfenning (Pittsburgh, PA) \\ G.~Reinhart (Munich) &
M.~Rigg (Bracknell) & W.~Roque (Porto Alegre) \\
J.~Rosicky (Brno) & E.~Sandewall (Link\"oping) &
K.U.~Schulz (Munich) \\ A.~Semenov (Novosibirsk) &
T.~Takeshima (Shizuoka) & T.~Wilson (Ithaca, NY) \\
\end{tabular}


\medskip

\noindent
{\bf Invited Speakers:} A.~Cohn (U Leeds),
R.~Dillmann (U Karlsruhe), D.S.~Scott (Carnegie Mellon, Pittsburgh),
D.~Wang (IMAG Grenoble)

\medskip

\noindent
{\bf Local Organisation:}\\
M.~Schleicher, V.~Sofronie, K.~Stokkermans
(email: {\tt aismc3@risc.uni-linz.ac.at}).

\noindent
URL: {\tt http://info.risc.uni-linz.ac.at:70/0/labs-info/catlab/aismc-3.html}

\medskip

\noindent
{\bf Deadline for submission:}  March 15, 1996

\noindent
{\bf Notification of acceptance:}  May 15, 1996

\noindent
{\bf Final version due:} June 20, 1996

\medskip

\noindent
{\bf Submission of Papers:} Authors are invited to submit papers up to
15 pages in English.  The affiliation of the authors, including email
address or a telefax number should be given.  Submission can be made by
electronic mail in \LaTeX format.  Results must be unpublished and not
submitted for publication elsewhere.  
Previous proceedings have appeared as Springer LNCS 737 and 958.
Proceedings of AISMC-3 will appear in the same series.
Send four copies of a complete
paper to the following address: 

\smallskip
\noindent
{\sf Jochen Pfalzgraf, 
RISC-Linz, 
Johannes Kepler University Linz,
A-4040 Linz,
Austria}, \\
email: {\tt aismc3@risc.uni-linz.ac.at}
\end{document}

From sandel@cli.com  Thu Feb 29 11:15:51 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp.cli.com (4.1/SMI-4.1)
	id AA21628; Thu, 29 Feb 96 11:15:51 CST
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA24251; Thu, 29 Feb 96 11:15:51 CST
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA06611; Thu, 29 Feb 96 11:15:50 CST
Date: Thu, 29 Feb 96 11:15:50 CST
Message-Id: <9602291715.AA06611@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: Non-member submission from [Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>]


Another non-member posting.

----- Begin Included Message -----

From owner-nqthm-users Thu Feb 29 08:48:34 1996
Date: Thu, 29 Feb 96 08:48:33 CST
From: owner-nqthm-users
To: owner-nqthm-users
Subject: BOUNCE nqthm-users: Non-member submission from [Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>]
Content-Length: 8264

>From kstokker@risc.uni-linz.ac.at (kstokker@risc.uni-linz.ac.at)  Thu Feb 29 08:41:26 1996
Return-Path: <kstokker@risc.uni-linz.ac.at>
Received: from melmac.risc.uni-linz.ac.at by cli.com (4.1/SMI-4.1)
	id AA23785; Thu, 29 Feb 96 08:41:26 CST
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Received: by melmac.risc.uni-linz.ac.at id AA28926
  (5.67b8/IDA-1.5 for nqthm-users@cli.com); Thu, 29 Feb 1996 15:41:15 +0100
Date: Thu, 29 Feb 1996 15:41:15 +0100
Message-Id: <199602291441.AA28926@melmac.risc.uni-linz.ac.at>
To: nqthm-users@cli.com
From: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Errors-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Reply-To: Karel Stokkermans <Karel.Stokkermans@risc.uni-linz.ac.at>
Subject: Second CFP AISMC-3
 PLEASE DISTRIBUTE   ----   PLEASE DISTRIBUTE   ----  PLEASE DISTRIBUTE

Third and Final Call for Papers for the Third International Conference on 

      Artificial Intelligence and Symbolic Mathematical Computation

                                (AISMC-3)

                Steyr -- Austria (September 23-25, 1996)



The international conference AISMC-3 continues the successful events
AISMC-1, organised by Jacques Calmet (Karlsruhe 1992) and AISMC-2,
organised by John A. Campbell (Cambridge, UK, 1994).  The AISMC 
initiative is an interdisciplinary forum bringing people from
different areas of research and application fields together with
emphasis on the interaction of methods and problem solving approaches
from AI and symbolic mathematical computation. 

A broad, new branch will be incorporated and sponsored in AISMC now, 
namely ``Engineering and Industrial Applications'' with corresponding 
invited programme committee members.  Besides that, persons from
science management have confirmed to participate actively.

AISMC-3 will be organised by RISC-Linz, Johannes Kepler University Linz,
Austria.

Areas of interest for the conference are the wide field of AI methods 
and symbolic mathematical computation, and applications in engineering 
and industry.


Suggestion: 
DISCO '96 (Design and Implementation of Symbolic Computation Systems) will
be held in Karlsruhe, Germany, from September 18-20; participation at both
conferences is easily possible: the weekend in-between would lend itself
to trips and sightseeing.


Steering Committee: 
J. Calmet (Karlsruhe), J.A. Campbell (London) and J. Pfalzgraf (Linz, 
Conference Chair).


Programme Committee:
L.Aiello (Rome)          F. Arlabosse (Paris)       B. Buchberger (Linz)
G. Butler (Montreal)     R. Caferra (Grenoble)      J. Calmet (Karlsruhe)
J.A. Campbell (London)   H. Clausen (Salzburg)      A.M. Cohen (Eindhoven)
J. Cunningham (London)   J. Geiger (Munich)         R. Goebl (Vienna)
K. Hingerl (Steyr)       D. Kapur (Albany, NY)      L. Kerschberg (Fairfax, VA)
H. Kobayashi (Tokyo)     R. Leisen (Bonn)           A. Miola (Rome)
E. Orlowska (Warsaw)     J. Pfalzgraf (Linz, Chair) F. Pfenning (Pittsburgh)
G. Reinhart (Munich)     M. Rigg (Bracknell)        W. Roque (Porto Alegre) 
J. Rosicky (Brno)        E. Sandewall (Linkoping)   K.U. Schulz (Munich)
A. Semenov (Novosibirsk) T. Takeshima (Shizuoka)    T. Wilson (Ithaca, NY) 


Invited Speakers:
A. Cohn (Leeds), R. Dillmann (Karlsruhe), D.S. Scott (Pittsburgh), 
D. Wang (Grenoble).


Local Organisation:
M. Schleicher, V. Sofronie, K. Stokkermans (email: aismc3@risc.uni-linz.ac.at).
URL: http://info.risc.uni-linz.ac.at:70/0/labs-info/catlab/aismc-3.html


Deadline for submission:     March 15, 1996
Notification of acceptance:  May 15, 1996
Final version due:           June 20, 1996


Submission of Papers: Authors are invited to submit papers up to 15 pages in
English.  The affiliation of the authors, including email address or a telefax
number should be given.  Submission can be made by electronic mail in LaTeX
format.  Results must be unpublished and not submitted for publication 
elsewhere.  Previous proceedings have appeared as Springer LNCS 737 and 958.
Proceedings of AISMC-3 will appear in the same series.  Send four copies of
a complete paper to the following address: 

Jochen Pfalzgraf, 
RISC-Linz, 
Johannes Kepler University Linz,
A-4040 Linz,
Austria, 
email: aismc3@risc.uni-linz.ac.at


=================== cut here for LaTeX file =================================

\documentstyle[11pt,epsf]{article}   
\textwidth 16.5cm          
\textheight 26cm
\topmargin -10mm
\evensidemargin 2mm
\oddsidemargin -2mm
\parindent 0em
\pagestyle{empty}

\begin{document}

\fbox{\shortstack{ $\mbox{}$ \\
Third and Final Call for Papers for the Third International Conference on 
\\
{\Large \bf Artificial Intelligence and Symbolic Mathematical Computation}
\\
{\Large \bf (AISMC-3)}
\\
{\sf Steyr -- Austria, September 23-25, 1996}
\\
$\mbox{}$
}}

\medskip

\noindent
The international conference AISMC-3 continues the successful events
AISMC-1, organised by Jacques Calmet (Karlsruhe 1992) and AISMC-2,
organised by John A.~Campbell (Cambridge, UK, 1994).  The AISMC 
initiative is an interdisciplinary forum bringing people from
different areas of research and application fields together with
emphasis on the interaction of methods and problem solving approaches
from AI and symbolic mathematical computation. 

\noindent
A broa
``Engineering and Industrial Applications'' with corresponding invited
programme committee members. 
Besides that, persons from science management have confirmed to participate
actively.

\noindent
AISMC-3 will be organised by RISC-Linz, Johannes Kepler University Linz,
Austria.

\noindent
Areas of interest for the conference are the wide field of AI methods and
symbolic mathematical computation, and applications in engineering and
industry.


\noindent
{\sf Suggestion}: 
DISCO '96 
(Design and Implementation of Symbolic Computation
Systems) will be held in Karlsruhe, Germany, from September 18-20;
participation at both conferences is easily
possible:
the weekend in-between would lend itself to trips and sightseeing.

\medskip

\noindent
{\bf Steering Committee:} 

\noindent
\begin{tabular}{lll}
J.~Calmet (Karlsruhe)  & J.A.~Campbell (London) & 
J.~Pfalzgraf (Linz, Conference Chair) \\
\end{tabular}

\noindent
{\bf Programme Committee:} 

\noindent
\begin{tabular}{lll}
L.~Aiello (Rome) &
F.~Arlabosse (Paris) &
B.~Buchberger (Linz) \\
G.~Butler (Montreal) & R.~Caferra (Grenoble) &
J.~Calmet (Karlsruhe) \\
J.A.~Campbell (London) & H.~Clausen (Salzburg) &
A.M.~Cohen (Eindhoven) \\
J.~Cunningham (London) & J.~Geiger (Munich) &
R.~Goebl (Vienna) \\ K.~Hingerl (Steyr) &
D.~Kapur (Albany, NY) & L.~Kerschberg (Fairfax, VA) \\
H.~Kobayashi (Tokyo) & R.~Leisen (Bonn) &
A.~Miola (Rome) \\ E.~Orlowska (Warsaw) & J.~Pfalzgraf (Linz, Chair) &
F.~Pfenning (Pittsburgh, PA) \\ G.~Reinhart (Munich) &
M.~Rigg (Bracknell) & W.~Roque (Porto Alegre) \\
J.~Rosicky (Brno) & E.~Sandewall (Link\"oping) &
K.U.~Schulz (Munich) \\ A.~Semenov (Novosibirsk) &
T.~Takeshima (Shizuoka) & T.~Wilson (Ithaca, NY) \\
\end{tabular}


\medskip

\noindent
{\bf Invited Speakers:} A.~Cohn (U Leeds),
R.~Dillmann (U Karlsruhe), D.S.~Scott (Carnegie Mellon, Pittsburgh),
D.~Wang (IMAG Grenoble)

\medskip

\noindent
{\bf Local Organisation:}\\
M.~Schleicher, V.~Sofronie, K.~Stokkermans
(email: {\tt aismc3@risc.uni-linz.ac.at}).

\noindent
URL: {\tt http://info.risc.uni-linz.ac.at:70/0/labs-info/catlab/aismc-3.html}

\medskip

\noindent
{\bf Deadline for submission:}  March 15, 1996

\noindent
{\bf Notification of acceptance:}  May 15, 1996

\noindent
{\bf Final version due:} June 20, 1996

\medskip

\noindent
{\bf Submission of Papers:} Authors are invited to submit papers up to
15 pages in English.  The affiliation of the authors, including email
address or a telefax number should be given.  Submission can be made by
electronic mail in \LaTeX format.  Results must be unpublished and not
submitted for publication elsewhere.  
Previous proceedings have appeared as Springer LNCS 737 and 958.
Proceedings of AISMC-3 will appear in the same series.
Send four copies of a complete
paper to the following address: 

\smallskip
\noindent
{\sf Jochen Pfalzgraf, 
RISC-Linz, 
Johannes Kepler University Linz,
A-4040 Linz,
Austria}, \\
email: {\tt aismc3@risc.uni-linz.ac.at}
\end{document}


----- End Included Message -----


From black@lal.cs.byu.edu  Mon Mar  4 15:43:01 1996
Return-Path: <black@lal.cs.byu.edu>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA01273; Mon, 4 Mar 96 15:43:01 CST
Received: from leopard.cs.byu.edu by cli.com (4.1/SMI-4.1)
	id AA01075; Mon, 4 Mar 96 15:42:57 CST
Received: from jaguar.cs.byu.edu by leopard.cs.byu.edu with ESMTP
	(1.37.109.15/16.2) id AA049185363; Mon, 4 Mar 1996 14:36:04 -0700
From: Paul E. Black <black@lal.cs.byu.edu>
Received: by jaguar.cs.byu.edu (1.37.109.15/CS-Client)
	id AA230685176; Mon, 4 Mar 1996 14:32:56 -0700
Date: Mon, 4 Mar 1996 14:32:56 -0700
Message-Id: <199603042132.AA230685176@jaguar.cs.byu.edu>
To: cjf@cs.uq.oz.au, concurrency@cwi.nl, larch-interest@src.dec.com,
        nqthm-users@cli.com, pvs@csl.sri.com, saz-forum@minster.cs.york.ac.uk,
        vavtalk@cenparmi.concordia.ca, vdm-forum@mailbase.ac.uk,
        vera@fanaraaken.stanford.edu, zforum@prg.ox.ac.uk
Subject: new software verification e-mail list

(Please excuse me if you have already seen this message.)

This is to announce a new software verification e-mail list.  I and a
number of people I have met are interested in formal verification of
software, but I have not found any newsgroups or e-mail lists devoted
exclusively to it.  To help, I created a mailing list where people can
discuss issues related to proving programs.  To join the list, send
e-mail to
        majordomo@lal.cs.byu.edu
The subject doesn't matter.  The body must contain the line
        subscribe softverf
You should get an automatic response within about an hour.

Soon I will create some World Wide Web pages with references and
resources related to software verification.

-paul-

Paul E. Black (p.black@ieee.org)      Laboratory for Applied Logic, 3325 TMCB
black@cs.byu.edu                      Brigham Young University
voice: +1 801 378 8113                Provo, Utah   84602-6576
KC7PKT          Web: http://lal.cs.byu.edu/people/black/black.html

From sandel@cli.com  Mon Mar  4 15:44:31 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA01277; Mon, 4 Mar 96 15:44:31 CST
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA01091; Mon, 4 Mar 96 15:44:31 CST
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA08029; Mon, 4 Mar 96 15:44:30 CST
Date: Mon, 4 Mar 96 15:44:30 CST
Message-Id: <9603042144.AA08029@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: Non-member submission from [Paul E. Black <black@lal.cs.byu.edu>]


Another non-member submission that seems appropriate.

----- Begin Included Message -----

From owner-nqthm-users Mon Mar  4 15:43:03 1996
Date: Mon, 4 Mar 96 15:43:03 CST
From: owner-nqthm-users
To: owner-nqthm-users
Subject: BOUNCE nqthm-users: Non-member submission from [Paul E. Black <black@lal.cs.byu.edu>]
Content-Length: 1889

>From black@lal.cs.byu.edu (black@lal.cs.byu.edu)  Mon Mar  4 15:42:57 1996
Return-Path: <black@lal.cs.byu.edu>
Received: from leopard.cs.byu.edu by cli.com (4.1/SMI-4.1)
	id AA01075; Mon, 4 Mar 96 15:42:57 CST
Received: from jaguar.cs.byu.edu by leopard.cs.byu.edu with ESMTP
	(1.37.109.15/16.2) id AA049185363; Mon, 4 Mar 1996 14:36:04 -0700
From: Paul E. Black <black@lal.cs.byu.edu>
Received: by jaguar.cs.byu.edu (1.37.109.15/CS-Client)
	id AA230685176; Mon, 4 Mar 1996 14:32:56 -0700
Date: Mon, 4 Mar 1996 14:32:56 -0700
Message-Id: <199603042132.AA230685176@jaguar.cs.byu.edu>
To: cjf@cs.uq.oz.au, concurrency@cwi.nl, larch-interest@src.dec.com,
        nqthm-users@cli.com, pvs@csl.sri.com, saz-forum@minster.cs.york.ac.uk,
        vavtalk@cenparmi.concordia.ca, vdm-forum@mailbase.ac.uk,
        vera@fanaraaken.stanford.edu, zforum@prg.ox.ac.uk
Subject: new software verification e-mail list

(Please excuse me if you have already seen this message.)

This is to announce a new software verification e-mail list.  I and a
number of people I have met are interested in formal verification of
software, but I have not found any newsgroups or e-mail lists devoted
exclusively to it.  To help, I created a mailing list where people can
discuss issues related to proving programs.  To join the list, send
e-mail to
        majordomo@lal.cs.byu.edu
The subject doesn't matter.  The body must contain the line
        subscribe softverf
You should get an automatic response within about an hour.

Soon I will create some World Wide Web pages with references and
resources related to software verification.

-paul-

Paul E. Black (p.black@ieee.org)      Laboratory for Applied Logic, 3325 TMCB
black@cs.byu.edu                      Brigham Young University
voice: +1 801 378 8113                Provo, Utah   84602-6576
KC7PKT          Web: http://lal.cs.byu.edu/people/black/black.html


----- End Included Message -----


From kepser@cis.uni-muenchen.de  Mon Mar 11 16:50:23 1996
Return-Path: <kepser@cis.uni-muenchen.de>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA00216; Mon, 11 Mar 96 16:50:23 CST
Received: from cis.uni-muenchen.de (thecube.cis.uni-muenchen.de) by cli.com (4.1/SMI-4.1)
	id AA27721; Mon, 11 Mar 96 16:49:57 CST
Received: (from kepser@localhost) by cis.uni-muenchen.de (8.7.3/8.7.2) id XAA15104 for nqthm-users@cli.com; Mon, 11 Mar 1996 23:49:49 +0100 (MET)
Date: Mon, 11 Mar 1996 23:49:49 +0100 (MET)
From: Stephan Kepser <kepser@cis.uni-muenchen.de>
Message-Id: <199603112249.XAA15104@cis.uni-muenchen.de>
To: nqthm-users@cli.com
Subject: CfParticipation  Unif'96



    UNIF'96        Call for participation       UNIF'96


         Tenth INTERNATIONAL WORKSHOP ON UNIFICATION 


         Thursday, June 6 - Saturday, June 8, 1996
                Herrsching (Munich) Germany



This workshop is the tenth in a series of international meetings, the
last three having been in Boston (USA, 1993) and Val d'Ajol (France,
1994), and Sitges (Spain, 1995).  As its predecessors, UNIF'96 is
meant to be an opportunity to meet old and new colleagues, to present
recent work, and to discuss new ideas and trends related to
unification and all its extensions that nowadays have replaced
standard unification in many applications, like dis-, E- or
higher-order unification or other more general symbolic constraint
solving techniques.  It is also a good opportunity for researchers
working in related areas to get an overview of the current state of
the art in the field. 

UNIF'96 will be organized by Klaus U. Schulz and Stephan Kepser, and
partially supported by CIS, University of Munich. We intend to have
sessions with short talks (15 or 30 minutes), followed by discussions,
panel discussions on actual topics, and system demonstrations.  The
following is a (non-exclusive) list of possible topics: 

* Foundations  
* Typed Unification     
* Special Unification algorithms 
* Narrowing    
* Combination problems  
* Higher-Order Unification       
* Disunification                 
* Type reconstruction            
* Constraint solving             
* Applications                   
* Implementations               
* General E-unification and Calculi 


Herrsching is a nice village at the ``Ammersee'', a lake 25 km
south-west of Munich. It can easily be reached by S-Bahn from Munich
Airport or from the main railway station. The address of the workshop
place is

Bildungsstaette des Bayerischen Bauernverbands Herrsching
Rieder Strasse 70
D-82211 Herrsching
Germany

Participants are expected to arrive for dinner on Wednesday,
June 5. The total cost will be 440 DM (German Marks) for single rooms,
covering full board.  There will be no additional registration fees.

Because of the size of the facilities, places at the workshop will be
limited to about 45 people, which means that we cannot guarantee
participation to everybody.  The final list of talks and participants
will be selected by Claude Kirchner and Klaus U. Schulz.

If you intend to participate in the workshop, please apply to 
  schulz@cis.uni-muenchen.de, indicating: (i) full name and address,
(ii) whether you intend to give a talk, and (iii) preference for
single or double room (in the latter case, joint applications for both
people are recommended).  Please apply soon, but in any case
before March 27, 1996 (early applications will have a higher
priority).  Abstracts of the talks will be due by May 15, 1996.

If you have any questions, please send an e-mail to 
  schulz@cis.uni-muenchen.de 

Find Unif'96 in the WWW under the URL
  http://www.cis.uni-muenchen.de/hot/unif96.html

From shyamala.raperjee@netaccess.net1.ub.in  Sun Mar 17 21:01:50 1996
Return-Path: <shyamala.raperjee@netaccess.net1.ub.in>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA10366; Sun, 17 Mar 96 21:01:50 CST
Received: from ix.ix.netcom.com by cli.com (4.1/SMI-4.1)
	id AA26560; Sun, 17 Mar 96 21:01:46 CST
Received: from [206.163.122.106] by ix.ix.netcom.com (8.6.13/SMI-4.1/Netcom)
	id RAA25883; Sun, 17 Mar 1996 17:49:21 -0800
X-Sender: ginny@pop.dorsai.org
Message-Id: <v0153051bad705c181c74@[206.163.122.106]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Reply-To: please.reply.via.fax.or.smail@fax.number.or.smail.address.shown.below
Approved: moderator
X-Priority: 2 (High)
Date: Sat, 16 Mar 1996 19:36:11 +0530
To: shyamala20.raperjee@netaccess.net1.ub.in
From: shyamala20.raperjee@netaccess.net1.ub.in (Shyamala Raperjee)
Subject: ===>> *Fantastic* FREE offer I discovered on the 'net

-----> NOTE:   Please first read my note which appears below the "Request
for more info Form."  Then, to get more info, just fill out the "Request
for More Info" form completely and *FAX* or *SMAIL* it back to the company.
You will get a quick reply via email within 1 business day of receipt of
the info request form below.

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* if
your fax:
1. has a cover page;
2. is more than one page
3. does not begin with the "cut here/begin" line from the below form
4. does not end with the "cut here/end" line from the below form.
5. has any handwritten info. on it (info must must be filled out *only*
    with your computer keyboard or typewriter keyboard).  This last
    provision re:  no handwriting on the form applies to requests sent in
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.  If you
have trouble getting through to their fax, or do not have a fax machine at
work or at home, just drop the below form to them via smail (airmail or
first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.  :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Shyamala Raperjee.
031796-l

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as
     you still have to know how to deal with an attached file.  It will cut
     your download time by 75%.   Expands out to the same ~525K file in
     option #2.  See option #2 for more info on what you will need to be
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Shyamala Raperjee and I recently started using a magazine
subscription club in the USA that has a FREE 1 yr. magazine subscription
deal with your first paid order- and I have been very pleased with them.
They have over 1,500 different USA titles that they can ship to any country
on a subscription basis.   As for computer magazines from the USA, they
more of a selection than I ever knew even existed.  They have magazines for
most every area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half
of what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people
buy magazines and then toss them after reading them for just a few minutes
or hours.  They are so cheap in the USA!   Well, this company would like to
make it the same way for their overseas members.  They are also cheaper
than all their competitors in the USA and overseas, including the
publishers themselves!   This is their price guarantee.  Around one-half
their business comes from overseas, so they are very patient with new
members who only speak limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

Please do not email me as I am just a happy customer and a *busy* student.
I don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are
less than half of the next best deal I have been able to find and other
times, just a little cheaper - but I have never found a lower rate yet.
They assured me that if I ever do, they will beat it.

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from
a special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a
charge for FPH (foreign postage and handling) (on both paid and freebie
subs) that varies from magazine to magazine.  I have found their staff to
be very friendly and courteous.  They even helped me with an address change
when I moved from one country to another.

The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls
you personally on the phone to explain how he works his deal, or sometimes
he has one of his assistants call.  He is kind of quirky sometimes - he
insists on setting up new members by phone so he can say hi to everyone (I
sure wouldn't want to have his phone bills!),  but you can place future
orders (after your first order) via E-mail.

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas,
he will even call you there, as long as you are interested, but I think he
still makes all his overseas calls on the weekends, I guess cause the long
distance rates are cheaper then.

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had
a 2-3 week waiting list for new members to be called back so that they
could join up. (Once you are an existing member, they help you immediately
when you call. )  I think they are able to get back to prospective new
members  the same day or within a few days now, as they have increased
their staff.  I am not sure about this.........but if you email the above
form to them, that is the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what
he sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Shyamala Raperjee


ps.  please forward a copy of this message to all your friends on the net
who you think might be interested in it!  It is a great deal!  If you join
and then they join after you, you will earn a free 1 yr. subscription for
each new person you get to join after you join!   If you exceed 25
referrals, they let you use them to give away as gifts, for Christmas,
Chanukah or any other occasion.  Please be kind enough to mention my name
when you join.   I will then get a free magazine for a year for referring
you.
Thank you.




From jayb@aol.com  Mon Mar 18 00:42:06 1996
Return-Path: <jayb@aol.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA14481; Mon, 18 Mar 96 00:42:06 CST
Received: from mail-e2a-service.gnn.com by cli.com (4.1/SMI-4.1)
	id AA27300; Mon, 18 Mar 96 00:42:05 CST
Received: from rattehous.com (ix-nbw-nj6-23.ix.netcom.com [205.184.5.215]) by mail-e2a-service.gnn.com (8.7.1/8.6.9) with SMTP id WAA31955; Sun, 17 Mar 1996 22:21:05 -0500 (EST)
Date: Sun, 17 Mar 1996 22:21:05 -0500 (EST)
Message-Id: <199603180321.WAA31955@mail-e2a-service.gnn.com>
From: Jay.Betrug@mail-e2a-service.gnn.com
To: warn-people@fictional.net
Subject: Racist newsgroup proposal alert!

There is currently a proposal for the newsgroup rec.music.white-power,
an attempt by neo-nazi racists to legitimize their activities. It is now
in the CFV stage, where anyone with a valid e-mail address may vote.

"White power" racist music is not a legitimate form of music deserving of
a separate rec.music newsgroup, but rather a political group masquerading
as a musical one. And, the rec.* hierarchy is inappropriate because rec.*
is for recreational activities, and racism is anything but recreational.

But, most importantly, we must show the racists that they will not be
granted a mainstream forum in order to promote hate. If you don't want
a Usenet where minorities feel unwelcome and uncomfortable, vote NO on
rec.music.white-power. Let's make this a crushing defeat for racists.

To vote, send e-mail to music-vote@sub-rosa.com and put

I vote NO on rec.music.white-power

in the body of the message.

The actual CFV can be found on news.announce.newsgroups,
or by sending a blank e-mail to music-cfv@sub-rosa.com.

Voting ends 23:59:59 UTC, 18 Mar 1996, so act quickly!


From lucy@track.uwra.ac.au  Sun Mar 24 06:35:41 1996
Return-Path: <lucy@track.uwra.ac.au>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA26971; Sun, 24 Mar 96 06:35:41 CST
Received: from ix.ix.netcom.com by cli.com (4.1/SMI-4.1)
	id AA24989; Sun, 24 Mar 96 06:35:39 CST
Received: from [206.163.115.179] by ix.ix.netcom.com (8.6.13/SMI-4.1/Netcom)
	id EAA06606; Sun, 24 Mar 1996 04:04:51 -0800
X-Sender: astill@aksi.net
Message-Id: <v0153050aad7872d57351@[206.163.115.179]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Reply-To: please.respond.via.fax.or.smail@fax.number.shown.or.smail.address.shown.thank.you
Approved: moderator
X-Priority: 1 (Highest)
Date: Sat, 23 Mar 1996 01:14:52 +0800
To: lucy20@track.uwra.ac.au
From: lucy20@track.uwra.ac.au (Lucy Whitten)
Subject: ===>> FREE 1 yr. Magazine Sub sent worldwide- 270+ Popular USA Titles

-----> NOTE:   Please first read my note which appears below the "Request
for more info Form."  Then, to get more info, just fill out the "Request
for More Info" form completely and *FAX* or *SMAIL* it back to the company.
You will get a quick reply via email within 1 business day of receipt of
the info request form below.

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* if
your fax:
1. has a cover page;
2. is more than one page
3. does not begin with the "cut here/begin" line from the below form
4. does not end with the "cut here/end" line from the below form.
5. has any handwritten info. on it (info must must be filled out *only*
    with your computer keyboard or typewriter keyboard).  This last
    provision re:  no handwriting on the form applies to requests sent in
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.  If you
have trouble getting through to their fax, or do not have a fax machine at
work or at home, just drop the below form to them via smail (airmail or
first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.  :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Lucy Whitten.
032296-l

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as
     you still have to know how to deal with an attached file.  It will cut
     your download time by 75%.   Expands out to the same ~525K file in
     option #2.  See option #2 for more info on what you will need to be
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Lucy Whitten and I recently started using a magazine
subscription club in the USA that has a FREE 1 yr. magazine subscription
deal with your first paid order- and I have been very pleased with them.
They have over 1,500 different USA titles that they can ship to any country
on a subscription basis.   As for computer magazines from the USA, they
more of a selection than I ever knew even existed.  They have magazines for
most every area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half
of what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people
buy magazines and then toss them after reading them for just a few minutes
or hours.  They are so cheap in the USA!   Well, this company would like to
make it the same way for their overseas members.  They are also cheaper
than all their competitors in the USA and overseas, including the
publishers themselves!   This is their price guarantee.  Around one-half
their business comes from overseas, so they are very patient with new
members who only speak limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

Please do not email me as I am just a happy customer and a *busy* student.
I don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are
less than half of the next best deal I have been able to find and other
times, just a little cheaper - but I have never found a lower rate yet.
They assured me that if I ever do, they will beat it.

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from
a special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a
charge for FPH (foreign postage and handling) (on both paid and freebie
subs) that varies from magazine to magazine.  I have found their staff to
be very friendly and courteous.  They even helped me with an address change
when I moved from one country to another.

The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls
you personally on the phone to explain how he works his deal, or sometimes
he has one of his assistants call.  He is kind of quirky sometimes - he
insists on setting up new members by phone so he can say hi to everyone (I
sure wouldn't want to have his phone bills!),  but you can place future
orders (after your first order) via E-mail.

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas,
he will even call you there, as long as you are interested, but I think he
still makes all his overseas calls on the weekends, I guess cause the long
distance rates are cheaper then.

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had
a 2-3 week waiting list for new members to be called back so that they
could join up. (Once you are an existing member, they help you immediately
when you call. )  I think they are able to get back to prospective new
members  the same day or within a few days now, as they have increased
their staff.  I am not sure about this.........but if you email the above
form to them, that is the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what
he sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Lucy Whitten


ps.  please forward a copy of this message to all your friends on the net
who you think might be interested in it!  It is a great deal!  If you join
and then they join after you, you will earn a free 1 yr. subscription for
each new person you get to join after you join!   If you exceed 25
referrals, they let you use them to give away as gifts, for Christmas,
Chanukah or any other occasion.  Please be kind enough to mention my name
when you join.   I will then get a free magazine for a year for referring
you.
Thank you.




From M.Kerber@cs.bham.ac.uk  Sat Mar 30 10:20:09 1996
Return-Path: <M.Kerber@cs.bham.ac.uk>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA07524; Sat, 30 Mar 96 10:20:09 CST
Received: from percy.cs.bham.ac.uk by cli.com (4.1/SMI-4.1)
	id AA08501; Sat, 30 Mar 96 10:20:05 CST
Message-Id: <9603301620.AA08501@cli.com>
Received: from wallace by percy.cs.bham.ac.uk with SMTP (PP) 
          id <14793-0@percy.cs.bham.ac.uk>; Sat, 30 Mar 1996 16:19:31 +0000
To: nqthm-users@cli.com
Cc: M.Kerber@cs.bham.ac.uk
Subject: CFP: CADE-13 Workshop on Partial Functions
Date: Sat, 30 Mar 1996 16:19:28 +0000
From: Manfred Kerber <M.Kerber@cs.bham.ac.uk>

                 Call  for  Participation

                   CADE-13 Workshop on

             MECHANIZATION OF PARTIAL FUNCTIONS

                       30 July 1996
            Rutgers University, New Brunswick, USA


Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of partial
functions.  There is a rich variety of approaches for dealing with
partial functions and the undefined expressions that often result from
their application.  Ranging from workarounds for concrete situations to
proper general treatments, these approaches have their own advantages
and disadvantages.  For example, some can be used in standard logical
formalisms, while others require new formalisms.  The purpose of the
workshop is to discuss the different approaches and to compare their
advantages and disadvantages.

The workshop will solicit two kinds of contributions:

- - Short papers (up to 6 pages) which argue for a particular approach to
  mechanizing partial functions.
- - Ordinary research papers (up to 12 pages) which address issues
  concerning the use and implementation of partial functions in
  automated reasoning systems.

Potential participants can apply either by submitting a short
statement that contains a description of their current interests or,
if they wish to make a (short or long) presentation, an abstract of
the work they want to present.  The short statements and abstracts
should be sent by e-mail to Manfred Kerber at M.Kerber@cs.bham.ac.uk
by 24 May.  Please include your postal address, e-mail address, and
phone number.  Final versions of accepted contributions are due by 28
June.  They will be made available by WWW and will appear in an
informal proceedings produced by CADE.

Those invited to attend the workshop have to register for the workshop
in conjunction with the CADE main conference.
                              
Organizers: 

   William Farmer, The MITRE Corporation, USA, farmer@mitre.org
   Manfred Kerber, University of Birmingham, UK, M.Kerber@cs.bham.ac.uk
   Michael Kohlhase, Uni des Saarlandes, Germany, kohlhase@cs.uni-sb.de

Important Dates:

   Deadline for submissions of abstracts:           24 May  1996
   Notification of acceptance/rejection:             7 June 1996
   Early registration for CADE:                     21 June 1996
   Final paper due                                  28 June 1996
   Workshop                                         30 July 1996

Further information: http://www.cs.bham.ac.uk/~mmk/cade96-partiality/

From sandel@cli.com  Sat Mar 30 14:38:03 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA12179; Sat, 30 Mar 96 14:38:03 CST
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA08758; Sat, 30 Mar 96 14:38:02 CST
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA01100; Sat, 30 Mar 96 14:38:01 CST
Date: Sat, 30 Mar 96 14:38:01 CST
Message-Id: <9603302038.AA01100@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: Non-member submission from [Manfred Kerber <M.Kerber@cs.bham.ac.uk>]


>From M.Kerber@cs.bham.ac.uk (M.Kerber@cs.bham.ac.uk)  Sat Mar 30 10:20:05 1996
Return-Path: <M.Kerber@cs.bham.ac.uk>
Received: from percy.cs.bham.ac.uk by cli.com (4.1/SMI-4.1)
	id AA08501; Sat, 30 Mar 96 10:20:05 CST
Message-Id: <9603301620.AA08501@cli.com>
Received: from wallace by percy.cs.bham.ac.uk with SMTP (PP) 
          id <14793-0@percy.cs.bham.ac.uk>; Sat, 30 Mar 1996 16:19:31 +0000
To: nqthm-users@cli.com
Cc: M.Kerber@cs.bham.ac.uk
Subject: CFP: CADE-13 Workshop on Partial Functions
Date: Sat, 30 Mar 1996 16:19:28 +0000
From: Manfred Kerber <M.Kerber@cs.bham.ac.uk>

                 Call  for  Participation

                   CADE-13 Workshop on

             MECHANIZATION OF PARTIAL FUNCTIONS

                       30 July 1996
            Rutgers University, New Brunswick, USA


Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of partial
functions.  There is a rich variety of approaches for dealing with
partial functions and the undefined expressions that often result from
their application.  Ranging from workarounds for concrete situations to
proper general treatments, these approaches have their own advantages
and disadvantages.  For example, some can be used in standard logical
formalisms, while others require new formalisms.  The purpose of the
workshop is to discuss the different approaches and to compare their
advantages and disadvantages.

The workshop will solicit two kinds of contributions:

- - Short papers (up to 6 pages) which argue for a particular approach to
  mechanizing partial functions.
- - Ordinary research papers (up to 12 pages) which address issues
  concerning the use and implementation of partial functions in
  automated reasoning systems.

Potential participants can apply either by submitting a short
statement that contains a description of their current interests or,
if they wish to make a (short or long) presentation, an abstract of
the work they want to present.  The short statements and abstracts
should be sent by e-mail to Manfred Kerber at M.Kerber@cs.bham.ac.uk
by 24 May.  Please include your postal address, e-mail address, and
phone number.  Final versions of accepted contributions are due by 28
June.  They will be made available by WWW and will appear in an
informal proceedings produced by CADE.

Those invited to attend the workshop have to register for the workshop
in conjunction with the CADE main conference.
                              
Organizers: 

   William Farmer, The MITRE Corporation, USA, farmer@mitre.org
   Manfred Kerber, University of Birmingham, UK, M.Kerber@cs.bham.ac.uk
   Michael Kohlhase, Uni des Saarlandes, Germany, kohlhase@cs.uni-sb.de

Important Dates:

   Deadline for submissions of abstracts:           24 May  1996
   Notification of acceptance/rejection:             7 June 1996
   Early registration for CADE:                     21 June 1996
   Final paper due                                  28 June 1996
   Workshop                                         30 July 1996

Further information: http://www.cs.bham.ac.uk/~mmk/cade96-partiality/


From boyer@cs.utexas.edu  Tue Apr  2 17:55:13 1996
Return-Path: <boyer@cs.utexas.edu>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA04625; Tue, 2 Apr 96 17:55:13 CST
Received: from mail.cs.utexas.edu by cli.com (4.1/SMI-4.1)
	id AA07953; Tue, 2 Apr 96 17:55:12 CST
Received: from skolem.cs.utexas.edu (boyer@skolem.cs.utexas.edu [128.83.144.7]) by mail.cs.utexas.edu (8.7.1/8.7.1) with ESMTP id RAA23825 for <nqthm-users@cli.com>; Tue, 2 Apr 1996 17:55:11 -0600 (CST)
From: Robert Boyer <boyer@cs.utexas.edu>
Received: by skolem.cs.utexas.edu (8.7.1/Client-1.4)
	id RAA17735; Tue, 2 Apr 1996 17:55:08 -0600 (CST)
Date: Tue, 2 Apr 1996 17:55:08 -0600 (CST)
Message-Id: <199604022355.RAA17735@skolem.cs.utexas.edu>
To: nqthm-users@cli.com
Subject: Piton book out

Let me recommend for your reading the brand new book:

   Piton:  A Mechanically Verified Assembly-Level Language

   J Moore

   Kluwer Academic Publishers

   ISBN 0-7923-3920-7

   $160.00

This book thoroughly documents the first, and as far as I know, only
mechanically-checked proof of the correctness of a compiler for a
general purpose higher-level language targeting the machine code of a
fabricated processor.  The proof was done with Nqthm.  The processor
is the FM9001, built and verified by Brock and Hunt, also using Nqthm.
There have been several other compilers built which target Piton, and
which have also been proved correct.

Bob Boyer

From nicola.du.plessis@uni.durban.ac.za  Sat Apr  6 16:54:33 1996
Return-Path: <nicola.du.plessis@uni.durban.ac.za>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA16240; Sat, 6 Apr 96 16:54:33 CST
Received: from franklin.seas.gwu.edu by cli.com (4.1/SMI-4.1)
	id AA07619; Sat, 6 Apr 96 16:54:20 CST
Received: from [128.227.163.147] (dialup12.afn.org [128.227.163.140]) by franklin.seas.gwu.edu (8.7.1/8.7.1) with SMTP id RAA20704; Sat, 6 Apr 1996 17:01:41 -0500 (EST)
X-Sender: nicola.du.plessis@vax1.uni.durban.ac.za (Unverified)
Message-Id: <v01530518ad89e00759ff@[128.227.163.147]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Reply-To: please.reply.via.fax@or.smail.to.fax.number.or.smail.address.shown.below.thank.you
Approved: moderator
X-Priority: 2 (High)
Date: Fri, 5 Apr 1996 13:44:49 +0200
To: nicola.du.plessis@uni.durban.ac.za
From: nicola.du.plessis@uni.durban.ac.za, elisabettar4@vax1.vax.joburg.org.za,
        chiu@cap.town.ac.za, ronnie@jhft.co.za, ellen@tci.co.za,
        mikki@uni.transvaal.ac.za, che@birmingham.org.za, chir@natal.co.za,
        wrend@rfg1.co.za, susans@uni.swaziland.c.za, gregor@southampton.org.za,
        ellen@plymouth.ac.za, gfos@fresno.co.za, tren@uni.london.ac.za,
        jimt@uni.london.ac.za, fharile@plymouth.org.za, relson@chi.ds.co.za,
        nels@hall.co.za, sarap@ruv4.co.za,
        gspelling@earthlite.co.za (Nicola du Plessis, President of the South Africa Association of
 University Students and the Board of Directors of the South Africa
 Association of University Students)
Subject: ---> FREE 1 yr. Magazine Sub sent worldwide- 290+ Popular USA Titles

-----> NOTE:   Please first read my note which appears below the "Request
for more info Form."  Then, to get more info, just fill out the "Request
for More Info" form completely and *FAX* or *SMAIL* it back to the company.
You will get a quick reply via email within 1 business day of receipt of
the info request form below.

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only*
    with your computer keyboard or typewriter keyboard).  This last
    provision re:  no handwriting on the form applies to requests sent in
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
if you have trouble getting through due to the high volume of overseas
faxes coming in during the early morning and late night hours, please note
that the best time to get through to their fax is Monday-Friday, 9 am - 5
pm EST (New York Time).  If you have trouble getting through to their fax,
or do not have a fax machine at work or at home, just drop the below form
to them via smail (airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.  :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Nicola du Plessis.
040696-l

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as
     you still have to know how to deal with an attached file.  It will cut
     your download time by 75%.   Expands out to the same ~525K file in
     option #2.  See option #2 for more info on what you will need to be
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Nicola du Plessis and I recently started using a magazine
subscription club in the USA that has a FREE 1 yr. magazine subscription
deal with your first paid order- and I have been very pleased with them.
They have over 1,500 different USA titles that they can ship to any country
on a subscription basis.   As for computer magazines from the USA, they
more of a selection than I ever knew even existed.  They have magazines for
most every area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half
of what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people
buy magazines and then toss them after reading them for just a few minutes
or hours.  They are so cheap in the USA!   Well, this company would like to
make it the same way for their overseas members.  They are also cheaper
than all their competitors in the USA and overseas, including the
publishers themselves!   This is their price guarantee.  Around one-half
their business comes from overseas, so they are very patient with new
members who only speak limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

Please do not email me as I am just a happy customer and a *busy* student.
I don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are
less than half of the next best deal I have been able to find and other
times, just a little cheaper - but I have never found a lower rate yet.
They assured me that if I ever do, they will beat it.

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from
a special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a
charge for FPH (foreign postage and handling) (on both paid and freebie
subs) that varies from magazine to magazine.  I have found their staff to
be very friendly and courteous.  They even helped me with an address change
when I moved from one country to another.

The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls
you personally on the phone to explain how he works his deal, or sometimes
he has one of his assistants call.  He is kind of quirky sometimes - he
insists on setting up new members by phone so he can say hi to everyone (I
sure wouldn't want to have his phone bills!),  but you can place future
orders (after your first order) via E-mail.

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas,
he will even call you there, as long as you are interested, but I think he
still makes all his overseas calls on the weekends, I guess cause the long
distance rates are cheaper then.

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had
a 2-3 week waiting list for new members to be called back so that they
could join up. (Once you are an existing member, they help you immediately
when you call. )  I think they are able to get back to prospective new
members  the same day or within a few days now, as they have increased
their staff.  I am not sure about this.........but if you email the above
form to them, that is the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and
juicey) !)...if you completely fill out the form above.  It has lists of
all the freebies, lists of all the titles they sell, titles broken down by
categories and detailed descriptions on nearly 1,200 of the titles that
they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what
he sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Nicola du Plessis



From JohnChen00@aol.com  Mon Apr  8 02:53:52 1996
Return-Path: <JohnChen00@aol.com>
Received: from cli.com by ftp (4.1/SMI-4.1)
	id AA22567; Mon, 8 Apr 96 02:53:52 CDT
Received: from emout10.mail.aol.com (emout10.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA10332; Mon, 8 Apr 96 02:53:43 CDT
Received: by emout10.mail.aol.com (8.6.12/8.6.12) id DAA10800; Mon, 8 Apr 1996 03:36:22 -0400
Date: Mon, 8 Apr 1996 03:36:22 -0400
From: JohnChen00@aol.com
Message-Id: <960408033621_266461253@emout10.mail.aol.com>
Subject: Interesting Free Offer........
Apparently-To: <nqthm-users@cli.com>


---------------------
Forwarded message:
Subj:    Interesting Free Offer........
Date:    96-04-08 02:45:01 EDT
From:    JohnChen00

To:      announcement.service@r1.f62.n8669.z303.fidonet.org

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  John Chen.
040896-l-ifo

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is John Chen and I recently started using a magazine subscription
club in the USA that has a FREE 1 yr. magazine subscription deal with your
first paid order- and I have been very pleased with them.    They have over
1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

John Chen





From moore@cli.com  Fri Apr 19 14:25:48 1996
Return-Path: <moore@cli.com>
Received: from cli.com by ftp. (SMI-8.6/SMI-SVR4)
	id OAA17477; Fri, 19 Apr 1996 14:25:48 -0500
Received: from duck.cli.com by cli.com (4.1/SMI-4.1)
	id AA17152; Fri, 19 Apr 96 14:25:48 CDT
From: moore@cli.com (J Strother Moore)
Received: by duck.cli.com (4.1) id AA00884; Fri, 19 Apr 96 14:25:47 CDT
Date: Fri, 19 Apr 96 14:25:47 CDT
Message-Id: <9604191925.AA00884@duck.cli.com>
To: nqthm-users@cli.com
Subject: AMD5K86 Floating Point Division Algorithm
content-length: 2688

I would like to bring your attention to some recent joint work by Advanced
Micro Devices, Inc., and Computational Logic, Inc., in which the ACL2 theorem
prover was used to prove the correctness of an algorithm of commercial
interest.  In particular we proved the correctness of the kernel of the
floating point division algorithm on the AMD5K86, the first Pentium-class
processor produced by AMD.  Roughly speaking, we proved that the algorithm
implements division on the double extended precision normal and denormal
numbers of the IEEE standard, in the sense that (under appropriate hypotheses)
it returns the floating point number obtained by rounding the ``infinitely
precise'' quotient by the method and to the precision specified by a given
rounding mode.  The permitted rounding modes include round to 0, round away
from 0, round to nearest, round to positive (or negative) infinity, and
``sticky'' rounding.  The proof is quite interesting, involving as it does the
formalization of a lot of floating point ``folklore'' and classical numerical
analysis.

Thanks,
J Strother Moore
---
The paper may be obtained via the URL:

 http://devil.ece.utexas.edu:80/~lynch/divide/divide.html

The title and abstract are shown below.

         A Mechanically Checked Proof of the Correctness of the Kernel
             of the AMD5K86 (tm) Floating-point Division Algorithm

		       J Strother Moore (Moore@cli.com)
			 Tom Lynch (Tom.Lynch@amd.com)
		  Matt Kaufmann (Matt_Kaufmann@email.mot.com)

ABSTRACT:

We describe a mechanically checked proof of the correctness of the
kernel of the floating point division algorithm used on the AMD5K86
microprocessor.  The kernel is a non-restoring division algorithm that
computes the floating point quotient of two double extended precision
floating point numbers, p and d (d \= 0), with respect to a rounding
mode, mode.  The algorithm is defined in terms of floating point
addition and multiplication.  First, two Newton-Raphson iterations are
used to compute a floating point approximation of the reciprocal of d.
The result is used to compute four floating point quotient digits in
the 24,,17 format (24 bits of precision and 17 bit exponents) which
are then summed using appropriate rounding modes.  We prove that if p
and d are 64,,15 (possibly denormal) floating point numbers, d \= 0
and mode specifies one of six rounding procedures and a desired
precision 0 < n <= 64, then the output of the algorithm is p/d
rounded according to mode.  We prove that every intermediate result
is a floating point number in the format required by the resources
allocated to it.  Our claims have been mechanically checked using the
ACL2 theorem prover.


From sandel@cli.com  Fri Apr 19 14:45:49 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp. (SMI-8.6/SMI-SVR4)
	id OAA17485; Fri, 19 Apr 1996 14:45:49 -0500
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA17237; Fri, 19 Apr 96 14:45:48 CDT
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA01597; Fri, 19 Apr 96 14:45:48 CDT
Date: Fri, 19 Apr 96 14:45:48 CDT
Message-Id: <9604191945.AA01597@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: AMD5K86 Floating Point Division Algorithm
content-length: 3172


----- Begin Included Message -----
>From moore (moore)  Fri Apr 19 14:25:48 1996
Return-Path: <moore>
Received: from duck.cli.com by cli.com (4.1/SMI-4.1)
	id AA17152; Fri, 19 Apr 96 14:25:48 CDT
From: moore (J Strother Moore)
Received: by duck.cli.com (4.1) id AA00884; Fri, 19 Apr 96 14:25:47 CDT
Date: Fri, 19 Apr 96 14:25:47 CDT
Message-Id: <9604191925.AA00884@duck.cli.com>
To: nqthm-users
Subject: AMD5K86 Floating Point Division Algorithm

I would like to bring your attention to some recent joint work by Advanced
Micro Devices, Inc., and Computational Logic, Inc., in which the ACL2 theorem
prover was used to prove the correctness of an algorithm of commercial
interest.  In particular we proved the correctness of the kernel of the
floating point division algorithm on the AMD5K86, the first Pentium-class
processor produced by AMD.  Roughly speaking, we proved that the algorithm
implements division on the double extended precision normal and denormal
numbers of the IEEE standard, in the sense that (under appropriate hypotheses)
it returns the floating point number obtained by rounding the ``infinitely
precise'' quotient by the method and to the precision specified by a given
rounding mode.  The permitted rounding modes include round to 0, round away
from 0, round to nearest, round to positive (or negative) infinity, and
``sticky'' rounding.  The proof is quite interesting, involving as it does the
formalization of a lot of floating point ``folklore'' and classical numerical
analysis.

Thanks,
J Strother Moore
---
The paper may be obtained via the URL:

 http://devil.ece.utexas.edu:80/~lynch/divide/divide.html

The title and abstract are shown below.

         A Mechanically Checked Proof of the Correctness of the Kernel
             of the AMD5K86 (tm) Floating-point Division Algorithm

		       J Strother Moore (Moore@cli.com)
			 Tom Lynch (Tom.Lynch@amd.com)
		  Matt Kaufmann (Matt_Kaufmann@email.mot.com)

ABSTRACT:

We describe a mechanically checked proof of the correctness of the
kernel of the floating point division algorithm used on the AMD5K86
microprocessor.  The kernel is a non-restoring division algorithm that
computes the floating point quotient of two double extended precision
floating point numbers, p and d (d \= 0), with respect to a rounding
mode, mode.  The algorithm is defined in terms of floating point
addition and multiplication.  First, two Newton-Raphson iterations are
used to compute a floating point approximation of the reciprocal of d.
The result is used to compute four floating point quotient digits in
the 24,,17 format (24 bits of precision and 17 bit exponents) which
are then summed using appropriate rounding modes.  We prove that if p
and d are 64,,15 (possibly denormal) floating point numbers, d \= 0
and mode specifies one of six rounding procedures and a desired
precision 0 < n <= 64, then the output of the algorithm is p/d
rounded according to mode.  We prove that every intermediate result
is a floating point number in the format required by the resources
allocated to it.  Our claims have been mechanically checked using the
ACL2 theorem prover.



----- End Included Message -----


From owner-nqthm-users@cli.com  Fri Apr 19 16:15:38 1996
Return-Path: <owner-nqthm-users@cli.com>
Received: from cli.com by ftp. (SMI-8.6/SMI-SVR4)
	id QAA17932; Fri, 19 Apr 1996 16:15:38 -0500
Received: by cli.com (4.1/SMI-4.1)
	id AA17244; Fri, 19 Apr 96 14:45:51 CDT
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA17237; Fri, 19 Apr 96 14:45:48 CDT
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA01597; Fri, 19 Apr 96 14:45:48 CDT
Date: Fri, 19 Apr 96 14:45:48 CDT
Message-Id: <9604191945.AA01597@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: AMD5K86 Floating Point Division Algorithm
Sender: owner-nqthm-users@cli.com
Precedence: bulk
content-length: 3172


----- Begin Included Message -----
>From moore (moore)  Fri Apr 19 14:25:48 1996
Return-Path: <moore>
Received: from duck.cli.com by cli.com (4.1/SMI-4.1)
	id AA17152; Fri, 19 Apr 96 14:25:48 CDT
From: moore (J Strother Moore)
Received: by duck.cli.com (4.1) id AA00884; Fri, 19 Apr 96 14:25:47 CDT
Date: Fri, 19 Apr 96 14:25:47 CDT
Message-Id: <9604191925.AA00884@duck.cli.com>
To: nqthm-users
Subject: AMD5K86 Floating Point Division Algorithm

I would like to bring your attention to some recent joint work by Advanced
Micro Devices, Inc., and Computational Logic, Inc., in which the ACL2 theorem
prover was used to prove the correctness of an algorithm of commercial
interest.  In particular we proved the correctness of the kernel of the
floating point division algorithm on the AMD5K86, the first Pentium-class
processor produced by AMD.  Roughly speaking, we proved that the algorithm
implements division on the double extended precision normal and denormal
numbers of the IEEE standard, in the sense that (under appropriate hypotheses)
it returns the floating point number obtained by rounding the ``infinitely
precise'' quotient by the method and to the precision specified by a given
rounding mode.  The permitted rounding modes include round to 0, round away
from 0, round to nearest, round to positive (or negative) infinity, and
``sticky'' rounding.  The proof is quite interesting, involving as it does the
formalization of a lot of floating point ``folklore'' and classical numerical
analysis.

Thanks,
J Strother Moore
---
The paper may be obtained via the URL:

 http://devil.ece.utexas.edu:80/~lynch/divide/divide.html

The title and abstract are shown below.

         A Mechanically Checked Proof of the Correctness of the Kernel
             of the AMD5K86 (tm) Floating-point Division Algorithm

		       J Strother Moore (Moore@cli.com)
			 Tom Lynch (Tom.Lynch@amd.com)
		  Matt Kaufmann (Matt_Kaufmann@email.mot.com)

ABSTRACT:

We describe a mechanically checked proof of the correctness of the
kernel of the floating point division algorithm used on the AMD5K86
microprocessor.  The kernel is a non-restoring division algorithm that
computes the floating point quotient of two double extended precision
floating point numbers, p and d (d \= 0), with respect to a rounding
mode, mode.  The algorithm is defined in terms of floating point
addition and multiplication.  First, two Newton-Raphson iterations are
used to compute a floating point approximation of the reciprocal of d.
The result is used to compute four floating point quotient digits in
the 24,,17 format (24 bits of precision and 17 bit exponents) which
are then summed using appropriate rounding modes.  We prove that if p
and d are 64,,15 (possibly denormal) floating point numbers, d \= 0
and mode specifies one of six rounding procedures and a desired
precision 0 < n <= 64, then the output of the algorithm is p/d
rounded according to mode.  We prove that every intermediate result
is a floating point number in the format required by the resources
allocated to it.  Our claims have been mechanically checked using the
ACL2 theorem prover.



----- End Included Message -----


From howe@research.att.com  Mon Apr 22 05:30:13 1996
Return-Path: <howe@research.att.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id FAA00715; Mon, 22 Apr 1996 05:30:13 -0500
Received: from research.att.com ([192.20.225.4]) by cli.com (4.1/SMI-4.1)
	id AA01866; Mon, 22 Apr 96 05:30:12 CDT
Received: from research.att.com by ns; Sun Apr 21 08:12:25 EDT 1996
Received: from hunny.research.att.com by research; Sun Apr 21 08:11:27 EDT 1996
Received: by hunny.research.att.com (Smail3.1.29.1 #2)
	id m0uAy04-003PfKC; Sun, 21 Apr 96 08:12 EDT
Message-Id: <m0uAy04-003PfKC@hunny.research.att.com>
Date: Sun, 21 Apr 96 08:12 EDT
From: howe@research.att.com (Doug Howe)
To: nqthm-users@cli.com
Subject: FLoC'96 Advance Program
Reply-To: lics-request@research.att.com
content-length: 2408


			Call for Participation

                   1996 FEDERATED LOGIC CONFERENCE

                               FLoC'96

    July 27 - August 3, 1996, Rutgers University, New Jersey, USA


FLoC is modelled after the Federated Computer Research Conference
(FCRC), and brings together synergetic conferences that explore
connections between logic and computer science.  The following
conferences will be part of FLoC.


  CADE: 13th International Conference on        July 30 - August 3
        Automated Deduction 

  CAV:  8th International Conference on         July 31 - August 3
        Computer-Aided Verification 

  LICS: 11th Annual IEEE Symposium on           July 27 - July 30
        Logic in Computer Science 

  RTA:  7th International Conference on         July 27 - July 30
        Rewriting Techniques and Applications 


DIMACS, an NSF Science and Technology Center located at Rutgers
University, will host FLoC as part of its Special Year on Logic and
Algorithms and has provided significant support for reduced student
fees.  FLoC is also supported by generous contributions from AT&T
Laboratories, Bell Labs-Lucent Technologies, DIMACS, IBM Almaden
Research, IEEE Computer Society and the Max-Planck Institute.


          +------------------------------------------------+
          |                                                |
          | *ADVANCE PROGRAM AND REGISTRATION INFORMATION* |
          |                                                |
          |     http://www.research.att.com/lics/floc/     |
          |      ftp://ftp.research.att.com/dist/floc/     |
          |                                                |
          +------------------------------------------------+


FURTHER INFORMATION: For e-mail enquiries regarding the participating
meetings, use cade13@cisr.anu.edu.au, cav96@research.att.com,
lics96@cs.cmu.edu or rta96@mpi-sb.mpg.de.  For other enquiries about
FLoC, write to lics-request@research.att.com.

PROGRAM/CONFERENCE CHAIRS: Michael McRobbie and John Slaney (CADE);
Rajeev Alur and Thomas A. Henzinger (CAV); Edmund M. Clarke (LICS);
Harald Ganzinger (RTA).

LOCAL ARRANGEMENTS: Amy Felty (CADE), Rajeev Alur (CAV), Jon G. Riecke
(LICS, FLoC committee chair), Leo Bachmair (RTA).

FLOC STEERING COMMITTEE: Stephen Mahaney, Moshe Vardi (chair).

FLOC PUBLICITY CHAIR: Douglas J. Howe.  Tel: +1 (908) 582-3837.  
Fax: +1 (908) 582-7550.



From felty@research.att.com  Mon Apr 22 05:30:20 1996
Return-Path: <felty@research.att.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id FAA00719; Mon, 22 Apr 1996 05:30:20 -0500
Received: from research.att.com ([192.20.225.4]) by cli.com (4.1/SMI-4.1)
	id AA01875; Mon, 22 Apr 96 05:30:18 CDT
Received: from research.att.com by ns; Sat Apr 20 16:02:11 EDT 1996
Received: from hunny.research.att.com by research; Sat Apr 20 15:57:59 EDT 1996
Received: from arran.research.att.com by hunny.research.att.com with smtp
	(Smail3.1.29.1 #2) id m0uAinz-003PfKC; Sat, 20 Apr 96 15:58 EDT
Received: by arran.research.att.com (Smail3.1.29.1 #2)
	id m0uAipd-006kEgC; Sat, 20 Apr 96 16:00 EDT
Message-Id: <m0uAipd-006kEgC@arran.research.att.com>
Date: Sat, 20 Apr 96 16:00 EDT
To: nqthm-users@cli.com
Subject: CADE-13 Advance Program and Call for Participation
From: felty@research.att.com (Amy Felty)
Reply-To: cade-request@research.att.com
content-length: 31075

[This announcement is being sent to email lists.  Our apologies for
multiple copies.]


        THE 13TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION

           CADE-13 Advance Program and Call for Participation

     30 July - 3 August, 1996, Rutgers University, New Jersey, USA


CADE-13 will be held as part of the Federated Logic Conference
(FLoC'96).  Complete advance program and registration information is
available on the web and by ftp.
    CADE on the Web: http://www.research.att.com/lics/FLoC/cade13/
    FLoC on the Web: http://www.research.att.com/lics/FLoC/
                     ftp://ftp.research.att.com/dist/floc/

NOTE:  Early Registration Deadline is 21 Jun, 1996.


-----------------
Table of Contents
-----------------
(1) CADE-13 Introduction and General Information
(2) WORKSHOP PROGRAM, 30 July, 1996
    WP-1: Term Schematizations and Their Applications
    WP-2: Visual Reasoning 
    WP-3: Automation of proofs by Mathematical Induction
    WP-4: Empirical Studies in Logic Algorithms
    WP-5: Mechanization of Partial Functions 
    WP-6: Proof Search in Type-Theoretic Languages
    WP-7: Tutorial: Equality Reasoning in Semantic Tableaux and Other
          Sequent-Based Calculi 
(3) CONFERENCE PROGRAM, 31 July - 3 Aug, 1996
(4) CADE-13 Automated Theorem Proving System Competition, 1 Aug, 1996
(5) Woody Bledsoe Student Travel Award - Call For Nominations 
(6) Pointer to Registration and Accommodation Information
(7) Important Dates

----------------------------------------
(1) Introduction and General Information
----------------------------------------
The 1996 International Conference on Automated Deduction (CADE-13) is
the 13th conference in this series. CADE is the major forum for the
presentation of new research results in all aspects of automated
deduction and includes descriptions of working reasoning systems and
problem sets that provide innovative, challenging tests for automated
reasoning systems.

The contributed presentations at CADE-13 include 46 refereed papers and
15 refereed systems abstracts to be given in two parallel sessions.
Demonstrations of these systems will be held during CADE as is now
traditional. CADE-13 will also feature two plenary addresses from Dana
Scott and Harald Ganzinger, a plenary address with CAV from John Rushby
and a panel on the future of automated deduction being organised by Don
Loveland and Deepak Kapur. One highlight of the conference is likely to
be the Theorem Proving Competition being organised by Geoff Sutcliffe
and Christian Suttner. The proceedings of CADE will be published by
Springer-Verlag.

    Program Co-Chairs                     Local Arrangements Chair

    Michael McRobbie & John Slaney        Amy Felty        
    Centre for Information                Bell Laboratories
        Science Research                  Room 2A-425
    The Australian National University    600 Mountain Avenue 
    ACT 0200                              Murray Hill NJ 07974
    Australia                             United States of America
                                     
    Tel: [+61] 6-249-2035                 Tel: [+1] 908-582-4049
    Fax: [+61] 6-249-0747                 Fax: [+1] 908-582-7550
    Email: cade13@cisr.anu.edu.au         Email: cade13-la@cisr.anu.edu.au

                          Program Committee

O. Astrachan (Duke)                    J. Avenhaus (Kaiserslautern)
L. Bachmair (Stony Brook)              D. Basin (Max-Planck)
W. Bibel (Darmstadt)                   B. Buchberger (Linz)
F. Bry (Munich)                        R. Caferra (Grenoble)
K.S. Choi (KAIST)                      A. Cohn (Leeds)
L. Farinas del Cerro (Toulouse)        W. Farmer (MITRE)
A. Felty (Bell Labs)                   M. Fitting (CUNY)
M. Fujita (MRI)                        S. Garland (MIT)
F. Giunchiglia (IRST)                  E. Gunter (Bell Labs)
R. Hasegawa (Kyushu)                   L. Henschen (North Western)
L. Hines (Texas)                       S. Hoelldobler (Dresden)
M. Kaufman (Motorola)                  A. Leitsch (Vienna)
E. Lusk (Argonne)                      U. Martin (St. Andrews)
D. McAllester (AT&T Laboratories)      W. McCune (Argonne)
H.-J. Ohlbach (Max-Planck)             J. Posegga (Karlsruhe)
W. Pase (ORA Canada)                   F. Pfenning (Carnegie Mellon)
F. Pirri (Rome)                        D. Plaisted (North Carolina)
U. Reddy (Illinois)                    M. Rusinowitch (INRIA)
K. Satoh (Hokkaido)                    J. Schumann (Munich)
C. Schwind (Marseille)                 N. Shankar (SRI)
J. Siekman (Saarbruecken)              A. Smaill (Edinburgh)
G. Smolka (Saarbruecken)               M. Stickel (SRI)
G. Sutcliffe (James Cook)              E. Tiden (Siemens)
A. Voronkov (Uppsala)                  L. Wallen (Oxford)
D. Wang (Grenoble)                     H. Zhang (Iowa)


-----------------------------------
(2) WORKSHOP PROGRAM, 30 July, 1996
-----------------------------------
The Workshop Program consists of six full-day workshops and one
half-day tutorial.  If you wish to attend a workshop you must first
contact the Workshop Program Committee.

-------------------------------------------------
WP-1: Term Schematizations and Their Applications
-------------------------------------------------
A common phenomenon throughout all areas dealing with first order
terms (particularly in automated deduction) are infinite sequences of
structurally similar terms. One characteristic of computer science is
its emphasis on finite structures. Consequently, various formalisms
and methods have been proposed to capture these sequences by finite
means, among them schematizations of terms.

A schematization is a finite expression together with a mechanism for
effectively generating the elements of the set. In addition, it should
be possible to compute the unifying intersection of infinite term sets
by manipulating their finite schematizations.

The aim of the workshop is to bring together researchers working on
schematizations and to discuss the different approaches as well as
their applications in clausal theorem proving, term rewriting,
unification theory, finite model building, and other areas.

Workshop Program Committee:
  Miki Hermann (CRIN-CNRS Nancy & INRIA Lorraine, France)
  Gernot Salzer (Technische Universitaet Wien, Austria)
        schema@logic.tuwien.ac.at

For further informations see:
  http://logic.tuwien.ac.at/cade13/schematizations.html

----------------------
WP-2: Visual Reasoning
----------------------
The idea behind the workshop is to help make automated reasoning more
widely accepted and applicable. Visualization can help achieve this.
To obtain the best results researchers in the field of automated
reasoning should actively participate in the development of the
required tools and techniques. The workshop will be a forum to bring
together the scattered attempts that have been pursued along these
lines in a number of locations.  The application of visualization in
the context of formal reasoning certainly covers a broader audience,
so we encourage participants to also enroll in other parts of the
Federated Logic Conference.

The workshop addresses all issues involved with applying
visiualization in the context of formal reasoning, specification, or
verification.  Such topics include, but are not limited to:

  Visualization of logical inferences
  Visual presentations of proofs
  State-charts and event-trace-diagrams
  Reasoning with diagrams
  Visualization of specifications
  Graphical approaches to deriving specifications
  Visual logic programming languages
  Animation of transition systems

Workshop Program Committee:
  Gerard Allwein (Indiana University, USA)
        gtall@phil.indiana.edu
  Joachim Posegga (Deutsche Telekom Research, Germany)
        Posegga@FZ.Telekom.DE
  Peter H. Schmitt (University of Karlsruhe, Germany)
        PSchmitt@ira.uka.de

For further information see:
  http://i12www.ira.uka.de/cade-vr

----------------------------------------------------
WP-3: Automation of Proofs by Mathematical Induction
----------------------------------------------------
The workshop will cover research on mathematical induction and its
applications within formal methods. It will consist of debates on
several `hot topics'. Speakers will be chosen who represent different
viewpoints on these topics. After they have introduced the arguments,
the debate will be thrown open for general discussion. The exact list
of topics is still to be determined, but might include:

  The extension of formalisms for inductive inference 
  Inductive completion vs. explicit induction
  Applications to formal methods, computer aided verification and
    issues arising from these applications
  Heuristics for controlling inductive inference
  Type inference and inductive proofs

Workshop Program Committee:
  Dieter Hutter (DFKI, Germany)
        hutter@dfki.uni-sb.de
  David McAllester (AT&T Laboratories, USA)
        dmac@research.att.com
  Christoph Walther (Technische Hochschule Darmstadt, Germany)
        walther@inferenzsysteme.informatik.th-darmstadt.de
	
For further information see:
  http://www.dfki.uni-sb.de/vse/cade-13/

-------------------------------------------
WP-4: Empirical Studies in Logic Algorithms
-------------------------------------------
Implementation and experimentation are vital tasks in automated
theorem proving research. Heuristics, strategies, and even proof
procedures have to show their advantages in implementations and, if
appropriate, in comparison to other systems. On the other hand
experimental results have influence on theoretical studies,
e.g. heuristics for Davis-Putnam algorithms, resolution strategies, or
indexing techniques.

This workshop should give helpful hints and tips to such major tasks as:

  theoretical issues: questions that experiments help to answer;
        effects on research 
  implementational issues: minimizing implementation time; bases for
        implementation (languages, libraries, systems); crucial aspects  
  experimentational issues: appropriate formula sets; organizing
        tests; presenting results; comparison of approaches (measures,
        environments, ...)

Workshop Program Committee:
  Ulf Dunker (University of Paderborn, Germany)
        dunker@uni-paderborn.de
  Hans Kleine Buening (University of Paderborn, Germany)
        kbcsl@uni-paderborn.de
  Theo Lettman (University of Paderborn, Germany)
        lettmann@uni.paderborn.de

For further information see:
  http://www.uni-paderborn.de/fachbereich/AG/agklbue/staff/lettmann/cade-wp4.html

----------------------------------------
WP-5: Mechanization of Partial Functions
----------------------------------------
Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of
partial functions.  There is a rich variety of approaches for dealing
with partial functions and the undefined expressions that often result
from their application.  Ranging from workarounds for concrete
situations to proper general treatments, these approaches have their
own advantages and disadvantages.  For example, some can be used in
standard logical formalisms, while others require new formalisms.  The
purpose of the workshop is to discuss the different approaches and to
compare their advantages and disadvantages.

Workshop Program Committee:
  William Farmer (MITRE Corporation, USA)
        farmer@mitre.org
  Manfred Kerber (University of Birmingham, UK)
        M.Kerber@cs.bham.ac.uk
  Michael Kohlhase (University of the Saarlandes, Germany)
        kohlhase@cs.uni-sb.de

For further information see:
  http://www.cs.bham.ac.uk/~mmk/cade96-partiality/

----------------------------------------------
WP-6: Proof Search in Type-Theoretic Languages
----------------------------------------------
Much recent work has been devoted to type theory and its applications
to proof and program development in various logical frameworks.  This
workshop focuses on proof search in type-theoretic languages.  Such
languages are logical frameworks, issued from classical,
intuitionistic or linear logics, for representing proofs and in some
cases formalizing connections between proofs and programs.

The purpose of this workshop is to discuss recent results in the area
and to bring together researchers interested in all aspects of proof
search in type-theoretic languages and their underlying logics,
including, but not limited to, the following topics: foundations of
proof search, techniques and concepts related to proof construction,
logic programming, proof synthesis vs program synthesis, applications,
equational theories and rewriting, decision procedures, environments
for formal proof development.

Workshop Program Committee:
  D. Galmiche (CRIN-CNRS Nancy, France)
        Didier.Galmiche@loria.fr
  F. Pfenning (Carnegie Mellon University, USA)
  N. Shankar (SRI, USA)
  J. Smith (Chalmers Univ Goteborg, Sweden)
  L. Wallen (Oxford University, UK)

For further information see:
  http://www.loria.fr/~galmiche/cade96-wp6.html

-----------------------------------------------------------------
WP-7: Tutorial: Equality Reasoning in Semantic Tableaux and Other
      Sequent-Based Calculi
-----------------------------------------------------------------
  Anatoli Degtyarev (Uppsala University, Sweden)
  Andrei Voronkov (Uppsala University, Sweden) voronkov@csd.uu.se

The treatment of equality in sequent-based machine-oriented calculi
has a long history started by Kanger in 1957. The theoretical basis
for handling equality in sequent-based calculi has been developed by
Swedish logicians in the 1950s (Kanger and Prawitz) and by Soviet
logicians in the 1960s (Orevkov, Maslov et.al.).

The next generation of work in this area is based on rigid unification
(Gallier et.al.) formulated in 1987. Recently, this area witnessed
rapid development of new results and techniques (Degtyarev and
Voronkov, Matiyasevich, Voda and Komara, Plaisted), including new
results on rigid unification, the equality elimination method, rigid
superposition and rigid paramodulation.

The techniques of equality reasoning presented in the tutorial are
applicable to all known sequent-based methods of automated deduction,
including the tableau method, the connection method, model elimination
and the inverse method. We shall illustrate main results and ideas on
the tableau method and on the inverse method (as a typical non-local
top-down and a typical local bottom-up search method in sequent
calculi).


---------------------------------------------
(3) CONFERENCE PROGRAM, 31 July - 3 Aug, 1996
---------------------------------------------

TUESDAY, 30 July
================
                                                                           
RECEPTION                                                (17:30-19:30)

FLoC PLENARY SESSION                                     (20:00-21:30)
    Chair: M.Y. Vardi
  R. Milner (Cambridge University, United Kingdom):
  Calculi for Interactions


WEDNESDAY, 31 July
==================

INVITED LECTURE                                           (9:00-10:15)
    Chair: J. Slaney
  Harald Ganzinger (MPI Saarbruecken, Germany):
  Saturation-based Theorem Proving: Past Successes and Future Potential

SESSION 1A                                               (10:45-12:15)
    Chair: J. Avenhaus

  A resolution theorem prover for intuitionistic logic,
  T. Tammet (University of Goteborg, Sweden)

  Proof-terms for classical and intuitionistic resolution,
  D. Pym (University of London, UK), E. Ritter (Oxford University, UK), 
  L. Wallen (Oxford University, UK)

  On the proof-search in intuitionistic logic with equality, or back
  to simultaneous Rigid E-Unification
  A. Voronkov (Uppsala University, Sweden)

SESSION 1B                                               (10:45-12:15)
    Chair: D. Basin

  Extensions to a generalization critic for inductive proof
  A. Ireland (Heriot-Watt University, Scotland), A. Bundy (University
  of Edinburgh, Scotland)

  Learning domain knowledge to improve theorem proving
  J. Denzinger (University of Kaiserslautern, Germany), S. Schulz (TU
  Muenchen, Germany)

  Patching faulty conjectures
  M. Protzen (Technische Hochschule Darmstadt, Germany)

SESSION 2A                                               (14:00-15:30)
    Chair: D. McAllester
 
  Internal analogy in theorem proving
  Erica Melis (University of the Saarlandes, Germany), Jon Whittle
  (University of Edinburgh, UK)

  Termination of theorem proving by reuse
  T. Kolbe (Technische Hochschule Darmstadt, Germany), C. Walther
  (Technische Hochschule Darmstadt, Germany)

  Termination of algorithms over non-freely generated data types
  C. Sengler (DFKI, Germany)

SESSION 2B                                               (14:00-15:30)
    Chair: W. Farmer
 
  ABSFOL: A proof checker by abstraction
  F. Giunchiglia (IRST, Italy), A. Villafiorita (Stanford University,
  USA)

  SPASS & FLOTTER
  C. Weidenbach (MPI Saarbruecken, Germany), B. Gaede (MPI
  Saarbruecken, Germany), G. Rock (MPI Saarbruecken, Germany)

  The design of the CADE-13 ATP system competition
  C. Suttner (TU Muenchen, Germany), G. Sutcliffe (James Cook
  University, Australia)

  SCAN - Elimination of predicate quantifiers system description
  H.J. Ohlbach (MPI Saarbruecken, Germany)

  GEOTHER: A geometry theorem prover
  D. Wang (LIFIA Institut Imag, France)

SESSION 3A                                               (16:00-17:30)
    Chair: U. Martin
 
  Structuring metatheory on inductive definitions
  D. Basin (MPI Saarbruecken, Germany), S. Matthews (MPI Saarbruecken,
  Germany)

  An embedding of Ruby in Isabelle
  O. Rasmussen (Technical University of Denmark, Denmark)

  Mechanical verification of mutually recursive procedures
  P. Homeier (UCLA, USA), D. Martin (UCLA, USA)

SESSION 3B                                               (16:00-17:30)
    Chair: G. Sutcliffe 

  FasTraC - A decentralized traffic control system based on logic
  programming
  G. Felici (University of Texas, USA), G. Rinaldi (CNR-IASI, Italy),
  K. Truemper (University of Texas, USA)

  Presenting machine-found proofs
  X. Huang (University of the Saarlandes, Germany), A. Fiedler
  (University of the Saarlandes, Germany)

  MUltlog 1.0: Towards an expert system for many-valued logics
  G. Salzer (TU Wien, Austria)

  CtCoq: a system presentation
  J. Bertot (INRIA Sophia-Antipolis, France), Y. Bertot (INRIA
  Sophia-Antipolis, France)

  An introduction to geometry expert
  Shang-Ching Chou (Wichita State University, USA), Xiao-Shan Gao
  (Wichita State University, USA), Jing-Zhong Zhang (Wichita State
  University, USA)

  SiCoTHEO: Simple Competitive Parallel Theorem Provers
  J. Schumann (Techniche University of Muenchen, Germany)


THURSDAY, 1 August
==================

INVITED LECTURE                                           (9:00-10:15)
    Chair: M. McRobbie
  Dana S. Scott (Carnegie Mellon University, USA):
  What Can We Hope to Achieve From Automated Deduction?

SESSION 4A                                               (10:45-12:15)
    Chair: M. Rusinowitch
 
  Unification algorithms cannot be combined in polynomial time
  M. Hermann (CRIN (CNRS), France), P.G. Kolaitis (UC Santa Cruz, USA)

  Unification and matching modulo nilpotence
  Q. Guo (SUNY Albany, USA), P. Narandran (SUNY Albany, USA),
  D. Wolfram (ANU, Australia)

  An improved lower bound for the elementary theories of trees
  S. Vorobyov (MPI Saarbruecken, Germany)

SESSION 4B                                               (10:45-12:15)
    Chair: F. Giunchiglia
 
  INKA: The next generation
  D. Hutter (DFKI, Germany), C. Sengler (DFKI, Germany)

  XRay: A prolog technology default theorem prover
  T. Schaub (Universite d'Angers, France), S. Bruning (ZB
  Informationssysteme, Germany), T. Linke (University of Bremen,
  Germany), P. Nicolas (Universite d'Angers, France)

  IMPS: An Updated System Description
  W. Farmer (The Mitre Corporation, USA), J. Guttman (The Mitre
  Corporation, USA), J. Thayer (The Mitre Corporation, USA)

  The tableau-based theorem prover 3 TAP, version 4.0
  B. Beckert (University of Karlsruhe, Germany), R. Hahnle (University
  of Karlsruhe, Germany), P. Oel (University of Karlsruhe, Germany),
  M. Sulzmann (University of Karlsruhe, Germany)

  Generating models by SEM
  J. Zhang (University of Iowa, USA), H. Zhang (University of Iowa,
  USA)

SESSION 5A                                               (14:00-15:30)
    Chair: A. Felty
 
  Optimizing proof search in model elimination
  J. Harrison (Abo Akademi University, Finland)

  An abstract machine for fixed-order dynamically stratified programs
  K. Sagonas (SUNY Stony Brook, USA), T. Swift (SUNY Stony Brook,
  USA), D. Warren (SUNY Stony Brook, USA)

  Unification in pseudo-linear sort theories is decidable
  C. Weidenbach (MPI Saarbruecken, Germany)

SESSION 5B                                               (14:00-15:30)
    Chair: S. Garland
 
  Theorem proving with group presentations: Examples and questions
  U. Martin (University of St. Andrews, Scotland)

  Transforming termination by self-labelling
  A. Middledorp (University of Tsukuba, Japan), H. Ohsaki (University
  of Tsukuba, Japan), H. Zantema (Utrecht University, Netherlands)

  Theorem proving in cancellative abelian monoids (extended abstract)
    H. Ganzinger (MPI Saarbruecken, Germany), U. Waldmann (MPI
    Saarbruecken, Germany)

SESSION 6A                                               (16:00-17:30)
    Chair: J. Schumann
 
  On the practical value of different definitional translations to
  normal form
  U. Egly (TU Wien, Austria), T. Rath (Technische Hochschule
  Darmstadt, Germany)

  On converting non-classical matrix proofs into sequent-style systems
  C. Kreitz (Technische Hochschule Darmstadt, Germany), S. Schmitt
  (Technische Hochschule Darmstadt, Germany)

  Efficient model generation through compilation
  H. Schuetz (Ludwig-Maximilians University of Muenchen, Germany),
  T. Geisler (Ludwig-Maximilians University of Muenchen, Germany)

SESSION 6B                                               (16:00-17:30)
    Chair: D. Wang
 
  Algebra and automated deduction
  S. Linton (University of St. Andrews, Scotland), U. Martin
  (University of St. Andrews, Scotland), P. Prohle (University of
  St. Andrews, Scotland), D. Shand (University of St. Andrews,
  Scotland)

  On Shostak's decision procedure for combinations of theories
  N. Shankar (SRI International, USA), D. Cyrluk (SRI International,
  USA), P. Lincoln (SRI International, USA)

  Ground resolution with group computations on semantic symmetries
  T. Boy de la Tour (LIFIA-IMAG, France)

JOINT BANQUET WITH CAV                                   (18:30-23:00)
  Dinner speech by Amir Pnueli (Weizmann Institute, Israel):
  The Potential and Sensible Scopes of Formal Methods


FRIDAY, 2 August
================

PLENARY SESSION WITH CAV                                  (9:00-10:15)
    Chair: M.Y. Vardi
  John Rushby (SRI International, USA):
  Automated Deduction and Formal Methods

SESSION 7A                                               (10:45-12:15)
    Chair: D. Plaisted
 
  A new method for logical compilation: the achievement by cycle search
  O. Roussel (LIFL CNRS, France), P. Mathieu (LIFL CNRS, France)

  Rewrite semantics for production rule systems: theory and applications
  W. Snyder (Boston University, USA), J.G. Schomolze (Tufts
  University, USA)

  Experiments in the heuristic use of past proof experience
  Matthias Fuchs (University of Kaiserslautern, Germany)

SESSION 7B                                               (10:45-12:15)
    Chair: U. Reddy
 
  Lemma Discovery in automating induction
  D. Kapur (SUNY Albany, USA), M. Subramaniam (SUNY Albany, USA)

  Advanced indexing operations on substitution trees
  P. Graf (MPI Saarbruecken, Germany), C. Meyer (MPI Saarbruecken,
  Germany)

  Semantic trees revisted - some new completeness results
  C.G. Fermuller (Stanford University, USA)

EXCURSION                                                      (13:30)


SATURDAY, 3 August
==================

PANEL DISCUSSION                                          (9:00-10:15)
    Chairs: Don Loveland & Deepak Kapur
  Does Automated Deduction Have a Future?

SESSION 8A                                               (10:45-12:15)
    Chair: L. Farinas del Cerro
 
  Building decision procedures for modal logics from propositional
  decision  procedures - the case study of modal K* 
  F. Giunchiglia (IRST, Italy), R. Sebastiani (University of Genoa,
  Italy)

  Resolution-based calculi for modal and temporal logics
  A. Nonnengart (MPI Saarbruecken, Germany)

  Tableaux and algorithms for propositional dynamic logic with converse
  G. De Giacomo (Universta di Roma, Italy), F. Massacci (Universta di
  Roma, Italy)

SESSION 8B                                               (10:45-12:15)
    Chair: L. Wallen
 
  Reflection of formal tactics in a deductive reflection framework
  H. Ruess (University of Ulm, Germany)

  Walther Recursion
  D. McAllester (AT&T Laboratories, USA), K. Arkoudas (MIT, USA)

  Proof search with set variable instantiation in the calculus of
  constructions
  A. Felty (Bell Labs, USA)

SESSION 9A                                               (14:00-15:30)
    Chair: A. Voronkov 

  Search strategies for resolution in temporal logic
  C. Dixon (Manchester Metropolitan University, UK)

  Optimal axiomatizations for multiple-valued operations and
  quantifiers based  on semi-lattices
  G. Salzer (TU Wien, Austria)

  Grammar Specification in Categorical Logics and Theorem Proving
  S. Luz-Filho (Edinburgh University, Scotland)

SESSION 9B                                               (14:00-15:30)
    Chair: E. Gunter
 
  Path Indexing for AC-Theories
  P. Graf (MPI Saarbruecken, Germany)

  More Church-Rosser Proofs (in Isabelle/HOL)
  T. Nipkow (TU Muenchen, Germany)

  Partitioning methods for satisfiability testing on large formulas
  Tai Joon Park (UC Santa Cruz, USA), A. van Gelder (UC Santa Cruz,
  USA)

BUSINESS MEETING                                         (16:00-17:30)

                         END OF CONFERENCE

---------------------------------------------------------------------
(4) CADE-13 Automated Theorem Proving System Competition, 1 Aug, 1996
---------------------------------------------------------------------
    
In order to stimulate ATP system development and to expose ATP systems
to interested researchers, an ATP competition will be held at CADE-13.
The competition will evaluate the performance of sound fully automatic
ATP systems, on first-order CNF theorems chosen from the TPTP Problem
Library.  The evaluation will be in terms of the number of theorems
proved, and the time taken; in the context of a specified time limit
for each proof attempt, and a bounded number of eligible TPTP
theorems.  An overview of the competition and the rules is available
on the WWW:

   http://wwwjessen.informatik.tu-muenchen.de/~suttner/Competition.html

and full details are given in the competition technical report,
accessible through the WWW page.  Enquiries can be sent to the
competition organizers.

ARPA-owned and maintained machines will be provided for the
competition by the Center for Computer Aids for Industrial
Productivity, Rutgers University.

Competition Organizing Committee:
  Christian Suttner (TU Muenchen, Germany)
        suttner@informatik.tu-muenchen.de
  Geoff Sutcliffe (James Cook University, Australia)
        geoff@cs.jcu.edu.au

The competition schedule is below.  A continuous overview of current
results will be displayed while the competition is in progress. System
demonstrations will also be possible while the competition is in
progress.

Meeting of Competitors                                   (10:30)

Competition in Progress                            (10:45-17:00)

Announcement of Competition Results by Competition Panel (17:35)

-------------------------------------------------------------
(5) Woody Bledsoe Student Travel Award - Call For Nominations 
-------------------------------------------------------------
The board of trustees of the Conference on Automated Deduction
Inc. (CADE) have created an award in honor of the memory of Woody
Bledsoe for his contributions to mathematics, artificial intelligence,
and automated theorem proving, and for his dedication to students.

The award is intended to cover most of the expense for one student
working in the field of automated deduction to attend CADE-13.  The
winner will receive $350 (US) for local expenses and up to $650 for
transportation expenses, and the CADE registration fee will be waived.

Preference will be given to students who will be playing an active
role in the conference and to students who do not have alternative
funding.

Nominations, which should include a recommendation of up to 300 words
from the student's supervisor, should be sent by e-mail (preferred) to
mccune@mcs.anl.gov or by ordinary mail to William McCune, MCS-221,
Argonne National Laboratory, Argonne IL 60439, U.S.A.  Nominations
must arrive no later than May 15, and the winner will be notified by
June 1.  The award will be presented at CADE-13; in case the winner
cannot attend, the trustees may transfer the award to another nominee.

---------------------------------------------------------
(6) Pointer to Registration and Accommodation Information
---------------------------------------------------------
Information on location, travel, social events, and accommodation, as
well as registration forms can be obtained via the FLoC web page, or
via ftp.

    CADE on the Web: http://www.research.att.com/lics/FLoC/cade13/
    FLoC on the Web: http://www.research.att.com/lics/FLoC/
                     ftp://ftp.research.att.com/dist/floc/

If you do not have access, contact CADE-13 local arrangements.

    Email: cade13-la@cisr.anu.edu.au

As well as CADE, other conferences participating in FLoC'96 are the
8th International Conference on Computer-Aided Verification (CAV), the
11th Annual IEEE Symposium on Logic in Computer Science (LICS), and
the 7th International Conference on Rewriting Techniques and
Applications (RTA).

-------------------
(7) Important Dates
-------------------
Event:                                                   Deadline: 

ATP System Competition Registration                      1 May 1996
Workshop WP-3 Submission                                 1 May 1996
Workshop WP-4 Submission                                 10 May 1996
Workshop WP-6 Submission                                 12 May 1996
Nomination for Woody Bledsoe Student Travel Award        15 May 1996
Workshop WP-5 Submission                                 24 May 1996
FLoC'96 Early Registration                               21 Jun 1996
On-Campus Housing Reservation                            21 Jun 1996
Hotel Reservation                                        28 Jun 1996

From sandel@cli.com  Mon Apr 22 10:47:39 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id KAA00816; Mon, 22 Apr 1996 10:47:39 -0500
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA02444; Mon, 22 Apr 96 10:47:38 CDT
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA00677; Mon, 22 Apr 96 10:47:38 CDT
Date: Mon, 22 Apr 96 10:47:38 CDT
Message-Id: <9604221547.AA00677@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: BOUNCE nqthm-users: Non-member submission from [howe@research.att.com (Doug Howe)]
content-length: 3426



----- Begin Included Message -----

>From owner-nqthm-users Mon Apr 22 10:06:59 1996
Date: Mon, 22 Apr 96 10:06:58 CDT
From: owner-nqthm-users
To: owner-nqthm-users
Subject: BOUNCE nqthm-users: Non-member submission from [howe@research.att.com (Doug Howe)]
Content-Length: 3109

>From howe@research.att.com (howe@research.att.com)  Mon Apr 22 05:30:12 1996
Return-Path: <howe@research.att.com>
Received: from research.att.com ([192.20.225.4]) by cli.com (4.1/SMI-4.1)
	id AA01866; Mon, 22 Apr 96 05:30:12 CDT
Received: from research.att.com by ns; Sun Apr 21 08:12:25 EDT 1996
Received: from hunny.research.att.com by research; Sun Apr 21 08:11:27 EDT 1996
Received: by hunny.research.att.com (Smail3.1.29.1 #2)
	id m0uAy04-003PfKC; Sun, 21 Apr 96 08:12 EDT
Message-Id: <m0uAy04-003PfKC@hunny.research.att.com>
Date: Sun, 21 Apr 96 08:12 EDT
From: howe@research.att.com (Doug Howe)
To: nqthm-users@cli.com
Subject: FLoC'96 Advance Program
Reply-To: lics-request@research.att.com


			Call for Participation

                   1996 FEDERATED LOGIC CONFERENCE

                               FLoC'96

    July 27 - August 3, 1996, Rutgers University, New Jersey, USA


FLoC is modelled after the Federated Computer Research Conference
(FCRC), and brings together synergetic conferences that explore
connections between logic and computer science.  The following
conferences will be part of FLoC.


  CADE: 13th International Conference on        July 30 - August 3
        Automated Deduction 

  CAV:  8th International Conference on         July 31 - August 3
        Computer-Aided Verification 

  LICS: 11th Annual IEEE Symposium on           July 27 - July 30
        Logic in Computer Science 

  RTA:  7th International Conference on         July 27 - July 30
        Rewriting Techniques and Applications 


DIMACS, an NSF Science and Technology Center located at Rutgers
University, will host FLoC as part of its Special Year on Logic and
Algorithms and has provided significant support for reduced student
fees.  FLoC is also supported by generous contributions from AT&T
Laboratories, Bell Labs-Lucent Technologies, DIMACS, IBM Almaden
Research, IEEE Computer Society and the Max-Planck Institute.


          +------------------------------------------------+
          |                                                |
          | *ADVANCE PROGRAM AND REGISTRATION INFORMATION* |
          |                                                |
          |     http://www.research.att.com/lics/floc/     |
          |      ftp://ftp.research.att.com/dist/floc/     |
          |                                                |
          +------------------------------------------------+


FURTHER INFORMATION: For e-mail enquiries regarding the participating
meetings, use cade13@cisr.anu.edu.au, cav96@research.att.com,
lics96@cs.cmu.edu or rta96@mpi-sb.mpg.de.  For other enquiries about
FLoC, write to lics-request@research.att.com.

PROGRAM/CONFERENCE CHAIRS: Michael McRobbie and John Slaney (CADE);
Rajeev Alur and Thomas A. Henzinger (CAV); Edmund M. Clarke (LICS);
Harald Ganzinger (RTA).

LOCAL ARRANGEMENTS: Amy Felty (CADE), Rajeev Alur (CAV), Jon G. Riecke
(LICS, FLoC committee chair), Leo Bachmair (RTA).

FLOC STEERING COMMITTEE: Stephen Mahaney, Moshe Vardi (chair).

FLOC PUBLICITY CHAIR: Douglas J. Howe.  Tel: +1 (908) 582-3837.  
Fax: +1 (908) 582-7550.




----- End Included Message -----


From owner-nqthm-users@cli.com  Mon Apr 22 12:13:48 1996
Return-Path: <owner-nqthm-users@cli.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id MAA00851; Mon, 22 Apr 1996 12:13:48 -0500
Received: by cli.com (4.1/SMI-4.1)
	id AA02451; Mon, 22 Apr 96 10:47:41 CDT
Received: from hawaii.cli.com by cli.com (4.1/SMI-4.1)
	id AA02444; Mon, 22 Apr 96 10:47:38 CDT
From: sandel@cli.com (Charles Sandel)
Received: by hawaii.cli.com (4.1) id AA00677; Mon, 22 Apr 96 10:47:38 CDT
Date: Mon, 22 Apr 96 10:47:38 CDT
Message-Id: <9604221547.AA00677@hawaii.cli.com>
To: nqthm-users@cli.com
Subject: BOUNCE nqthm-users: Non-member submission from [howe@research.att.com (Doug Howe)]
Sender: owner-nqthm-users@cli.com
Precedence: bulk
content-length: 3426



----- Begin Included Message -----

>From owner-nqthm-users Mon Apr 22 10:06:59 1996
Date: Mon, 22 Apr 96 10:06:58 CDT
From: owner-nqthm-users
To: owner-nqthm-users
Subject: BOUNCE nqthm-users: Non-member submission from [howe@research.att.com (Doug Howe)]
Content-Length: 3109

>From howe@research.att.com (howe@research.att.com)  Mon Apr 22 05:30:12 1996
Return-Path: <howe@research.att.com>
Received: from research.att.com ([192.20.225.4]) by cli.com (4.1/SMI-4.1)
	id AA01866; Mon, 22 Apr 96 05:30:12 CDT
Received: from research.att.com by ns; Sun Apr 21 08:12:25 EDT 1996
Received: from hunny.research.att.com by research; Sun Apr 21 08:11:27 EDT 1996
Received: by hunny.research.att.com (Smail3.1.29.1 #2)
	id m0uAy04-003PfKC; Sun, 21 Apr 96 08:12 EDT
Message-Id: <m0uAy04-003PfKC@hunny.research.att.com>
Date: Sun, 21 Apr 96 08:12 EDT
From: howe@research.att.com (Doug Howe)
To: nqthm-users@cli.com
Subject: FLoC'96 Advance Program
Reply-To: lics-request@research.att.com


			Call for Participation

                   1996 FEDERATED LOGIC CONFERENCE

                               FLoC'96

    July 27 - August 3, 1996, Rutgers University, New Jersey, USA


FLoC is modelled after the Federated Computer Research Conference
(FCRC), and brings together synergetic conferences that explore
connections between logic and computer science.  The following
conferences will be part of FLoC.


  CADE: 13th International Conference on        July 30 - August 3
        Automated Deduction 

  CAV:  8th International Conference on         July 31 - August 3
        Computer-Aided Verification 

  LICS: 11th Annual IEEE Symposium on           July 27 - July 30
        Logic in Computer Science 

  RTA:  7th International Conference on         July 27 - July 30
        Rewriting Techniques and Applications 


DIMACS, an NSF Science and Technology Center located at Rutgers
University, will host FLoC as part of its Special Year on Logic and
Algorithms and has provided significant support for reduced student
fees.  FLoC is also supported by generous contributions from AT&T
Laboratories, Bell Labs-Lucent Technologies, DIMACS, IBM Almaden
Research, IEEE Computer Society and the Max-Planck Institute.


          +------------------------------------------------+
          |                                                |
          | *ADVANCE PROGRAM AND REGISTRATION INFORMATION* |
          |                                                |
          |     http://www.research.att.com/lics/floc/     |
          |      ftp://ftp.research.att.com/dist/floc/     |
          |                                                |
          +------------------------------------------------+


FURTHER INFORMATION: For e-mail enquiries regarding the participating
meetings, use cade13@cisr.anu.edu.au, cav96@research.att.com,
lics96@cs.cmu.edu or rta96@mpi-sb.mpg.de.  For other enquiries about
FLoC, write to lics-request@research.att.com.

PROGRAM/CONFERENCE CHAIRS: Michael McRobbie and John Slaney (CADE);
Rajeev Alur and Thomas A. Henzinger (CAV); Edmund M. Clarke (LICS);
Harald Ganzinger (RTA).

LOCAL ARRANGEMENTS: Amy Felty (CADE), Rajeev Alur (CAV), Jon G. Riecke
(LICS, FLoC committee chair), Leo Bachmair (RTA).

FLOC STEERING COMMITTEE: Stephen Mahaney, Moshe Vardi (chair).

FLOC PUBLICITY CHAIR: Douglas J. Howe.  Tel: +1 (908) 582-3837.  
Fax: +1 (908) 582-7550.




----- End Included Message -----


From owner-nqthm-users@cli.com  Mon Apr 22 12:55:27 1996
Return-Path: <owner-nqthm-users@cli.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id MAA00870; Mon, 22 Apr 1996 12:55:27 -0500
Received: by cli.com (4.1/SMI-4.1)
	id AA02289; Mon, 22 Apr 96 10:07:04 CDT
Received: from research.att.com ([192.20.225.4]) by cli.com (4.1/SMI-4.1)
	id AA01875; Mon, 22 Apr 96 05:30:18 CDT
Received: from research.att.com by ns; Sat Apr 20 16:02:11 EDT 1996
Received: from hunny.research.att.com by research; Sat Apr 20 15:57:59 EDT 1996
Received: from arran.research.att.com by hunny.research.att.com with smtp
	(Smail3.1.29.1 #2) id m0uAinz-003PfKC; Sat, 20 Apr 96 15:58 EDT
Received: by arran.research.att.com (Smail3.1.29.1 #2)
	id m0uAipd-006kEgC; Sat, 20 Apr 96 16:00 EDT
Message-Id: <m0uAipd-006kEgC@arran.research.att.com>
Date: Sat, 20 Apr 96 16:00 EDT
To: nqthm-users@cli.com
Subject: CADE-13 Advance Program and Call for Participation
From: felty@research.att.com (Amy Felty)
Reply-To: cade-request@research.att.com
Sender: owner-nqthm-users@cli.com
Precedence: bulk
content-length: 31075

[This announcement is being sent to email lists.  Our apologies for
multiple copies.]


        THE 13TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION

           CADE-13 Advance Program and Call for Participation

     30 July - 3 August, 1996, Rutgers University, New Jersey, USA


CADE-13 will be held as part of the Federated Logic Conference
(FLoC'96).  Complete advance program and registration information is
available on the web and by ftp.
    CADE on the Web: http://www.research.att.com/lics/FLoC/cade13/
    FLoC on the Web: http://www.research.att.com/lics/FLoC/
                     ftp://ftp.research.att.com/dist/floc/

NOTE:  Early Registration Deadline is 21 Jun, 1996.


-----------------
Table of Contents
-----------------
(1) CADE-13 Introduction and General Information
(2) WORKSHOP PROGRAM, 30 July, 1996
    WP-1: Term Schematizations and Their Applications
    WP-2: Visual Reasoning 
    WP-3: Automation of proofs by Mathematical Induction
    WP-4: Empirical Studies in Logic Algorithms
    WP-5: Mechanization of Partial Functions 
    WP-6: Proof Search in Type-Theoretic Languages
    WP-7: Tutorial: Equality Reasoning in Semantic Tableaux and Other
          Sequent-Based Calculi 
(3) CONFERENCE PROGRAM, 31 July - 3 Aug, 1996
(4) CADE-13 Automated Theorem Proving System Competition, 1 Aug, 1996
(5) Woody Bledsoe Student Travel Award - Call For Nominations 
(6) Pointer to Registration and Accommodation Information
(7) Important Dates

----------------------------------------
(1) Introduction and General Information
----------------------------------------
The 1996 International Conference on Automated Deduction (CADE-13) is
the 13th conference in this series. CADE is the major forum for the
presentation of new research results in all aspects of automated
deduction and includes descriptions of working reasoning systems and
problem sets that provide innovative, challenging tests for automated
reasoning systems.

The contributed presentations at CADE-13 include 46 refereed papers and
15 refereed systems abstracts to be given in two parallel sessions.
Demonstrations of these systems will be held during CADE as is now
traditional. CADE-13 will also feature two plenary addresses from Dana
Scott and Harald Ganzinger, a plenary address with CAV from John Rushby
and a panel on the future of automated deduction being organised by Don
Loveland and Deepak Kapur. One highlight of the conference is likely to
be the Theorem Proving Competition being organised by Geoff Sutcliffe
and Christian Suttner. The proceedings of CADE will be published by
Springer-Verlag.

    Program Co-Chairs                     Local Arrangements Chair

    Michael McRobbie & John Slaney        Amy Felty        
    Centre for Information                Bell Laboratories
        Science Research                  Room 2A-425
    The Australian National University    600 Mountain Avenue 
    ACT 0200                              Murray Hill NJ 07974
    Australia                             United States of America
                                     
    Tel: [+61] 6-249-2035                 Tel: [+1] 908-582-4049
    Fax: [+61] 6-249-0747                 Fax: [+1] 908-582-7550
    Email: cade13@cisr.anu.edu.au         Email: cade13-la@cisr.anu.edu.au

                          Program Committee

O. Astrachan (Duke)                    J. Avenhaus (Kaiserslautern)
L. Bachmair (Stony Brook)              D. Basin (Max-Planck)
W. Bibel (Darmstadt)                   B. Buchberger (Linz)
F. Bry (Munich)                        R. Caferra (Grenoble)
K.S. Choi (KAIST)                      A. Cohn (Leeds)
L. Farinas del Cerro (Toulouse)        W. Farmer (MITRE)
A. Felty (Bell Labs)                   M. Fitting (CUNY)
M. Fujita (MRI)                        S. Garland (MIT)
F. Giunchiglia (IRST)                  E. Gunter (Bell Labs)
R. Hasegawa (Kyushu)                   L. Henschen (North Western)
L. Hines (Texas)                       S. Hoelldobler (Dresden)
M. Kaufman (Motorola)                  A. Leitsch (Vienna)
E. Lusk (Argonne)                      U. Martin (St. Andrews)
D. McAllester (AT&T Laboratories)      W. McCune (Argonne)
H.-J. Ohlbach (Max-Planck)             J. Posegga (Karlsruhe)
W. Pase (ORA Canada)                   F. Pfenning (Carnegie Mellon)
F. Pirri (Rome)                        D. Plaisted (North Carolina)
U. Reddy (Illinois)                    M. Rusinowitch (INRIA)
K. Satoh (Hokkaido)                    J. Schumann (Munich)
C. Schwind (Marseille)                 N. Shankar (SRI)
J. Siekman (Saarbruecken)              A. Smaill (Edinburgh)
G. Smolka (Saarbruecken)               M. Stickel (SRI)
G. Sutcliffe (James Cook)              E. Tiden (Siemens)
A. Voronkov (Uppsala)                  L. Wallen (Oxford)
D. Wang (Grenoble)                     H. Zhang (Iowa)


-----------------------------------
(2) WORKSHOP PROGRAM, 30 July, 1996
-----------------------------------
The Workshop Program consists of six full-day workshops and one
half-day tutorial.  If you wish to attend a workshop you must first
contact the Workshop Program Committee.

-------------------------------------------------
WP-1: Term Schematizations and Their Applications
-------------------------------------------------
A common phenomenon throughout all areas dealing with first order
terms (particularly in automated deduction) are infinite sequences of
structurally similar terms. One characteristic of computer science is
its emphasis on finite structures. Consequently, various formalisms
and methods have been proposed to capture these sequences by finite
means, among them schematizations of terms.

A schematization is a finite expression together with a mechanism for
effectively generating the elements of the set. In addition, it should
be possible to compute the unifying intersection of infinite term sets
by manipulating their finite schematizations.

The aim of the workshop is to bring together researchers working on
schematizations and to discuss the different approaches as well as
their applications in clausal theorem proving, term rewriting,
unification theory, finite model building, and other areas.

Workshop Program Committee:
  Miki Hermann (CRIN-CNRS Nancy & INRIA Lorraine, France)
  Gernot Salzer (Technische Universitaet Wien, Austria)
        schema@logic.tuwien.ac.at

For further informations see:
  http://logic.tuwien.ac.at/cade13/schematizations.html

----------------------
WP-2: Visual Reasoning
----------------------
The idea behind the workshop is to help make automated reasoning more
widely accepted and applicable. Visualization can help achieve this.
To obtain the best results researchers in the field of automated
reasoning should actively participate in the development of the
required tools and techniques. The workshop will be a forum to bring
together the scattered attempts that have been pursued along these
lines in a number of locations.  The application of visualization in
the context of formal reasoning certainly covers a broader audience,
so we encourage participants to also enroll in other parts of the
Federated Logic Conference.

The workshop addresses all issues involved with applying
visiualization in the context of formal reasoning, specification, or
verification.  Such topics include, but are not limited to:

  Visualization of logical inferences
  Visual presentations of proofs
  State-charts and event-trace-diagrams
  Reasoning with diagrams
  Visualization of specifications
  Graphical approaches to deriving specifications
  Visual logic programming languages
  Animation of transition systems

Workshop Program Committee:
  Gerard Allwein (Indiana University, USA)
        gtall@phil.indiana.edu
  Joachim Posegga (Deutsche Telekom Research, Germany)
        Posegga@FZ.Telekom.DE
  Peter H. Schmitt (University of Karlsruhe, Germany)
        PSchmitt@ira.uka.de

For further information see:
  http://i12www.ira.uka.de/cade-vr

----------------------------------------------------
WP-3: Automation of Proofs by Mathematical Induction
----------------------------------------------------
The workshop will cover research on mathematical induction and its
applications within formal methods. It will consist of debates on
several `hot topics'. Speakers will be chosen who represent different
viewpoints on these topics. After they have introduced the arguments,
the debate will be thrown open for general discussion. The exact list
of topics is still to be determined, but might include:

  The extension of formalisms for inductive inference 
  Inductive completion vs. explicit induction
  Applications to formal methods, computer aided verification and
    issues arising from these applications
  Heuristics for controlling inductive inference
  Type inference and inductive proofs

Workshop Program Committee:
  Dieter Hutter (DFKI, Germany)
        hutter@dfki.uni-sb.de
  David McAllester (AT&T Laboratories, USA)
        dmac@research.att.com
  Christoph Walther (Technische Hochschule Darmstadt, Germany)
        walther@inferenzsysteme.informatik.th-darmstadt.de
	
For further information see:
  http://www.dfki.uni-sb.de/vse/cade-13/

-------------------------------------------
WP-4: Empirical Studies in Logic Algorithms
-------------------------------------------
Implementation and experimentation are vital tasks in automated
theorem proving research. Heuristics, strategies, and even proof
procedures have to show their advantages in implementations and, if
appropriate, in comparison to other systems. On the other hand
experimental results have influence on theoretical studies,
e.g. heuristics for Davis-Putnam algorithms, resolution strategies, or
indexing techniques.

This workshop should give helpful hints and tips to such major tasks as:

  theoretical issues: questions that experiments help to answer;
        effects on research 
  implementational issues: minimizing implementation time; bases for
        implementation (languages, libraries, systems); crucial aspects  
  experimentational issues: appropriate formula sets; organizing
        tests; presenting results; comparison of approaches (measures,
        environments, ...)

Workshop Program Committee:
  Ulf Dunker (University of Paderborn, Germany)
        dunker@uni-paderborn.de
  Hans Kleine Buening (University of Paderborn, Germany)
        kbcsl@uni-paderborn.de
  Theo Lettman (University of Paderborn, Germany)
        lettmann@uni.paderborn.de

For further information see:
  http://www.uni-paderborn.de/fachbereich/AG/agklbue/staff/lettmann/cade-wp4.html

----------------------------------------
WP-5: Mechanization of Partial Functions
----------------------------------------
Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of
partial functions.  There is a rich variety of approaches for dealing
with partial functions and the undefined expressions that often result
from their application.  Ranging from workarounds for concrete
situations to proper general treatments, these approaches have their
own advantages and disadvantages.  For example, some can be used in
standard logical formalisms, while others require new formalisms.  The
purpose of the workshop is to discuss the different approaches and to
compare their advantages and disadvantages.

Workshop Program Committee:
  William Farmer (MITRE Corporation, USA)
        farmer@mitre.org
  Manfred Kerber (University of Birmingham, UK)
        M.Kerber@cs.bham.ac.uk
  Michael Kohlhase (University of the Saarlandes, Germany)
        kohlhase@cs.uni-sb.de

For further information see:
  http://www.cs.bham.ac.uk/~mmk/cade96-partiality/

----------------------------------------------
WP-6: Proof Search in Type-Theoretic Languages
----------------------------------------------
Much recent work has been devoted to type theory and its applications
to proof and program development in various logical frameworks.  This
workshop focuses on proof search in type-theoretic languages.  Such
languages are logical frameworks, issued from classical,
intuitionistic or linear logics, for representing proofs and in some
cases formalizing connections between proofs and programs.

The purpose of this workshop is to discuss recent results in the area
and to bring together researchers interested in all aspects of proof
search in type-theoretic languages and their underlying logics,
including, but not limited to, the following topics: foundations of
proof search, techniques and concepts related to proof construction,
logic programming, proof synthesis vs program synthesis, applications,
equational theories and rewriting, decision procedures, environments
for formal proof development.

Workshop Program Committee:
  D. Galmiche (CRIN-CNRS Nancy, France)
        Didier.Galmiche@loria.fr
  F. Pfenning (Carnegie Mellon University, USA)
  N. Shankar (SRI, USA)
  J. Smith (Chalmers Univ Goteborg, Sweden)
  L. Wallen (Oxford University, UK)

For further information see:
  http://www.loria.fr/~galmiche/cade96-wp6.html

-----------------------------------------------------------------
WP-7: Tutorial: Equality Reasoning in Semantic Tableaux and Other
      Sequent-Based Calculi
-----------------------------------------------------------------
  Anatoli Degtyarev (Uppsala University, Sweden)
  Andrei Voronkov (Uppsala University, Sweden) voronkov@csd.uu.se

The treatment of equality in sequent-based machine-oriented calculi
has a long history started by Kanger in 1957. The theoretical basis
for handling equality in sequent-based calculi has been developed by
Swedish logicians in the 1950s (Kanger and Prawitz) and by Soviet
logicians in the 1960s (Orevkov, Maslov et.al.).

The next generation of work in this area is based on rigid unification
(Gallier et.al.) formulated in 1987. Recently, this area witnessed
rapid development of new results and techniques (Degtyarev and
Voronkov, Matiyasevich, Voda and Komara, Plaisted), including new
results on rigid unification, the equality elimination method, rigid
superposition and rigid paramodulation.

The techniques of equality reasoning presented in the tutorial are
applicable to all known sequent-based methods of automated deduction,
including the tableau method, the connection method, model elimination
and the inverse method. We shall illustrate main results and ideas on
the tableau method and on the inverse method (as a typical non-local
top-down and a typical local bottom-up search method in sequent
calculi).


---------------------------------------------
(3) CONFERENCE PROGRAM, 31 July - 3 Aug, 1996
---------------------------------------------

TUESDAY, 30 July
================
                                                                           
RECEPTION                                                (17:30-19:30)

FLoC PLENARY SESSION                                     (20:00-21:30)
    Chair: M.Y. Vardi
  R. Milner (Cambridge University, United Kingdom):
  Calculi for Interactions


WEDNESDAY, 31 July
==================

INVITED LECTURE                                           (9:00-10:15)
    Chair: J. Slaney
  Harald Ganzinger (MPI Saarbruecken, Germany):
  Saturation-based Theorem Proving: Past Successes and Future Potential

SESSION 1A                                               (10:45-12:15)
    Chair: J. Avenhaus

  A resolution theorem prover for intuitionistic logic,
  T. Tammet (University of Goteborg, Sweden)

  Proof-terms for classical and intuitionistic resolution,
  D. Pym (University of London, UK), E. Ritter (Oxford University, UK), 
  L. Wallen (Oxford University, UK)

  On the proof-search in intuitionistic logic with equality, or back
  to simultaneous Rigid E-Unification
  A. Voronkov (Uppsala University, Sweden)

SESSION 1B                                               (10:45-12:15)
    Chair: D. Basin

  Extensions to a generalization critic for inductive proof
  A. Ireland (Heriot-Watt University, Scotland), A. Bundy (University
  of Edinburgh, Scotland)

  Learning domain knowledge to improve theorem proving
  J. Denzinger (University of Kaiserslautern, Germany), S. Schulz (TU
  Muenchen, Germany)

  Patching faulty conjectures
  M. Protzen (Technische Hochschule Darmstadt, Germany)

SESSION 2A                                               (14:00-15:30)
    Chair: D. McAllester
 
  Internal analogy in theorem proving
  Erica Melis (University of the Saarlandes, Germany), Jon Whittle
  (University of Edinburgh, UK)

  Termination of theorem proving by reuse
  T. Kolbe (Technische Hochschule Darmstadt, Germany), C. Walther
  (Technische Hochschule Darmstadt, Germany)

  Termination of algorithms over non-freely generated data types
  C. Sengler (DFKI, Germany)

SESSION 2B                                               (14:00-15:30)
    Chair: W. Farmer
 
  ABSFOL: A proof checker by abstraction
  F. Giunchiglia (IRST, Italy), A. Villafiorita (Stanford University,
  USA)

  SPASS & FLOTTER
  C. Weidenbach (MPI Saarbruecken, Germany), B. Gaede (MPI
  Saarbruecken, Germany), G. Rock (MPI Saarbruecken, Germany)

  The design of the CADE-13 ATP system competition
  C. Suttner (TU Muenchen, Germany), G. Sutcliffe (James Cook
  University, Australia)

  SCAN - Elimination of predicate quantifiers system description
  H.J. Ohlbach (MPI Saarbruecken, Germany)

  GEOTHER: A geometry theorem prover
  D. Wang (LIFIA Institut Imag, France)

SESSION 3A                                               (16:00-17:30)
    Chair: U. Martin
 
  Structuring metatheory on inductive definitions
  D. Basin (MPI Saarbruecken, Germany), S. Matthews (MPI Saarbruecken,
  Germany)

  An embedding of Ruby in Isabelle
  O. Rasmussen (Technical University of Denmark, Denmark)

  Mechanical verification of mutually recursive procedures
  P. Homeier (UCLA, USA), D. Martin (UCLA, USA)

SESSION 3B                                               (16:00-17:30)
    Chair: G. Sutcliffe 

  FasTraC - A decentralized traffic control system based on logic
  programming
  G. Felici (University of Texas, USA), G. Rinaldi (CNR-IASI, Italy),
  K. Truemper (University of Texas, USA)

  Presenting machine-found proofs
  X. Huang (University of the Saarlandes, Germany), A. Fiedler
  (University of the Saarlandes, Germany)

  MUltlog 1.0: Towards an expert system for many-valued logics
  G. Salzer (TU Wien, Austria)

  CtCoq: a system presentation
  J. Bertot (INRIA Sophia-Antipolis, France), Y. Bertot (INRIA
  Sophia-Antipolis, France)

  An introduction to geometry expert
  Shang-Ching Chou (Wichita State University, USA), Xiao-Shan Gao
  (Wichita State University, USA), Jing-Zhong Zhang (Wichita State
  University, USA)

  SiCoTHEO: Simple Competitive Parallel Theorem Provers
  J. Schumann (Techniche University of Muenchen, Germany)


THURSDAY, 1 August
==================

INVITED LECTURE                                           (9:00-10:15)
    Chair: M. McRobbie
  Dana S. Scott (Carnegie Mellon University, USA):
  What Can We Hope to Achieve From Automated Deduction?

SESSION 4A                                               (10:45-12:15)
    Chair: M. Rusinowitch
 
  Unification algorithms cannot be combined in polynomial time
  M. Hermann (CRIN (CNRS), France), P.G. Kolaitis (UC Santa Cruz, USA)

  Unification and matching modulo nilpotence
  Q. Guo (SUNY Albany, USA), P. Narandran (SUNY Albany, USA),
  D. Wolfram (ANU, Australia)

  An improved lower bound for the elementary theories of trees
  S. Vorobyov (MPI Saarbruecken, Germany)

SESSION 4B                                               (10:45-12:15)
    Chair: F. Giunchiglia
 
  INKA: The next generation
  D. Hutter (DFKI, Germany), C. Sengler (DFKI, Germany)

  XRay: A prolog technology default theorem prover
  T. Schaub (Universite d'Angers, France), S. Bruning (ZB
  Informationssysteme, Germany), T. Linke (University of Bremen,
  Germany), P. Nicolas (Universite d'Angers, France)

  IMPS: An Updated System Description
  W. Farmer (The Mitre Corporation, USA), J. Guttman (The Mitre
  Corporation, USA), J. Thayer (The Mitre Corporation, USA)

  The tableau-based theorem prover 3 TAP, version 4.0
  B. Beckert (University of Karlsruhe, Germany), R. Hahnle (University
  of Karlsruhe, Germany), P. Oel (University of Karlsruhe, Germany),
  M. Sulzmann (University of Karlsruhe, Germany)

  Generating models by SEM
  J. Zhang (University of Iowa, USA), H. Zhang (University of Iowa,
  USA)

SESSION 5A                                               (14:00-15:30)
    Chair: A. Felty
 
  Optimizing proof search in model elimination
  J. Harrison (Abo Akademi University, Finland)

  An abstract machine for fixed-order dynamically stratified programs
  K. Sagonas (SUNY Stony Brook, USA), T. Swift (SUNY Stony Brook,
  USA), D. Warren (SUNY Stony Brook, USA)

  Unification in pseudo-linear sort theories is decidable
  C. Weidenbach (MPI Saarbruecken, Germany)

SESSION 5B                                               (14:00-15:30)
    Chair: S. Garland
 
  Theorem proving with group presentations: Examples and questions
  U. Martin (University of St. Andrews, Scotland)

  Transforming termination by self-labelling
  A. Middledorp (University of Tsukuba, Japan), H. Ohsaki (University
  of Tsukuba, Japan), H. Zantema (Utrecht University, Netherlands)

  Theorem proving in cancellative abelian monoids (extended abstract)
    H. Ganzinger (MPI Saarbruecken, Germany), U. Waldmann (MPI
    Saarbruecken, Germany)

SESSION 6A                                               (16:00-17:30)
    Chair: J. Schumann
 
  On the practical value of different definitional translations to
  normal form
  U. Egly (TU Wien, Austria), T. Rath (Technische Hochschule
  Darmstadt, Germany)

  On converting non-classical matrix proofs into sequent-style systems
  C. Kreitz (Technische Hochschule Darmstadt, Germany), S. Schmitt
  (Technische Hochschule Darmstadt, Germany)

  Efficient model generation through compilation
  H. Schuetz (Ludwig-Maximilians University of Muenchen, Germany),
  T. Geisler (Ludwig-Maximilians University of Muenchen, Germany)

SESSION 6B                                               (16:00-17:30)
    Chair: D. Wang
 
  Algebra and automated deduction
  S. Linton (University of St. Andrews, Scotland), U. Martin
  (University of St. Andrews, Scotland), P. Prohle (University of
  St. Andrews, Scotland), D. Shand (University of St. Andrews,
  Scotland)

  On Shostak's decision procedure for combinations of theories
  N. Shankar (SRI International, USA), D. Cyrluk (SRI International,
  USA), P. Lincoln (SRI International, USA)

  Ground resolution with group computations on semantic symmetries
  T. Boy de la Tour (LIFIA-IMAG, France)

JOINT BANQUET WITH CAV                                   (18:30-23:00)
  Dinner speech by Amir Pnueli (Weizmann Institute, Israel):
  The Potential and Sensible Scopes of Formal Methods


FRIDAY, 2 August
================

PLENARY SESSION WITH CAV                                  (9:00-10:15)
    Chair: M.Y. Vardi
  John Rushby (SRI International, USA):
  Automated Deduction and Formal Methods

SESSION 7A                                               (10:45-12:15)
    Chair: D. Plaisted
 
  A new method for logical compilation: the achievement by cycle search
  O. Roussel (LIFL CNRS, France), P. Mathieu (LIFL CNRS, France)

  Rewrite semantics for production rule systems: theory and applications
  W. Snyder (Boston University, USA), J.G. Schomolze (Tufts
  University, USA)

  Experiments in the heuristic use of past proof experience
  Matthias Fuchs (University of Kaiserslautern, Germany)

SESSION 7B                                               (10:45-12:15)
    Chair: U. Reddy
 
  Lemma Discovery in automating induction
  D. Kapur (SUNY Albany, USA), M. Subramaniam (SUNY Albany, USA)

  Advanced indexing operations on substitution trees
  P. Graf (MPI Saarbruecken, Germany), C. Meyer (MPI Saarbruecken,
  Germany)

  Semantic trees revisted - some new completeness results
  C.G. Fermuller (Stanford University, USA)

EXCURSION                                                      (13:30)


SATURDAY, 3 August
==================

PANEL DISCUSSION                                          (9:00-10:15)
    Chairs: Don Loveland & Deepak Kapur
  Does Automated Deduction Have a Future?

SESSION 8A                                               (10:45-12:15)
    Chair: L. Farinas del Cerro
 
  Building decision procedures for modal logics from propositional
  decision  procedures - the case study of modal K* 
  F. Giunchiglia (IRST, Italy), R. Sebastiani (University of Genoa,
  Italy)

  Resolution-based calculi for modal and temporal logics
  A. Nonnengart (MPI Saarbruecken, Germany)

  Tableaux and algorithms for propositional dynamic logic with converse
  G. De Giacomo (Universta di Roma, Italy), F. Massacci (Universta di
  Roma, Italy)

SESSION 8B                                               (10:45-12:15)
    Chair: L. Wallen
 
  Reflection of formal tactics in a deductive reflection framework
  H. Ruess (University of Ulm, Germany)

  Walther Recursion
  D. McAllester (AT&T Laboratories, USA), K. Arkoudas (MIT, USA)

  Proof search with set variable instantiation in the calculus of
  constructions
  A. Felty (Bell Labs, USA)

SESSION 9A                                               (14:00-15:30)
    Chair: A. Voronkov 

  Search strategies for resolution in temporal logic
  C. Dixon (Manchester Metropolitan University, UK)

  Optimal axiomatizations for multiple-valued operations and
  quantifiers based  on semi-lattices
  G. Salzer (TU Wien, Austria)

  Grammar Specification in Categorical Logics and Theorem Proving
  S. Luz-Filho (Edinburgh University, Scotland)

SESSION 9B                                               (14:00-15:30)
    Chair: E. Gunter
 
  Path Indexing for AC-Theories
  P. Graf (MPI Saarbruecken, Germany)

  More Church-Rosser Proofs (in Isabelle/HOL)
  T. Nipkow (TU Muenchen, Germany)

  Partitioning methods for satisfiability testing on large formulas
  Tai Joon Park (UC Santa Cruz, USA), A. van Gelder (UC Santa Cruz,
  USA)

BUSINESS MEETING                                         (16:00-17:30)

                         END OF CONFERENCE

---------------------------------------------------------------------
(4) CADE-13 Automated Theorem Proving System Competition, 1 Aug, 1996
---------------------------------------------------------------------
    
In order to stimulate ATP system development and to expose ATP systems
to interested researchers, an ATP competition will be held at CADE-13.
The competition will evaluate the performance of sound fully automatic
ATP systems, on first-order CNF theorems chosen from the TPTP Problem
Library.  The evaluation will be in terms of the number of theorems
proved, and the time taken; in the context of a specified time limit
for each proof attempt, and a bounded number of eligible TPTP
theorems.  An overview of the competition and the rules is available
on the WWW:

   http://wwwjessen.informatik.tu-muenchen.de/~suttner/Competition.html

and full details are given in the competition technical report,
accessible through the WWW page.  Enquiries can be sent to the
competition organizers.

ARPA-owned and maintained machines will be provided for the
competition by the Center for Computer Aids for Industrial
Productivity, Rutgers University.

Competition Organizing Committee:
  Christian Suttner (TU Muenchen, Germany)
        suttner@informatik.tu-muenchen.de
  Geoff Sutcliffe (James Cook University, Australia)
        geoff@cs.jcu.edu.au

The competition schedule is below.  A continuous overview of current
results will be displayed while the competition is in progress. System
demonstrations will also be possible while the competition is in
progress.

Meeting of Competitors                                   (10:30)

Competition in Progress                            (10:45-17:00)

Announcement of Competition Results by Competition Panel (17:35)

-------------------------------------------------------------
(5) Woody Bledsoe Student Travel Award - Call For Nominations 
-------------------------------------------------------------
The board of trustees of the Conference on Automated Deduction
Inc. (CADE) have created an award in honor of the memory of Woody
Bledsoe for his contributions to mathematics, artificial intelligence,
and automated theorem proving, and for his dedication to students.

The award is intended to cover most of the expense for one student
working in the field of automated deduction to attend CADE-13.  The
winner will receive $350 (US) for local expenses and up to $650 for
transportation expenses, and the CADE registration fee will be waived.

Preference will be given to students who will be playing an active
role in the conference and to students who do not have alternative
funding.

Nominations, which should include a recommendation of up to 300 words
from the student's supervisor, should be sent by e-mail (preferred) to
mccune@mcs.anl.gov or by ordinary mail to William McCune, MCS-221,
Argonne National Laboratory, Argonne IL 60439, U.S.A.  Nominations
must arrive no later than May 15, and the winner will be notified by
June 1.  The award will be presented at CADE-13; in case the winner
cannot attend, the trustees may transfer the award to another nominee.

---------------------------------------------------------
(6) Pointer to Registration and Accommodation Information
---------------------------------------------------------
Information on location, travel, social events, and accommodation, as
well as registration forms can be obtained via the FLoC web page, or
via ftp.

    CADE on the Web: http://www.research.att.com/lics/FLoC/cade13/
    FLoC on the Web: http://www.research.att.com/lics/FLoC/
                     ftp://ftp.research.att.com/dist/floc/

If you do not have access, contact CADE-13 local arrangements.

    Email: cade13-la@cisr.anu.edu.au

As well as CADE, other conferences participating in FLoC'96 are the
8th International Conference on Computer-Aided Verification (CAV), the
11th Annual IEEE Symposium on Logic in Computer Science (LICS), and
the 7th International Conference on Rewriting Techniques and
Applications (RTA).

-------------------
(7) Important Dates
-------------------
Event:                                                   Deadline: 

ATP System Competition Registration                      1 May 1996
Workshop WP-3 Submission                                 1 May 1996
Workshop WP-4 Submission                                 10 May 1996
Workshop WP-6 Submission                                 12 May 1996
Nomination for Woody Bledsoe Student Travel Award        15 May 1996
Workshop WP-5 Submission                                 24 May 1996
FLoC'96 Early Registration                               21 Jun 1996
On-Campus Housing Reservation                            21 Jun 1996
Hotel Reservation                                        28 Jun 1996

From Lewisarons@aol.com  Thu Apr 25 20:36:06 1996
Return-Path: <Lewisarons@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id UAA02698; Thu, 25 Apr 1996 20:36:05 -0500
From: Lewisarons@aol.com
Received: from emout09.mail.aol.com (emout09.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA24435; Thu, 25 Apr 96 20:35:47 CDT
Received: by emout09.mail.aol.com (8.6.12/8.6.12) id VAA28081; Thu, 25 Apr 1996 21:11:29 -0400
Date: Thu, 25 Apr 1996 21:11:29 -0400
Message-Id: <960425211128_382940206@emout09.mail.aol.com>
To: internet.announcement.service@r1.f64.n8769.z303.fidonet.org
Subject: Fantastic Free Offer I found on the net
content-length: 11171


---------------------
Forwarded message:
Subj:    Fantastic Free Offer I found on the net
Date:    96-04-25 18:48:53 EDT
From:    Lewisarons
To:      Lewisarons

To: internet.announcement.service@r1.f64.n8769.z303.fidonet.org

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Lewis Arons.
040896-l-ifo

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Lewis Arons and I recently started using a magazine subscription
club in the USA that has a FREE 1 yr. magazine subscription deal with your
first paid order- and I have been very pleased with them.    They have over
1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Lewis Arons




From Lewisarons@aol.com  Thu Apr 25 20:36:53 1996
Return-Path: <Lewisarons@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id UAA02702; Thu, 25 Apr 1996 20:36:52 -0500
From: Lewisarons@aol.com
Received: from emout07.mail.aol.com (emout07.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA24448; Thu, 25 Apr 96 20:36:30 CDT
Received: by emout07.mail.aol.com (8.6.12/8.6.12) id VAA05862; Thu, 25 Apr 1996 21:11:22 -0400
Date: Thu, 25 Apr 1996 21:11:22 -0400
Message-Id: <960425211121_382940090@emout07.mail.aol.com>
To: internet.announcement.service@r1.f64.n8769.z303.fidonet.org
Subject: Fantastic Free Offer I found on the net
content-length: 11171


---------------------
Forwarded message:
Subj:    Fantastic Free Offer I found on the net
Date:    96-04-25 18:48:53 EDT
From:    Lewisarons
To:      Lewisarons

To: internet.announcement.service@r1.f64.n8769.z303.fidonet.org

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Lewis Arons.
040896-l-ifo

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Lewis Arons and I recently started using a magazine subscription
club in the USA that has a FREE 1 yr. magazine subscription deal with your
first paid order- and I have been very pleased with them.    They have over
1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Lewis Arons




From SElli97635@aol.com  Sat Apr 27 13:39:23 1996
Return-Path: <SElli97635@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id NAA04674; Sat, 27 Apr 1996 13:39:22 -0500
From: SElli97635@aol.com
Received: from emout19.mail.aol.com (emout19.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA24414; Sat, 27 Apr 96 13:39:13 CDT
Received: by emout19.mail.aol.com (8.6.12/8.6.12) id OAA03177; Sat, 27 Apr 1996 14:10:00 -0400
Date: Sat, 27 Apr 1996 14:10:00 -0400
Message-Id: <960427141000_282094169@emout19.mail.aol.com>
Subject: Interesting Free Offer........
Apparently-To: <nqthm-users@cli.com>
content-length: 11181


---------------------
Forwarded message:
Subj:    Interesting Free Offer........
Date:    96-04-27 13:08:08 EDT
From:    SElli97635
To:      SElli97635

To: internet.announcement.service@r1.f64.n8769.z303.fidonet.org


-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Sally Ann Ellison.
042796-l-ifo

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Sally Ann Ellison and I recently started using a magazine
subscription club in the USA that has a FREE 1 yr. magazine subscription deal
with your first paid order- and I have been very pleased with them.    They
have over 1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 295 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Sally Ann Ellison




From Szanzer@aol.com  Mon Apr 29 13:21:55 1996
Return-Path: <Szanzer@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id NAA05704; Mon, 29 Apr 1996 13:21:55 -0500
From: Szanzer@aol.com
Received: from emout07.mail.aol.com (emout07.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA00868; Mon, 29 Apr 96 13:20:59 CDT
Received: by emout07.mail.aol.com (8.6.12/8.6.12) id NAA20227; Mon, 29 Apr 1996 13:36:45 -0400
Date: Mon, 29 Apr 1996 13:36:45 -0400
Message-Id: <960429133644_480675532@emout07.mail.aol.com>
Subject: Unusual Promotion for 1st Time Users
Apparently-To: <nqthm-users@cli.com>
content-length: 11258


---------------------
Forwarded message:
Subj:    FREE 1 yr MagazineSub sent worldwide-270+ Popular USA Titles
Date:    96-04-29 11:30:23 EDT
From:    Szanzer

To:      internet.announcement.service@r9.f64.n7365.z202.fidonet.org

How to save on all your computer magazines and 1,500 other popular USA
titles!


-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by:  Susan Zanzer.
042996-l-foy

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Susan Zanzer and I recently started using a magazine subscription
club in the USA that has a FREE 1 yr. magazine subscription deal with your
first paid order- and I have been very pleased with them.    They have over
1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 270 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Susan Zanzer




From Stuartmall@aol.com  Tue Apr 30 15:07:45 1996
Return-Path: <Stuartmall@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id PAA06289; Tue, 30 Apr 1996 15:07:45 -0500
From: Stuartmall@aol.com
Received: from emout16.mail.aol.com (emout16.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA14702; Tue, 30 Apr 96 15:07:23 CDT
Received: by emout16.mail.aol.com (8.6.12/8.6.12) id PAA02178; Tue, 30 Apr 1996 15:29:52 -0400
Date: Tue, 30 Apr 1996 15:29:52 -0400
Message-Id: <960430152951_386859628@emout16.mail.aol.com>
Subject: ===>> FREE 1 yr USA Magazine Sub sent worldwide-270+ Choices!
Apparently-To: <nqthm-users@cli.com>
content-length: 11255


---------------------
Forwarded message:
Subj:    ===>> FREE 1 yr USA Magazine Sub sent worldwide-270+ Choices!
Date:    96-04-30 13:47:50 EDT
From:    Stuartmall

To:      internet.announcement.reflector@r6.f62.n4465.z112.fidonet.org

internet.announcement.reflector@r6.f62.n4465.z112.fidonet.org


-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by: Stuart Mallory.
    
043096-l-f1y

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Stuart Mallory and I recently started using a magazine
subscription club in the USA that has a FREE 1 yr. magazine subscription deal
with your first paid order- and I have been very pleased with them.    They
have over 1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 270 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Stuart Mallory


From Jeanchev@aol.com  Sat May  4 15:27:06 1996
Return-Path: <Jeanchev@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id PAA08889; Sat, 4 May 1996 15:27:05 -0500
From: Jeanchev@aol.com
Received: from emout12.mail.aol.com (emout12.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA12168; Sat, 4 May 96 15:26:58 CDT
Received: by emout12.mail.aol.com (8.6.12/8.6.12) id PAA25147; Sat, 4 May 1996 15:37:08 -0400
Date: Sat, 4 May 1996 15:37:08 -0400
Message-Id: <960504153707_287142984@emout12.mail.aol.com>
Subject: CRaZy Complimentary Offer........
Apparently-To: <nqthm-users@cli.com>
content-length: 11078


---------------------
Forwarded message:
Subj:    CRaZy Complimentary Offer........
Date:    96-05-04 14:44:00 EDT
From:    Jeanchev

To:      free_offer_news.reflector@usenet.vax1.zer2.co.np

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by: Jean Chevalier.
    
05046-l-cco

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Jean Chevalier and I recently started using a magazine
subscription club in the USA that has a FREE 1 yr. magazine subscription deal
with your first paid order- and I have been very pleased with them.    They
have over 1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 270 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Jean Chevalier



From Approved99@aol.com  Wed May  8 23:34:34 1996
Return-Path: <Approved99@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id XAA11124; Wed, 8 May 1996 23:34:34 -0500
From: Approved99@aol.com
Received: from emout17.mail.aol.com (emout17.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA23841; Wed, 8 May 96 23:34:27 CDT
Received: by emout17.mail.aol.com (8.6.12/8.6.12) id AAA22547; Thu, 9 May 1996 00:18:23 -0400
Date: Thu, 9 May 1996 00:18:23 -0400
Message-Id: <960509001822_394313736@emout17.mail.aol.com>
Subject: ===>> FREE 1 yr USA Magazine Sub sent worldwide-270+ Choices!
Apparently-To: <nqthm-users@cli.com>
content-length: 11117

Approved by: moderator
---------------------
Forwarded message:
Subj:    ===>> FREE 1 yr USA Magazine Sub sent worldwide-270+ Choices!
Date:    96-05-08 20:26:18 EDT
From:    Approved99

To:      usenet.mail-to-news.reflector@usenet.vax1.zer2.co.np

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by: Helen Ng.     
050896-l-foy

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Helen Ng and I recently started using a magazine subscription club
in the USA that has a FREE 1 yr. magazine subscription deal with your first
paid order- and I have been very pleased with them.    They have over 1,500
different USA titles that they can ship to any country on a subscription
basis.   As for computer magazines from the USA, they more of a selection
than I ever knew even existed.  They have magazines for most every area of
interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 270 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Helen Ng



From Conroy675@aol.com  Thu May  9 20:13:34 1996
Return-Path: <Conroy675@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id UAA11682; Thu, 9 May 1996 20:13:34 -0500
From: Conroy675@aol.com
Received: from emout19.mail.aol.com (emout19.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA19189; Thu, 9 May 96 20:13:21 CDT
Received: by emout19.mail.aol.com (8.6.12/8.6.12) id UAA06610; Thu, 9 May 1996 20:53:04 -0400
Date: Thu, 9 May 1996 20:53:04 -0400
Message-Id: <960509205259_110396947@emout19.mail.aol.com>
Subject: Interesting place I found in a remote corner of the net
Apparently-To: <nqthm-users@cli.com>
content-length: 11038


---------------------
Forwarded message:
Subj:    Interesting place I found in a remote corner of the net
Date:    96-05-09 17:54:05 EDT
From:    Conroy675

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by: Jennie Conroy     
050996-l-wtl

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Jennie Conroy and I recently started using a magazine subscription
club in the USA that has a FREE 1 yr. magazine subscription deal with your
first paid order- and I have been very pleased with them.    They have over
1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 270 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Jenny Conroy



From JBell30480@aol.com  Wed May 15 18:11:31 1996
Return-Path: <JBell30480@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id SAA15642; Wed, 15 May 1996 18:11:31 -0500
From: JBell30480@aol.com
Received: from emout18.mail.aol.com (emout18.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA24958; Wed, 15 May 96 18:11:18 CDT
Received: by emout18.mail.aol.com (8.6.12/8.6.12) id SAA08758; Wed, 15 May 1996 18:46:37 -0400
Date: Wed, 15 May 1996 18:46:37 -0400
Message-Id: <960515184637_114372502@emout18.mail.aol.com>
Subject: World's *Cheapest* Way to get USA Magazine Subscriptions
Apparently-To: <nqthm-users@cli.com>
content-length: 11213


---------------------
Forwarded message:
Subj:    World's *Cheapest* Way to get USA Magazine Subscriptions
Date:    96-05-15 17:50:32 EDT
From:    JBell30480

To:      www.posting.reflector@usenet.vax1.zer2.co.np

===>> World's *Cheapest* Way to get USA Magazine Subscriptions delivered to
*any* country (1,500+ USA titles to choose from).

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by: Jennie Bell     
051596-n

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Jennie Bell and I recently started using a magazine subscription
club in the USA that has a FREE 1 yr. magazine subscription deal with your
first paid order- and I have been very pleased with them.    They have over
1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 270 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Jennie Bell



From M.Kerber@cs.bham.ac.uk  Thu May 16 06:50:07 1996
Return-Path: <M.Kerber@cs.bham.ac.uk>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id GAA15931; Thu, 16 May 1996 06:50:06 -0500
Received: from percy.cs.bham.ac.uk by cli.com (4.1/SMI-4.1)
	id AA08033; Thu, 16 May 96 06:50:03 CDT
Message-Id: <9605161150.AA08033@cli.com>
Received: from wallace by percy.cs.bham.ac.uk with SMTP (PP) 
          id <15258-0@percy.cs.bham.ac.uk>; Thu, 16 May 1996 12:47:45 +0100
To: nqthm-users@cli.com
Cc: M.Kerber@cs.bham.ac.uk
Subject: 2nd CFP CADE-WS Mechanization of Partial Functions
Date: Thu, 16 May 1996 12:47:40 +0100
From: Manfred Kerber <M.Kerber@cs.bham.ac.uk>
content-length: 2571

             Second  Call  for  Participation

                   CADE-13 Workshop on

             MECHANIZATION OF PARTIAL FUNCTIONS

                       30 July 1996
            Rutgers University, New Brunswick, USA


Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of partial
functions.  There is a rich variety of approaches for dealing with
partial functions and the undefined expressions that often result from
their application.  Ranging from workarounds for concrete situations to
proper general treatments, these approaches have their own advantages
and disadvantages.  For example, some can be used in standard logical
formalisms, while others require new formalisms.  The purpose of the
workshop is to discuss the different approaches and to compare their
advantages and disadvantages.

The workshop will solicit two kinds of contributions:

- - Short papers (up to 6 pages) which argue for a particular approach to
  mechanizing partial functions.
- - Ordinary research papers (up to 12 pages) which address issues
  concerning the use and implementation of partial functions in
  automated reasoning systems.

Potential participants can apply either by submitting a short
statement that contains a description of their current interests or,
if they wish to make a (short or long) presentation, an abstract of
the work they want to present.  The short statements and abstracts
should be sent by e-mail to Manfred Kerber at M.Kerber@cs.bham.ac.uk
by 24 May.  Please include your postal address, e-mail address, and
phone number.  Final versions of accepted contributions are due by 28
June.  They will be made available by WWW and will appear in an
informal proceedings produced by CADE.

Those invited to attend the workshop have to register for the workshop
in conjunction with the CADE main conference.
                              
Organizers: 

   William Farmer, The MITRE Corporation, USA, farmer@mitre.org
   Manfred Kerber, University of Birmingham, UK, M.Kerber@cs.bham.ac.uk
   Michael Kohlhase, Uni des Saarlandes, Germany, kohlhase@cs.uni-sb.de

Important Dates:

   Deadline for submissions of abstracts:           24 May  1996
   Notification of acceptance/rejection:             7 June 1996
   Early registration for CADE:                     21 June 1996
   Final paper due                                  28 June 1996
   Workshop                                         30 July 1996

Further information: http://www.cs.bham.ac.uk/~mmk/cade96-partiality/

From sandel@cli.com  Thu May 16 10:37:24 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id KAA16006; Thu, 16 May 1996 10:37:24 -0500
Received: from blanco (blanco.cli.com) by cli.com (4.1/SMI-4.1)
	id AA08558; Thu, 16 May 96 10:37:24 CDT
From: sandel@cli.com (Charles Sandel)
Received: by blanco (SMI-8.6) id KAA18166; Thu, 16 May 1996 10:37:22 -0500
Date: Thu, 16 May 1996 10:37:22 -0500
Message-Id: <199605161537.KAA18166@blanco>
Subject: Non-member submission from [Manfred Kerber <M.Kerber@cs.bham.ac.uk>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-Md5: xQy0W0CK1Cr8E+B9PQRe4w==
content-length: 3498

------------- Begin Forwarded Message -------------

>From owner-nqthm-users Thu May 16 06:50:10 1996
Date: Thu, 16 May 96 06:50:10 CDT
From: owner-nqthm-users
To: owner-nqthm-users
Subject: BOUNCE nqthm-users: Non-member submission from [Manfred Kerber <M.Kerber@cs.bham.ac.uk>]

>From M.Kerber@cs.bham.ac.uk (M.Kerber@cs.bham.ac.uk)  Thu May 16 06:50:03 1996
Return-Path: <M.Kerber@cs.bham.ac.uk>
Received: from percy.cs.bham.ac.uk by cli.com (4.1/SMI-4.1)
	id AA08033; Thu, 16 May 96 06:50:03 CDT
Message-Id: <9605161150.AA08033@cli.com>
Received: from wallace by percy.cs.bham.ac.uk with SMTP (PP) 
          id <15258-0@percy.cs.bham.ac.uk>; Thu, 16 May 1996 12:47:45 +0100
To: nqthm-users@cli.com
Cc: M.Kerber@cs.bham.ac.uk
Subject: 2nd CFP CADE-WS Mechanization of Partial Functions
Date: Thu, 16 May 1996 12:47:40 +0100
From: Manfred Kerber <M.Kerber@cs.bham.ac.uk>

             Second  Call  for  Participation

                   CADE-13 Workshop on

             MECHANIZATION OF PARTIAL FUNCTIONS

                       30 July 1996
            Rutgers University, New Brunswick, USA


Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of partial
functions.  There is a rich variety of approaches for dealing with
partial functions and the undefined expressions that often result from
their application.  Ranging from workarounds for concrete situations to
proper general treatments, these approaches have their own advantages
and disadvantages.  For example, some can be used in standard logical
formalisms, while others require new formalisms.  The purpose of the
workshop is to discuss the different approaches and to compare their
advantages and disadvantages.

The workshop will solicit two kinds of contributions:

- - Short papers (up to 6 pages) which argue for a particular approach to
  mechanizing partial functions.
- - Ordinary research papers (up to 12 pages) which address issues
  concerning the use and implementation of partial functions in
  automated reasoning systems.

Potential participants can apply either by submitting a short
statement that contains a description of their current interests or,
if they wish to make a (short or long) presentation, an abstract of
the work they want to present.  The short statements and abstracts
should be sent by e-mail to Manfred Kerber at M.Kerber@cs.bham.ac.uk
by 24 May.  Please include your postal address, e-mail address, and
phone number.  Final versions of accepted contributions are due by 28
June.  They will be made available by WWW and will appear in an
informal proceedings produced by CADE.

Those invited to attend the workshop have to register for the workshop
in conjunction with the CADE main conference.
                              
Organizers: 

   William Farmer, The MITRE Corporation, USA, farmer@mitre.org
   Manfred Kerber, University of Birmingham, UK, M.Kerber@cs.bham.ac.uk
   Michael Kohlhase, Uni des Saarlandes, Germany, kohlhase@cs.uni-sb.de

Important Dates:

   Deadline for submissions of abstracts:           24 May  1996
   Notification of acceptance/rejection:             7 June 1996
   Early registration for CADE:                     21 June 1996
   Final paper due                                  28 June 1996
   Workshop                                         30 July 1996

Further information: http://www.cs.bham.ac.uk/~mmk/cade96-partiality/

------------- End Forwarded Message -------------


From owner-nqthm-users@cli.com  Thu May 16 12:07:53 1996
Return-Path: <owner-nqthm-users@cli.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id MAA16034; Thu, 16 May 1996 12:07:52 -0500
Received: by cli.com (4.1/SMI-4.1)
	id AA08565; Thu, 16 May 96 10:37:26 CDT
Received: from blanco (blanco.cli.com) by cli.com (4.1/SMI-4.1)
	id AA08558; Thu, 16 May 96 10:37:24 CDT
From: sandel@cli.com (Charles Sandel)
Received: by blanco (SMI-8.6) id KAA18166; Thu, 16 May 1996 10:37:22 -0500
Date: Thu, 16 May 1996 10:37:22 -0500
Message-Id: <199605161537.KAA18166@blanco>
Subject: Non-member submission from [Manfred Kerber <M.Kerber@cs.bham.ac.uk>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-Md5: xQy0W0CK1Cr8E+B9PQRe4w==
Sender: owner-nqthm-users@cli.com
Precedence: bulk
content-length: 3498

------------- Begin Forwarded Message -------------

>From owner-nqthm-users Thu May 16 06:50:10 1996
Date: Thu, 16 May 96 06:50:10 CDT
From: owner-nqthm-users
To: owner-nqthm-users
Subject: BOUNCE nqthm-users: Non-member submission from [Manfred Kerber <M.Kerber@cs.bham.ac.uk>]

>From M.Kerber@cs.bham.ac.uk (M.Kerber@cs.bham.ac.uk)  Thu May 16 06:50:03 1996
Return-Path: <M.Kerber@cs.bham.ac.uk>
Received: from percy.cs.bham.ac.uk by cli.com (4.1/SMI-4.1)
	id AA08033; Thu, 16 May 96 06:50:03 CDT
Message-Id: <9605161150.AA08033@cli.com>
Received: from wallace by percy.cs.bham.ac.uk with SMTP (PP) 
          id <15258-0@percy.cs.bham.ac.uk>; Thu, 16 May 1996 12:47:45 +0100
To: nqthm-users@cli.com
Cc: M.Kerber@cs.bham.ac.uk
Subject: 2nd CFP CADE-WS Mechanization of Partial Functions
Date: Thu, 16 May 1996 12:47:40 +0100
From: Manfred Kerber <M.Kerber@cs.bham.ac.uk>

             Second  Call  for  Participation

                   CADE-13 Workshop on

             MECHANIZATION OF PARTIAL FUNCTIONS

                       30 July 1996
            Rutgers University, New Brunswick, USA


Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of partial
functions.  There is a rich variety of approaches for dealing with
partial functions and the undefined expressions that often result from
their application.  Ranging from workarounds for concrete situations to
proper general treatments, these approaches have their own advantages
and disadvantages.  For example, some can be used in standard logical
formalisms, while others require new formalisms.  The purpose of the
workshop is to discuss the different approaches and to compare their
advantages and disadvantages.

The workshop will solicit two kinds of contributions:

- - Short papers (up to 6 pages) which argue for a particular approach to
  mechanizing partial functions.
- - Ordinary research papers (up to 12 pages) which address issues
  concerning the use and implementation of partial functions in
  automated reasoning systems.

Potential participants can apply either by submitting a short
statement that contains a description of their current interests or,
if they wish to make a (short or long) presentation, an abstract of
the work they want to present.  The short statements and abstracts
should be sent by e-mail to Manfred Kerber at M.Kerber@cs.bham.ac.uk
by 24 May.  Please include your postal address, e-mail address, and
phone number.  Final versions of accepted contributions are due by 28
June.  They will be made available by WWW and will appear in an
informal proceedings produced by CADE.

Those invited to attend the workshop have to register for the workshop
in conjunction with the CADE main conference.
                              
Organizers: 

   William Farmer, The MITRE Corporation, USA, farmer@mitre.org
   Manfred Kerber, University of Birmingham, UK, M.Kerber@cs.bham.ac.uk
   Michael Kohlhase, Uni des Saarlandes, Germany, kohlhase@cs.uni-sb.de

Important Dates:

   Deadline for submissions of abstracts:           24 May  1996
   Notification of acceptance/rejection:             7 June 1996
   Early registration for CADE:                     21 June 1996
   Final paper due                                  28 June 1996
   Workshop                                         30 July 1996

Further information: http://www.cs.bham.ac.uk/~mmk/cade96-partiality/

------------- End Forwarded Message -------------


From Shyamala87@aol.com  Thu May 16 18:53:07 1996
Return-Path: <Shyamala87@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id SAA16162; Thu, 16 May 1996 18:53:06 -0500
From: Shyamala87@aol.com
Received: from emout18.mail.aol.com (emout18.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA09744; Thu, 16 May 96 18:53:00 CDT
Received: by emout18.mail.aol.com (8.6.12/8.6.12) id TAA21770; Thu, 16 May 1996 19:36:35 -0400
Date: Thu, 16 May 1996 19:36:35 -0400
Message-Id: <960516193635_492607835@emout18.mail.aol.com>
Subject: FAQ on FREE 1 yr. USA Magazine Sub Offer (275+ choices)
Apparently-To: <nqthm-users@cli.com>
content-length: 11114


---------------------
Forwarded message:
Subj:    FAQ on FREE 1 yr. USA Magazine Sub Offer (275+ choices)
Date:    96-05-16 18:25:21 EDT
From:    Shyamala87

To:      www.posting.reflector@usenet.vax1.zer2.co.np

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by: Shyamala
Krishnamurty    
051696-l

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Shyamala Krishnamurty and I recently started using a magazine
subscription club in the USA that has a FREE 1 yr. magazine subscription deal
with your first paid order- and I have been very pleased with them.    They
have over 1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 270 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Shyamala Krishnamurty



From Morriswade@aol.com  Fri May 17 18:38:14 1996
Return-Path: <Morriswade@aol.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id SAA00283; Fri, 17 May 1996 18:38:14 -0500
From: Morriswade@aol.com
Received: from emout08.mail.aol.com (emout08.mx.aol.com) by cli.com (4.1/SMI-4.1)
	id AA00427; Fri, 17 May 96 18:37:59 CDT
Received: by emout08.mail.aol.com (8.6.12/8.6.12) id TAA22956; Fri, 17 May 1996 19:10:35 -0400
Date: Fri, 17 May 1996 19:10:35 -0400
Message-Id: <960517191034_493323756@emout08.mail.aol.com>
Subject: lowest prices on magazines ------> guaranteed
Apparently-To: <nqthm-users@cli.com>
content-length: 11080


---------------------
Forwarded message:
Subj:    lowest prices on magazines ------> guaranteed
Date:    96-05-17 18:07:02 EDT
From:    Morriswade

To:      www.posting.reflector@usenet.vax1.zer2.co.np

-----> NOTE:   Please first read my note which appears below the "Request for
more info Form."  Then, to get more info, just fill out the "Request for More
Info" form completely and *FAX* or *SMAIL* it back to the company.  You will
get a quick reply via email within 1 business day of receipt of the info
request form below. 

IMPORTANT NOTICE FOR THOSE FAXING IN THEIR REPLY:  Please make sure you
return *only* the below form and *no part* of this message other than the
actual form below.  If you do not know how to cut and paste the below form
onto a fresh clean blank page for faxing, then you may re-type the below
form, as long as you copy it line for line *exactly.*  This is necessary in
order for them to be able to process the tremendous number of replies that
they get daily.

Your fax goes directly onto their 4.2 gigabyte computer hard drive, not
paper, and all incoming fax calls are set-up to be *auto-terminated* and/or
*auto-deleted* from the incoming queue of faxes to be read, if your fax:

1. has a cover page;  
2. is more than one page
3. is sent more than one time
4. does not begin with the "cut here/begin" line from the below form
5. does not end with the "cut here/end" line from the below form.
6. has any handwritten info. on it (info must must be filled out *only* 
    with your computer keyboard or typewriter keyboard).  This last 
    provision re:  no handwriting on the form applies to requests sent in 
    via smail also.

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
NOTE:  Their fax line is open 24 hrs. per day / 7 days per week.   However,
 if you have trouble getting through due to the high volume of overseas faxes
coming in during the early morning and late night hours, please note that the
best time to get through to their fax is Monday-Friday, 9 am - 5 pm EST (New
York Time).  If you have trouble getting through to their fax, or do not have
a fax machine at work or at home, just drop the below form to them via smail
(airmail or first class mail).
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^



*------------cut here/begin-------------------------------------------*
REQUEST FOR MORE INFO:  please return *only* this section (with no cover
page) via 1-page fax to:
                              718-967-1550 in the USA

or via smail (first class mail or airmail) to:    
                                         Magazine Club Inquiry Center
                                         Att. FREE Catalogue-by-email Dept.
                                         PO Box 990
                                         Staten Island NY  10312-0990

Sorry, but incomplete forms *will not* be acknowledged.  If you do not
have an email address, or access to one, they will not be able to help you
until you do have one.  If you saw this message, then you should have one.
 :)

---> SORRY, BUT NO HANDWRITTEN FORMS WILL BE ACKNOWLEDGED.  
        MUST BE TYPED-OUT ON YOUR COMPUTER OR TYPEWRITER. <---

Name:
Internet email address:
Smail home address:
City-State-Zip:
Country:
Work Tel. #:
Work Fax #:
Home Tel. #:
Home Fax #:

How did you hear about us (name of person who referred you or the area of
the internet that you saw us mentioned in):  Referral by: Morris Wade.     
051796-l-lpg

Name of USA mags you currently get on the newsstand or in the store:

Name of USA mags you currently get on a subscription basis, through the mail:

Name of USA mags you would like price quotes on when we call you:

Catalogue format desired (list "1," "2," "3" or "4"):

*------------cut here/end--------------------------------------------*


Catalogue Format Options:
1.  19-Part email- can be read by EVERYONE (~525 K Total).
2.  For more advanced computer users:  attached text file ~525K - you
     must know how to download an attached text file and then be able to
     open it with your word processor.  If in doubt, don't ask for this
     version.  This isn't for internet *newbies.* Better to order option 1
     and spend a few minutes pasting them into one whole text document
     with your word processor, than to waste hours trying to figure how
     to deal with this option.
3.  For more advanced Macintosh computer users: compressed attached
     text file, created with a Stuffit(tm) self-extracting archive (.sea),
      ~133K.  Can be decompressed by any Macintosh computer user; no
     special expansion software or knowledge of Stuffit (tm) needed.  You
     just double-click on the file icon and it automatically expands
     (unstuffs). This is for more advanced mac computer users only, as 
     you still have to know how to deal with an attached file.  It will cut 
     your download time by 75%.   Expands out to the same ~525K file in 
     option #2.  See option #2 for more info on what you will need to be 
     able to do.
4.  For expert computer users: compressed attached text file, created with
     Stuffit(tm),  ~114K.  Can be decompressed by any computer user who
     has expansion software to decompress (expand) Stuffit(tm) (.sit) files.
     This is for more advanced computer users only and will cut your
     download time by 78%.   Expands out to the same ~525K file in option
     #2.  See option #2 for more info on what you will need to be able to do.



Hi fellow 'netters,

My name is Morris Wade and I recently started using a magazine subscription
club in the USA that has a FREE 1 yr. magazine subscription deal with your
first paid order- and I have been very pleased with them.    They have over
1,500 different USA titles that they can ship to any country on a
subscription basis.   As for computer magazines from the USA, they more of a
selection than I ever knew even existed.  They have magazines for most every
area of interest in their list of 1,500 titles.

Within the USA, for their USA members, they are cheaper than all their
competitors and even the publishers themselves.  This is their price
guarantee.

Overseas, on the average, they are generally around one-fourth to one-half of
what the newsstands overseas charge locally for USA magazines.  On some
titles they are as little as one-tenth of what the newsstands charge.  They
feel that mgazines should not be a luxury overseas.   In the USA, people buy
magazines and then toss them after reading them for just a few minutes or
hours.  They are so cheap in the USA!   Well, this company would like to make
it the same way for their overseas members.  They are also cheaper than all
their competitors in the USA and overseas, including the publishers
themselves!   This is their price guarantee.  Around one-half their business
comes from overseas, so they are very patient with new members who only speak
limited English as a 2nd language.

Their prices are so cheap because they deal direct with each publisher and
cut-out all the middlemen.

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

Please do not email me as I am just a happy customer and a *busy* student.  I
don't have time to even complete my thesis in time, let alone run my
part-time software business!  Please fill out the above form and carefully
follow the intructions above to get it to them via fax or smail.

They guarantee to beat all their competitors' prices. Sometimes they are less
than half of the next best deal I have been able to find and other times,
just a little cheaper - but I have never found a lower rate yet.  They
assured me that if I ever do, they will beat it.  

They have been very helpful and helped me with all my address changes as I
haved moved from one country to another.

They have a deal where you can get a free 1 yr. sub to a new magazine from a
special list of over 270 popular titles published in the USA.   They will
give you this free 1 yr. sub when you place your first paid order with them
to a renewal or new subscription to any of the over 1,500 different popular
USA titles they sell.  

They can arrange delivery to virtually any country and I think they have
clients in around 45 or 46 countries now.  Outside the USA there is a charge
for FPH (foreign postage and handling) (on both paid and freebie subs) that
varies from magazine to magazine.  I have found their staff to be very
friendly and courteous.  They even helped me with an address change when I
moved from one country to another.
 
The owner thinks of his service as a "club" and his clients as "members"
(even though there is no extra fee to become a member - your first purchase
automatically makes you a member) and he is real picky about who he accepts
as a new member.   When he sets you up as a new member, he himself calls you
personally on the phone to explain how he works his deal, or sometimes he has
one of his assistants call.  He is kind of quirky sometimes - he insists on
setting up new members by phone so he can say hi to everyone (I sure wouldn't
want to have his phone bills!),  but you can place future orders (after your
first order) via E-mail.   

He has some really friendly young ladies working for him, who seem to know
just as much as he does about this magazine stuff.  If you live overseas, he
will even call you there, as long as you are interested, but I think he still
makes all his overseas calls on the weekends, I guess cause the long distance
rates are cheaper then.  

He only likes to take new members from referrals from satisfied existing
members and he does virtually no advertising.  When I got set-up, they had a
2-3 week waiting list for new members to be called back so that they could
join up. (Once you are an existing member, they help you immediately when you
call. )  I think they are able to get back to prospective new members  the
same day or within a few days now, as they have increased their staff.  I am
not sure about this.........but if you email the above form to them, that is
the way to get started!

They will send you their DELUXE EMAIL CATALOGUE (around 525K-big and juicey)
!)...if you completely fill out the form above.  It has lists of all the
freebies, lists of all the titles they sell, titles broken down by categories
and detailed descriptions on nearly 1,200 of the titles that they sell.

They then send you email  that outlines how his club works and the list of
free choices that you can choose from, as well as the entire list of what he
sells;  and then they will give you a quick (3-5 minute) friendly,
no-pressure no-obligation call to explain everything to you personally and
answer all your questions.

Once you get in, you'll love them. I do.


Sincerely,

Morris Wade



From jgrundy@ra.abo.fi  Tue May 21 02:03:09 1996
Return-Path: <jgrundy@ra.abo.fi>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id CAA02446; Tue, 21 May 1996 02:03:09 -0500
Received: from ra.abo.fi ([130.232.18.2]) by cli.com (4.1/SMI-4.1)
	id AA27699; Tue, 21 May 96 01:59:21 CDT
Received: from bruce.abo.fi (root@bruce.abo.fi [130.232.209.103]) by ra.abo.fi (8.7.3/8.7.3) with ESMTP id JAA26208; Tue, 21 May 1996 09:29:55 +0300 (EET DST)
Received: from bruce.abo.fi (jgrundy@localhost [127.0.0.1]) by bruce.abo.fi (8.7.5/8.7.3) with ESMTP id JAA18892; Tue, 21 May 1996 09:29:54 +0300 (EET DST)
Message-Id: <199605210629.JAA18892@bruce.abo.fi>
To: coq-club@pauillac.inria.fr, formal-methods@cs.uidaho.edu, fsdm@cs.uq.oz.au,
        hvg@cl.cam.ac.uk, ifip-10.5@ics.uci.edu, info-hol@leopard.cs.byu.edu,
        isabelle-users@cl.cam.ac.uk, larch-interest@pa.dec.com,
        nqthm-users@cli.com, nuprllist@cs.cornell.edu, pvs@csl.sri.com,
        qed@mcs.anl.gov, softverf@leopard.cs.byu.edu, theory@cl.cam.ac.uk,
        theoryc@info.cs.vt.edu, theorynt@vm1.nodak.edu,
        theorem-provers@ai.mit.edu, vdm-forum@mailbase.ac.uk,
        zforum@prg.ox.ac.uk, types@dcs.glasgow.ac.uk
Cc: jgrundy@ra.abo.fi, orgcom@ra.abo.fi
Subject: Participation Call: TPHOLs'96 - Theorem Proving in Higher Order Logics
From: Jim Grundy <jim.grundy@abo.fi>
Date: Tue, 21 May 1996 09:29:39 +0300
Sender: jgrundy@ra.abo.fi
content-length: 13548


                            CALL FOR PARTICIPATION

  THE 1996 INTERNATIONAL CONFERENCE ON THEOREM PROVING IN HIGHER ORDER LOGICS

        ************************************************************
        *  If you have Web access, all the following information   *
        *     and more is available in a nicer format from:        *
        *                                                          *
        *        http://www.abo.fi/~jharriso/TPHOLs96.html         *
        ************************************************************

The 1996 International Conference on Theorem Proving in Higher Order Logics
will be held on 27-30 August 1996 (Tuesday to Friday) in Turku (Abo in Swedish)
in the South-west corner of Finland. Two tutorials are also included, starting
after midday on Monday 26th August.

The conference will be a venue for presentations on the following topics, among
others: advances in interactive theorem proving, proof automation and decision
procedures, applications of mechanized theorem proving, comparison between
different theorem proving approaches, exploiting external tools within theorem
provers and incorporating theorem provers into larger systems.

Previous conferences have been at Cambridge (UK), Aarhus, Davis, Leuven,
Vancouver, Malta and Salt Lake City. This conference is being organized by the
Turku Centre for Computer Science (TUCS) and Abo Akademi University.

  ****************************************************************************
  * The third Workshop on Designing Correct Circuits (DCC) will be held from *
  * Monday 2 September to Wednesday 4 September 1996 at Bastad in Southern   *
  * Sweden. This is an excellent opportunity for researchers from outside    *
  * Europe to attend both conferences.                                       *
  ****************************************************************************

If you require any further information, please contact the organizing committee
on "orgcom@abo.fi", or any of the members (Joakim von Wright, Jim Grundy or
John Harrison) at the following address:

       Abo Akademi University
       Department of Computer Science
       Lemminkaisenkatu 14A
       20520 Turku
       FINLAND

  ============================================================================

                                  PROGRAMME

  The 1996 International Conference on Theorem Proving in Higher Order Logics

Monday 26 August

12.00   Registration

12.30   Lunch

14.00   Tutorial: Reflections on aspects of the design of Nuprl and PVS
        Paul Jackson (U. Edinburgh)

15.40   Break

16.00   Tutorial: The Coq proof assistant: principle and practice
        Christine Paulin (ENS Lyon)

18.00   Dinner

*       *       *       *       *       *       *       *

Tuesday 27 August

8.30    Late registration and breakfast

9.30    Conference opens

9.45    Session 1

        A comparison of MDG and HOL for hardware verification
        Sofiene Tahar (U. Montreal), Paul Curzon (U. Cambridge)

        Coq and hardware verification: a case study
        Solange Coupet-Grimal, Line Jakubiec (Lab. Informatique de Marseille)

10.55   Break

11.20   Session 2

        A mechanisation of computability theory in HOL
        Vincent Zammit (U. Kent)

        Using lattice theory in higher order logic
        Linas Laibinis (TUCS, Turku)

12.30   Lunch

14.00   Session 3

        Verification of compiler correctness for the WAM
        Cornelia Pusch (TU Munchen)

        Applying the composition principle to verify a
          micro-kernel operating system
        Heckman, Zhang, Becker, Peticolas, Levitt, Olsson (UC Davis)

15.10   Break

15.40   Session 4

        Proving liveness of fair transition systems
        Holger Busch (Siemens AG, Munchen)

        A modular coding of UNITY in Coq
        Barbara Heyd (INRIA Lorraine), Pierre Cregut (France Telecom)

18.00   Dinner, Volleyball and Sauna

*       *       *       *       *       *       *       *

Wednesday 28 August

8.30    Invited lecture: Set theory, higher order logic or both?
        Mike Gordon (U. Cambridge)

9.30    Break

9.45    Session 5

        Program derivation using the Refinement Calculator
        Michael Butler (U. Southampton), Thomas Langbacka (U. Helsinki)

        A proof tool for reasoning about functional programs
        Graham Collins (U. Glasgow)

10.55   Break

11.20   Session 6

        Function definition in higher-order logic
        Konrad Slind (TU Munchen)

        Five axioms of alpha-conversion
        Andy Gordon (U. Cambridge), Tom Melham (U. Glasgow)

12.30   Lunch

13.30   Session 7

        Implementation issues about the embedding of
          existing high level synthesis algorithms in HOL
        Dirk Eisenbiegler, Christian Blumenroehr, Ramayya Kumar (Karlsruhe)

        Stalmarck's algorithm as a HOL derived rule
        John Harrison (Abo Akademi)

15.00 - 22.00   Excursion

*       *       *       *       *       *       *       *

Thursday 29 August

8.30    Invited lecture: Development of the Mizar Mathematical Library
        Andrzej Trybulec (U. Warsaw, Bialystok)

9.30    Break

9.45    Session 8

        Modeling a hardware synthesis methodology in Isabelle
        David Basin, Stefan Friedrich (MPI, Saarbrucken)

        Improving the result of high-level synthesis using
          interactive transformational design
        Mats Larsson (Volvo, Goteborg)

10.55   Break

11.20   Session 9

        A comparison of HOL and ALF formalizations of a
          categorical coherence theorem
        Sten Agerholm (IFAD), Ilya Beylin (Chalmers), Peter Dybjer (Chalmers)

        Synthetic domain theory in type theory:
          another logic of computable functions
        Bernhard Reus (Ludwig-Maximilians Universitat, Munchen)

12.30   Lunch

14.00   Session 10

        Cryptographic protocol adequacy with HOL: the implementation
        Steven Brackin (Arca Systems, Inc)

        POSTER SESSION

            Abstracting signals: the waveform library
            Robert H. Beers, Phillip J. Windley (BYU)

            A proved type inference tool for ML:
              Damas-Milner within Coq (work in progress)
            Catherine Dubois, Valerie Menissier-Morain (U. d'evry)

            Problem solving with tactics
            Hagiya, Tanaka, Yamamoto (U. Tokyo), Nishizaki (Chiba U.)

            Deeply embedding behavioral hardware description languages
            Michael D. Jones, Trent N. Larson, Phillip J. Windley (BYU)

            Using auxiliary knowledge in automating invariant proofs
            Pertti Kellomaki (Tampere U. Technology)

            Derivation of verification rules from operational definitions
            Michael Norrish (U. Cambridge)

            Natural proofs versus programs optimization in the
              Calculus of Inductive Constructions
            Catherine Parent (VERIMAG, France)

            Extending a state transition system with real-time semantics
            Peticolas, Zhang, Becker, Heckman, Levitt, Olsson (UC Davis)

            A HOL model of interlocking systems
            Wai Wong (Hong Kong Baptist U.)

15.30   Break

16.00   Session 11

        A Mizar mode for HOL
        John Harrison (Abo Akademi)

        Higher-order annotated terms for proof search
        Alan Smaill, Ian Green (U. Edinburgh)

19.00   Conference dinner

*       *       *       *       *       *       *       *

Friday 30 August

8.30    Session 12

        Inference rules for programming languages with
          side effects in expressions
        Paul E. Black, Phillip J. Windley (BYU)

        Formal verification of algorithm W
        Dieter Nazareth, Tobias Nipkow (TU Munchen)

9.40    Break

10.00   Session 13

        Elements of mathematical analysis in PVS
        Bruno Dutertre (Royal Holloway, U. London)

        Importing mathematics from HOL into Nuprl
        Doug Howe (Bell Labs)

11.10   Break

11.30   Session 14

        A structure preserving encoding of Z in HOL
        Kolyang (Bremen), Thomas Santen (GMD First), Burkhart Wolff (Bremen)

        Translating specifications in VDM-SL to higher order logic
        Sten Agerholm (IFAD, Denmark)

12.40   Conference closes

12.50   Lunch

14.00   Administrative session

  ============================================================================

                                REGISTRATION

The fee for early registration, on or before Friday 21 June is FIM200. There
are separate fees for accommodation and meals. If, as we expect, you are
staying at the conference venue, Turun Kristillinen Opisto, the cost is FIM200
per person (single) or FIM150 per person (shared), per night. If you prefer to
stay at a central hotel, the corresponding costs will be approximately FIM270
and FIM150. Meals, conference banquet and refreshments for the whole
conference cost an additional FIM876 per person, or FIM705 for guests not
requiring refreshments during the breaks. A more detailed breakdown of the
costs is available on the Web at:

  http://www.abo.fi/~jharriso/cost.html

After Friday 21 June, the registration fee rises to FIM250, and after the end
of July, we will be unable to guarantee accommodation at the same price and
standard. You can register via the Web; see:

  http://www.abo.fi/~jharriso/webform.html

Alternatively, fill in the following form, and either:

 * Email it to "orgcom@abo.fi"

 * Fax it to any member of the organizing committee on +358 21 265-4732

 * Send it by mail to the organizing committee (see the address above).

By registering for TPHOLs'96 you are agreeing to pay the applicable
registration fee even if you subsequently fail attend the conference. If you
are unable to attend the conference then the organizing committee may waive the
fee if you inform us of your change of plans in a timely manner. However, if
you just fail to show up, we are going to want our money.


 1. Name: ________________________________________________________
    (as you would like it to appear on your name tag)

 2. Affiliation:

    ______________________________________________________________

    ______________________________________________________________

  3. Address:

    ______________________________________________________________

    ______________________________________________________________

    ______________________________________________________________

 4. Email: _______________________________________________________

 5. Fax: +________________________________________________________

 6. Phone: +______________________________________________________

 7. Arrival Day:
      [_] Friday   23 August
      [_] Saturday 24 August
      [_] Sunday   25 August
      [_] Monday   26 August
      [_] Tuesday  27 August
    Arrival Time: ________________________________________________
    Arrival Point:
      [_] Turku Airport
      [_] Turku Railway Station
      [_] Turku Bus Station
      [_] Turku Harbor, Silja Terminal
      [_] Turku Harbor, Viking Terminal
      [_] Unknown
 8. Departure Day:
      [_] Thursday 29 August
      [_] Friday   30 August
      [_] Saturday 31 August
      [_] Sunday    1 September
      [_] Monday    2 September

 9. Number of Accompanying Guests: __
      These are people not attending the conference, but for whom
      you would like meals and accommodation arranged.

10. Accommodation is available either at the conference venue,
    Turun Kristillinen Opisto, located a few kilometers from the
    centre of town; or at various centrally located hotels.  We
    expect most people will stay at Turun Kristillinen Opisto.

    Would you like to stay at:
      [_] Turun Kristillinen Opisto
            FIM200 per person, per night single.
            FIM150 per person, per night shared.
      [_] A central hotel
            FIM270 per person, per night single.
            FIM150 per person, per night shared.
      [_] I'll arrange my own accommodation thanks.

    Note that we are unable to guarantee the same prices or
    quality of accommodation for people registering after July.

11. Special Dietary Requirements: ________________________________

12. Special Access Requirements: _________________________________

13. Would you like to share a room? (other than with your guests)
      [_] no
      [_] yes
          With anyone in particular?
            [_] yes: _____________________________________________
            [_] no
                You are:
                  [_] female
                  [_] male
                You would be content to share with a:
                  [_] female
                  [_] male

14. Would you buy a TPHOLs'96 T-shirt if we made one?
      [_] yes, size [_] S [_] M [_] L [_] XL
      [_] no
    T-shirts would be sold at their cost price.

15. The conference registration fee is as follows:
      * FIM200 for early registration (Friday 21 June or earlier).
      * FIM250 for late registration (Saturday 22 June or later).
    Payable in cash (Finnish Markka only) at the Conference.

    In addition to the registration fee, there will be a fee for
    meals and accommodation (details available elsewhere).  You
    can pay for your accommodation and meals at the conference in
    cash (Finnish Markka only), or with the following credit cards
    only: Diner's Club, EuroCard, MasterCard or Visa.

    How will you be paying for your meals and accommodation?
      [_] Cash (Finnish Markka)
      [_] Diner's Club
      [_] EuroCard
      [_] MasterCard
      [_] Visa

From sandel@cli.com  Tue May 21 10:25:48 1996
Return-Path: <sandel@cli.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id KAA02631; Tue, 21 May 1996 10:25:48 -0500
Received: from blanco (blanco.cli.com) by cli.com (4.1/SMI-4.1)
	id AA10772; Tue, 21 May 96 10:25:47 CDT
From: sandel@cli.com (Charles Sandel)
Received: by blanco (SMI-8.6) id KAA24115; Tue, 21 May 1996 10:25:45 -0500
Date: Tue, 21 May 1996 10:25:45 -0500
Message-Id: <199605211525.KAA24115@blanco>
Subject: Non-member submission from [Jim Grundy <jim.grundy@abo.fi>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-Md5: KIe4PmJdzAGWeou528s9YQ==
content-length: 14991

------------- Begin Forwarded Message -------------
>From jgrundy@ra.abo.fi (jgrundy@ra.abo.fi)  Tue May 21 01:59:21 1996
Return-Path: <jgrundy@ra.abo.fi>
Received: from ra.abo.fi ([130.232.18.2]) by cli.com (4.1/SMI-4.1)
	id AA27699; Tue, 21 May 96 01:59:21 CDT
Received: from bruce.abo.fi (root@bruce.abo.fi [130.232.209.103]) by ra.abo.fi 
(8.7.3/8.7.3) with ESMTP id JAA26208; Tue, 21 May 1996 09:29:55 +0300 (EET DST)
Received: from bruce.abo.fi (jgrundy@localhost [127.0.0.1]) by bruce.abo.fi (8.7.5/8.7.3) 
with ESMTP id JAA18892; Tue, 21 May 1996 09:29:54 +0300 (EET DST)
Message-Id: <199605210629.JAA18892@bruce.abo.fi>
To: coq-club@pauillac.inria.fr, formal-methods@cs.uidaho.edu, fsdm@cs.uq.oz.au,
        hvg@cl.cam.ac.uk, ifip-10.5@ics.uci.edu, info-hol@leopard.cs.byu.edu,
        isabelle-users@cl.cam.ac.uk, larch-interest@pa.dec.com,
        nqthm-users@cli.com, nuprllist@cs.cornell.edu, pvs@csl.sri.com,
        qed@mcs.anl.gov, softverf@leopard.cs.byu.edu, theory@cl.cam.ac.uk,
        theoryc@info.cs.vt.edu, theorynt@vm1.nodak.edu,
        theorem-provers@ai.mit.edu, vdm-forum@mailbase.ac.uk,
        zforum@prg.ox.ac.uk, types@dcs.glasgow.ac.uk
Cc: jgrundy@ra.abo.fi, orgcom@ra.abo.fi
Subject: Participation Call: TPHOLs'96 - Theorem Proving in Higher Order Logics
From: Jim Grundy <jim.grundy@abo.fi>
Date: Tue, 21 May 1996 09:29:39 +0300
Sender: jgrundy@ra.abo.fi


                            CALL FOR PARTICIPATION

  THE 1996 INTERNATIONAL CONFERENCE ON THEOREM PROVING IN HIGHER ORDER LOGICS

        ************************************************************
        *  If you have Web access, all the following information   *
        *     and more is available in a nicer format from:        *
        *                                                          *
        *        http://www.abo.fi/~jharriso/TPHOLs96.html         *
        ************************************************************

The 1996 International Conference on Theorem Proving in Higher Order Logics
will be held on 27-30 August 1996 (Tuesday to Friday) in Turku (Abo in Swedish)
in the South-west corner of Finland. Two tutorials are also included, starting
after midday on Monday 26th August.

The conference will be a venue for presentations on the following topics, among
others: advances in interactive theorem proving, proof automation and decision
procedures, applications of mechanized theorem proving, comparison between
different theorem proving approaches, exploiting external tools within theorem
provers and incorporating theorem provers into larger systems.

Previous conferences have been at Cambridge (UK), Aarhus, Davis, Leuven,
Vancouver, Malta and Salt Lake City. This conference is being organized by the
Turku Centre for Computer Science (TUCS) and Abo Akademi University.

  ****************************************************************************
  * The third Workshop on Designing Correct Circuits (DCC) will be held from *
  * Monday 2 September to Wednesday 4 September 1996 at Bastad in Southern   *
  * Sweden. This is an excellent opportunity for researchers from outside    *
  * Europe to attend both conferences.                                       *
  ****************************************************************************

If you require any further information, please contact the organizing committee
on "orgcom@abo.fi", or any of the members (Joakim von Wright, Jim Grundy or
John Harrison) at the following address:

       Abo Akademi University
       Department of Computer Science
       Lemminkaisenkatu 14A
       20520 Turku
       FINLAND

  ============================================================================

                                  PROGRAMME

  The 1996 International Conference on Theorem Proving in Higher Order Logics

Monday 26 August

12.00   Registration

12.30   Lunch

14.00   Tutorial: Reflections on aspects of the design of Nuprl and PVS
        Paul Jackson (U. Edinburgh)

15.40   Break

16.00   Tutorial: The Coq proof assistant: principle and practice
        Christine Paulin (ENS Lyon)

18.00   Dinner

*       *       *       *       *       *       *       *

Tuesday 27 August

8.30    Late registration and breakfast

9.30    Conference opens

9.45    Session 1

        A comparison of MDG and HOL for hardware verification
        Sofiene Tahar (U. Montreal), Paul Curzon (U. Cambridge)

        Coq and hardware verification: a case study
        Solange Coupet-Grimal, Line Jakubiec (Lab. Informatique de Marseille)

10.55   Break

11.20   Session 2

        A mechanisation of computability theory in HOL
        Vincent Zammit (U. Kent)

        Using lattice theory in higher order logic
        Linas Laibinis (TUCS, Turku)

12.30   Lunch

14.00   Session 3

        Verification of compiler correctness for the WAM
        Cornelia Pusch (TU Munchen)

        Applying the composition principle to verify a
          micro-kernel operating system
        Heckman, Zhang, Becker, Peticolas, Levitt, Olsson (UC Davis)

15.10   Break

15.40   Session 4

        Proving liveness of fair transition systems
        Holger Busch (Siemens AG, Munchen)

        A modular coding of UNITY in Coq
        Barbara Heyd (INRIA Lorraine), Pierre Cregut (France Telecom)

18.00   Dinner, Volleyball and Sauna

*       *       *       *       *       *       *       *

Wednesday 28 August

8.30    Invited lecture: Set theory, higher order logic or both?
        Mike Gordon (U. Cambridge)

9.30    Break

9.45    Session 5

        Program derivation using the Refinement Calculator
        Michael Butler (U. Southampton), Thomas Langbacka (U. Helsinki)

        A proof tool for reasoning about functional programs
        Graham Collins (U. Glasgow)

10.55   Break

11.20   Session 6

        Function definition in higher-order logic
        Konrad Slind (TU Munchen)

        Five axioms of alpha-conversion
        Andy Gordon (U. Cambridge), Tom Melham (U. Glasgow)

12.30   Lunch

13.30   Session 7

        Implementation issues about the embedding of
          existing high level synthesis algorithms in HOL
        Dirk Eisenbiegler, Christian Blumenroehr, Ramayya Kumar (Karlsruhe)

        Stalmarck's algorithm as a HOL derived rule
        John Harrison (Abo Akademi)

15.00 - 22.00   Excursion

*       *       *       *       *       *       *       *

Thursday 29 August

8.30    Invited lecture: Development of the Mizar Mathematical Library
        Andrzej Trybulec (U. Warsaw, Bialystok)

9.30    Break

9.45    Session 8

        Modeling a hardware synthesis methodology in Isabelle
        David Basin, Stefan Friedrich (MPI, Saarbrucken)

        Improving the result of high-level synthesis using
          interactive transformational design
        Mats Larsson (Volvo, Goteborg)

10.55   Break

11.20   Session 9

        A comparison of HOL and ALF formalizations of a
          categorical coherence theorem
        Sten Agerholm (IFAD), Ilya Beylin (Chalmers), Peter Dybjer (Chalmers)

        Synthetic domain theory in type theory:
          another logic of computable functions
        Bernhard Reus (Ludwig-Maximilians Universitat, Munchen)

12.30   Lunch

14.00   Session 10

        Cryptographic protocol adequacy with HOL: the implementation
        Steven Brackin (Arca Systems, Inc)

        POSTER SESSION

            Abstracting signals: the waveform library
            Robert H. Beers, Phillip J. Windley (BYU)

            A proved type inference tool for ML:
              Damas-Milner within Coq (work in progress)
            Catherine Dubois, Valerie Menissier-Morain (U. d'evry)

            Problem solving with tactics
            Hagiya, Tanaka, Yamamoto (U. Tokyo), Nishizaki (Chiba U.)

            Deeply embedding behavioral hardware description languages
            Michael D. Jones, Trent N. Larson, Phillip J. Windley (BYU)

            Using auxiliary knowledge in automating invariant proofs
            Pertti Kellomaki (Tampere U. Technology)

            Derivation of verification rules from operational definitions
            Michael Norrish (U. Cambridge)

            Natural proofs versus programs optimization in the
              Calculus of Inductive Constructions
            Catherine Parent (VERIMAG, France)

            Extending a state transition system with real-time semantics
            Peticolas, Zhang, Becker, Heckman, Levitt, Olsson (UC Davis)

            A HOL model of interlocking systems
            Wai Wong (Hong Kong Baptist U.)

15.30   Break

16.00   Session 11

        A Mizar mode for HOL
        John Harrison (Abo Akademi)

        Higher-order annotated terms for proof search
        Alan Smaill, Ian Green (U. Edinburgh)

19.00   Conference dinner

*       *       *       *       *       *       *       *

Friday 30 August

8.30    Session 12

        Inference rules for programming languages with
          side effects in expressions
        Paul E. Black, Phillip J. Windley (BYU)

        Formal verification of algorithm W
        Dieter Nazareth, Tobias Nipkow (TU Munchen)

9.40    Break

10.00   Session 13

        Elements of mathematical analysis in PVS
        Bruno Dutertre (Royal Holloway, U. London)

        Importing mathematics from HOL into Nuprl
        Doug Howe (Bell Labs)

11.10   Break

11.30   Session 14

        A structure preserving encoding of Z in HOL
        Kolyang (Bremen), Thomas Santen (GMD First), Burkhart Wolff (Bremen)

        Translating specifications in VDM-SL to higher order logic
        Sten Agerholm (IFAD, Denmark)

12.40   Conference closes

12.50   Lunch

14.00   Administrative session

  ============================================================================

                                REGISTRATION

The fee for early registration, on or before Friday 21 June is FIM200. There
are separate fees for accommodation and meals. If, as we expect, you are
staying at the conference venue, Turun Kristillinen Opisto, the cost is FIM200
per person (single) or FIM150 per person (shared), per night. If you prefer to
stay at a central hotel, the corresponding costs will be approximately FIM270
and FIM150. Meals, conference banquet and refreshments for the whole
conference cost an additional FIM876 per person, or FIM705 for guests not
requiring refreshments during the breaks. A more detailed breakdown of the
costs is available on the Web at:

  http://www.abo.fi/~jharriso/cost.html

After Friday 21 June, the registration fee rises to FIM250, and after the end
of July, we will be unable to guarantee accommodation at the same price and
standard. You can register via the Web; see:

  http://www.abo.fi/~jharriso/webform.html

Alternatively, fill in the following form, and either:

 * Email it to "orgcom@abo.fi"

 * Fax it to any member of the organizing committee on +358 21 265-4732

 * Send it by mail to the organizing committee (see the address above).

By registering for TPHOLs'96 you are agreeing to pay the applicable
registration fee even if you subsequently fail attend the conference. If you
are unable to attend the conference then the organizing committee may waive the
fee if you inform us of your change of plans in a timely manner. However, if
you just fail to show up, we are going to want our money.


 1. Name: ________________________________________________________
    (as you would like it to appear on your name tag)

 2. Affiliation:

    ______________________________________________________________

    ______________________________________________________________

  3. Address:

    ______________________________________________________________

    ______________________________________________________________

    ______________________________________________________________

 4. Email: _______________________________________________________

 5. Fax: +________________________________________________________

 6. Phone: +______________________________________________________

 7. Arrival Day:
      [_] Friday   23 August
      [_] Saturday 24 August
      [_] Sunday   25 August
      [_] Monday   26 August
      [_] Tuesday  27 August
    Arrival Time: ________________________________________________
    Arrival Point:
      [_] Turku Airport
      [_] Turku Railway Station
      [_] Turku Bus Station
      [_] Turku Harbor, Silja Terminal
      [_] Turku Harbor, Viking Terminal
      [_] Unknown
 8. Departure Day:
      [_] Thursday 29 August
      [_] Friday   30 August
      [_] Saturday 31 August
      [_] Sunday    1 September
      [_] Monday    2 September

 9. Number of Accompanying Guests: __
      These are people not attending the conference, but for whom
      you would like meals and accommodation arranged.

10. Accommodation is available either at the conference venue,
    Turun Kristillinen Opisto, located a few kilometers from the
    centre of town; or at various centrally located hotels.  We
    expect most people will stay at Turun Kristillinen Opisto.

    Would you like to stay at:
      [_] Turun Kristillinen Opisto
            FIM200 per person, per night single.
            FIM150 per person, per night shared.
      [_] A central hotel
            FIM270 per person, per night single.
            FIM150 per person, per night shared.
      [_] I'll arrange my own accommodation thanks.

    Note that we are unable to guarantee the same prices or
    quality of accommodation for people registering after July.

11. Special Dietary Requirements: ________________________________

12. Special Access Requirements: _________________________________

13. Would you like to share a room? (other than with your guests)
      [_] no
      [_] yes
          With anyone in particular?
            [_] yes: _____________________________________________
            [_] no
                You are:
                  [_] female
                  [_] male
                You would be content to share with a:
                  [_] female
                  [_] male

14. Would you buy a TPHOLs'96 T-shirt if we made one?
      [_] yes, size [_] S [_] M [_] L [_] XL
      [_] no
    T-shirts would be sold at their cost price.

15. The conference registration fee is as follows:
      * FIM200 for early registration (Friday 21 June or earlier).
      * FIM250 for late registration (Saturday 22 June or later).
    Payable in cash (Finnish Markka only) at the Conference.

    In addition to the registration fee, there will be a fee for
    meals and accommodation (details available elsewhere).  You
    can pay for your accommodation and meals at the conference in
    cash (Finnish Markka only), or with the following credit cards
    only: Diner's Club, EuroCard, MasterCard or Visa.

    How will you be paying for your meals and accommodation?
      [_] Cash (Finnish Markka)
      [_] Diner's Club
      [_] EuroCard
      [_] MasterCard
      [_] Visa

------------- End Forwarded Message -------------


From owner-nqthm-users@cli.com  Tue May 21 11:53:28 1996
Return-Path: <owner-nqthm-users@cli.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id LAA02661; Tue, 21 May 1996 11:53:27 -0500
Received: by cli.com (4.1/SMI-4.1)
	id AA10779; Tue, 21 May 96 10:25:50 CDT
Received: from blanco (blanco.cli.com) by cli.com (4.1/SMI-4.1)
	id AA10772; Tue, 21 May 96 10:25:47 CDT
From: sandel@cli.com (Charles Sandel)
Received: by blanco (SMI-8.6) id KAA24115; Tue, 21 May 1996 10:25:45 -0500
Date: Tue, 21 May 1996 10:25:45 -0500
Message-Id: <199605211525.KAA24115@blanco>
Subject: Non-member submission from [Jim Grundy <jim.grundy@abo.fi>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-Md5: KIe4PmJdzAGWeou528s9YQ==
Sender: owner-nqthm-users@cli.com
Precedence: bulk
content-length: 14991

------------- Begin Forwarded Message -------------
>From jgrundy@ra.abo.fi (jgrundy@ra.abo.fi)  Tue May 21 01:59:21 1996
Return-Path: <jgrundy@ra.abo.fi>
Received: from ra.abo.fi ([130.232.18.2]) by cli.com (4.1/SMI-4.1)
	id AA27699; Tue, 21 May 96 01:59:21 CDT
Received: from bruce.abo.fi (root@bruce.abo.fi [130.232.209.103]) by ra.abo.fi 
(8.7.3/8.7.3) with ESMTP id JAA26208; Tue, 21 May 1996 09:29:55 +0300 (EET DST)
Received: from bruce.abo.fi (jgrundy@localhost [127.0.0.1]) by bruce.abo.fi (8.7.5/8.7.3) 
with ESMTP id JAA18892; Tue, 21 May 1996 09:29:54 +0300 (EET DST)
Message-Id: <199605210629.JAA18892@bruce.abo.fi>
To: coq-club@pauillac.inria.fr, formal-methods@cs.uidaho.edu, fsdm@cs.uq.oz.au,
        hvg@cl.cam.ac.uk, ifip-10.5@ics.uci.edu, info-hol@leopard.cs.byu.edu,
        isabelle-users@cl.cam.ac.uk, larch-interest@pa.dec.com,
        nqthm-users@cli.com, nuprllist@cs.cornell.edu, pvs@csl.sri.com,
        qed@mcs.anl.gov, softverf@leopard.cs.byu.edu, theory@cl.cam.ac.uk,
        theoryc@info.cs.vt.edu, theorynt@vm1.nodak.edu,
        theorem-provers@ai.mit.edu, vdm-forum@mailbase.ac.uk,
        zforum@prg.ox.ac.uk, types@dcs.glasgow.ac.uk
Cc: jgrundy@ra.abo.fi, orgcom@ra.abo.fi
Subject: Participation Call: TPHOLs'96 - Theorem Proving in Higher Order Logics
From: Jim Grundy <jim.grundy@abo.fi>
Date: Tue, 21 May 1996 09:29:39 +0300
Sender: jgrundy@ra.abo.fi


                            CALL FOR PARTICIPATION

  THE 1996 INTERNATIONAL CONFERENCE ON THEOREM PROVING IN HIGHER ORDER LOGICS

        ************************************************************
        *  If you have Web access, all the following information   *
        *     and more is available in a nicer format from:        *
        *                                                          *
        *        http://www.abo.fi/~jharriso/TPHOLs96.html         *
        ************************************************************

The 1996 International Conference on Theorem Proving in Higher Order Logics
will be held on 27-30 August 1996 (Tuesday to Friday) in Turku (Abo in Swedish)
in the South-west corner of Finland. Two tutorials are also included, starting
after midday on Monday 26th August.

The conference will be a venue for presentations on the following topics, among
others: advances in interactive theorem proving, proof automation and decision
procedures, applications of mechanized theorem proving, comparison between
different theorem proving approaches, exploiting external tools within theorem
provers and incorporating theorem provers into larger systems.

Previous conferences have been at Cambridge (UK), Aarhus, Davis, Leuven,
Vancouver, Malta and Salt Lake City. This conference is being organized by the
Turku Centre for Computer Science (TUCS) and Abo Akademi University.

  ****************************************************************************
  * The third Workshop on Designing Correct Circuits (DCC) will be held from *
  * Monday 2 September to Wednesday 4 September 1996 at Bastad in Southern   *
  * Sweden. This is an excellent opportunity for researchers from outside    *
  * Europe to attend both conferences.                                       *
  ****************************************************************************

If you require any further information, please contact the organizing committee
on "orgcom@abo.fi", or any of the members (Joakim von Wright, Jim Grundy or
John Harrison) at the following address:

       Abo Akademi University
       Department of Computer Science
       Lemminkaisenkatu 14A
       20520 Turku
       FINLAND

  ============================================================================

                                  PROGRAMME

  The 1996 International Conference on Theorem Proving in Higher Order Logics

Monday 26 August

12.00   Registration

12.30   Lunch

14.00   Tutorial: Reflections on aspects of the design of Nuprl and PVS
        Paul Jackson (U. Edinburgh)

15.40   Break

16.00   Tutorial: The Coq proof assistant: principle and practice
        Christine Paulin (ENS Lyon)

18.00   Dinner

*       *       *       *       *       *       *       *

Tuesday 27 August

8.30    Late registration and breakfast

9.30    Conference opens

9.45    Session 1

        A comparison of MDG and HOL for hardware verification
        Sofiene Tahar (U. Montreal), Paul Curzon (U. Cambridge)

        Coq and hardware verification: a case study
        Solange Coupet-Grimal, Line Jakubiec (Lab. Informatique de Marseille)

10.55   Break

11.20   Session 2

        A mechanisation of computability theory in HOL
        Vincent Zammit (U. Kent)

        Using lattice theory in higher order logic
        Linas Laibinis (TUCS, Turku)

12.30   Lunch

14.00   Session 3

        Verification of compiler correctness for the WAM
        Cornelia Pusch (TU Munchen)

        Applying the composition principle to verify a
          micro-kernel operating system
        Heckman, Zhang, Becker, Peticolas, Levitt, Olsson (UC Davis)

15.10   Break

15.40   Session 4

        Proving liveness of fair transition systems
        Holger Busch (Siemens AG, Munchen)

        A modular coding of UNITY in Coq
        Barbara Heyd (INRIA Lorraine), Pierre Cregut (France Telecom)

18.00   Dinner, Volleyball and Sauna

*       *       *       *       *       *       *       *

Wednesday 28 August

8.30    Invited lecture: Set theory, higher order logic or both?
        Mike Gordon (U. Cambridge)

9.30    Break

9.45    Session 5

        Program derivation using the Refinement Calculator
        Michael Butler (U. Southampton), Thomas Langbacka (U. Helsinki)

        A proof tool for reasoning about functional programs
        Graham Collins (U. Glasgow)

10.55   Break

11.20   Session 6

        Function definition in higher-order logic
        Konrad Slind (TU Munchen)

        Five axioms of alpha-conversion
        Andy Gordon (U. Cambridge), Tom Melham (U. Glasgow)

12.30   Lunch

13.30   Session 7

        Implementation issues about the embedding of
          existing high level synthesis algorithms in HOL
        Dirk Eisenbiegler, Christian Blumenroehr, Ramayya Kumar (Karlsruhe)

        Stalmarck's algorithm as a HOL derived rule
        John Harrison (Abo Akademi)

15.00 - 22.00   Excursion

*       *       *       *       *       *       *       *

Thursday 29 August

8.30    Invited lecture: Development of the Mizar Mathematical Library
        Andrzej Trybulec (U. Warsaw, Bialystok)

9.30    Break

9.45    Session 8

        Modeling a hardware synthesis methodology in Isabelle
        David Basin, Stefan Friedrich (MPI, Saarbrucken)

        Improving the result of high-level synthesis using
          interactive transformational design
        Mats Larsson (Volvo, Goteborg)

10.55   Break

11.20   Session 9

        A comparison of HOL and ALF formalizations of a
          categorical coherence theorem
        Sten Agerholm (IFAD), Ilya Beylin (Chalmers), Peter Dybjer (Chalmers)

        Synthetic domain theory in type theory:
          another logic of computable functions
        Bernhard Reus (Ludwig-Maximilians Universitat, Munchen)

12.30   Lunch

14.00   Session 10

        Cryptographic protocol adequacy with HOL: the implementation
        Steven Brackin (Arca Systems, Inc)

        POSTER SESSION

            Abstracting signals: the waveform library
            Robert H. Beers, Phillip J. Windley (BYU)

            A proved type inference tool for ML:
              Damas-Milner within Coq (work in progress)
            Catherine Dubois, Valerie Menissier-Morain (U. d'evry)

            Problem solving with tactics
            Hagiya, Tanaka, Yamamoto (U. Tokyo), Nishizaki (Chiba U.)

            Deeply embedding behavioral hardware description languages
            Michael D. Jones, Trent N. Larson, Phillip J. Windley (BYU)

            Using auxiliary knowledge in automating invariant proofs
            Pertti Kellomaki (Tampere U. Technology)

            Derivation of verification rules from operational definitions
            Michael Norrish (U. Cambridge)

            Natural proofs versus programs optimization in the
              Calculus of Inductive Constructions
            Catherine Parent (VERIMAG, France)

            Extending a state transition system with real-time semantics
            Peticolas, Zhang, Becker, Heckman, Levitt, Olsson (UC Davis)

            A HOL model of interlocking systems
            Wai Wong (Hong Kong Baptist U.)

15.30   Break

16.00   Session 11

        A Mizar mode for HOL
        John Harrison (Abo Akademi)

        Higher-order annotated terms for proof search
        Alan Smaill, Ian Green (U. Edinburgh)

19.00   Conference dinner

*       *       *       *       *       *       *       *

Friday 30 August

8.30    Session 12

        Inference rules for programming languages with
          side effects in expressions
        Paul E. Black, Phillip J. Windley (BYU)

        Formal verification of algorithm W
        Dieter Nazareth, Tobias Nipkow (TU Munchen)

9.40    Break

10.00   Session 13

        Elements of mathematical analysis in PVS
        Bruno Dutertre (Royal Holloway, U. London)

        Importing mathematics from HOL into Nuprl
        Doug Howe (Bell Labs)

11.10   Break

11.30   Session 14

        A structure preserving encoding of Z in HOL
        Kolyang (Bremen), Thomas Santen (GMD First), Burkhart Wolff (Bremen)

        Translating specifications in VDM-SL to higher order logic
        Sten Agerholm (IFAD, Denmark)

12.40   Conference closes

12.50   Lunch

14.00   Administrative session

  ============================================================================

                                REGISTRATION

The fee for early registration, on or before Friday 21 June is FIM200. There
are separate fees for accommodation and meals. If, as we expect, you are
staying at the conference venue, Turun Kristillinen Opisto, the cost is FIM200
per person (single) or FIM150 per person (shared), per night. If you prefer to
stay at a central hotel, the corresponding costs will be approximately FIM270
and FIM150. Meals, conference banquet and refreshments for the whole
conference cost an additional FIM876 per person, or FIM705 for guests not
requiring refreshments during the breaks. A more detailed breakdown of the
costs is available on the Web at:

  http://www.abo.fi/~jharriso/cost.html

After Friday 21 June, the registration fee rises to FIM250, and after the end
of July, we will be unable to guarantee accommodation at the same price and
standard. You can register via the Web; see:

  http://www.abo.fi/~jharriso/webform.html

Alternatively, fill in the following form, and either:

 * Email it to "orgcom@abo.fi"

 * Fax it to any member of the organizing committee on +358 21 265-4732

 * Send it by mail to the organizing committee (see the address above).

By registering for TPHOLs'96 you are agreeing to pay the applicable
registration fee even if you subsequently fail attend the conference. If you
are unable to attend the conference then the organizing committee may waive the
fee if you inform us of your change of plans in a timely manner. However, if
you just fail to show up, we are going to want our money.


 1. Name: ________________________________________________________
    (as you would like it to appear on your name tag)

 2. Affiliation:

    ______________________________________________________________

    ______________________________________________________________

  3. Address:

    ______________________________________________________________

    ______________________________________________________________

    ______________________________________________________________

 4. Email: _______________________________________________________

 5. Fax: +________________________________________________________

 6. Phone: +______________________________________________________

 7. Arrival Day:
      [_] Friday   23 August
      [_] Saturday 24 August
      [_] Sunday   25 August
      [_] Monday   26 August
      [_] Tuesday  27 August
    Arrival Time: ________________________________________________
    Arrival Point:
      [_] Turku Airport
      [_] Turku Railway Station
      [_] Turku Bus Station
      [_] Turku Harbor, Silja Terminal
      [_] Turku Harbor, Viking Terminal
      [_] Unknown
 8. Departure Day:
      [_] Thursday 29 August
      [_] Friday   30 August
      [_] Saturday 31 August
      [_] Sunday    1 September
      [_] Monday    2 September

 9. Number of Accompanying Guests: __
      These are people not attending the conference, but for whom
      you would like meals and accommodation arranged.

10. Accommodation is available either at the conference venue,
    Turun Kristillinen Opisto, located a few kilometers from the
    centre of town; or at various centrally located hotels.  We
    expect most people will stay at Turun Kristillinen Opisto.

    Would you like to stay at:
      [_] Turun Kristillinen Opisto
            FIM200 per person, per night single.
            FIM150 per person, per night shared.
      [_] A central hotel
            FIM270 per person, per night single.
            FIM150 per person, per night shared.
      [_] I'll arrange my own accommodation thanks.

    Note that we are unable to guarantee the same prices or
    quality of accommodation for people registering after July.

11. Special Dietary Requirements: ________________________________

12. Special Access Requirements: _________________________________

13. Would you like to share a room? (other than with your guests)
      [_] no
      [_] yes
          With anyone in particular?
            [_] yes: _____________________________________________
            [_] no
                You are:
                  [_] female
                  [_] male
                You would be content to share with a:
                  [_] female
                  [_] male

14. Would you buy a TPHOLs'96 T-shirt if we made one?
      [_] yes, size [_] S [_] M [_] L [_] XL
      [_] no
    T-shirts would be sold at their cost price.

15. The conference registration fee is as follows:
      * FIM200 for early registration (Friday 21 June or earlier).
      * FIM250 for late registration (Saturday 22 June or later).
    Payable in cash (Finnish Markka only) at the Conference.

    In addition to the registration fee, there will be a fee for
    meals and accommodation (details available elsewhere).  You
    can pay for your accommodation and meals at the conference in
    cash (Finnish Markka only), or with the following credit cards
    only: Diner's Club, EuroCard, MasterCard or Visa.

    How will you be paying for your meals and accommodation?
      [_] Cash (Finnish Markka)
      [_] Diner's Club
      [_] EuroCard
      [_] MasterCard
      [_] Visa

------------- End Forwarded Message -------------


From priami@di.unipi.it  Wed May 22 03:11:08 1996
Return-Path: <priami@di.unipi.it>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id DAA03898; Wed, 22 May 1996 03:11:08 -0500
Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by cli.com (4.1/SMI-4.1)
	id AA24718; Wed, 22 May 96 03:09:55 CDT
Organization:  Dipartimento di Informatica di Pisa - Italy
Received: from [131.114.4.128] (priami.di.unipi.it [131.114.4.128]) by mailserver.di.unipi.it (8.7.5/8.7.3) with SMTP id JAA04846; Wed, 22 May 1996 09:35:42 +0200 (MET DST)
Date: Wed, 22 May 1996 09:35:42 +0200 (MET DST)
X-Sender: priami@mailserver.di.unipi.it
Message-Id: <v01510104adca8b26144a@[131.114.4.128]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
To: coq-club@pauillac.inria.fr, formal-methods@cs.uidaho.edu, fsdm@cs.uq.oz.au,
        hvg@cl.cam.ac.uk, ifip-10.5@ics.uci.edu, info-hol@leopard.cs.byu.edu,
        isabelle-users@cl.cam.ac.uk, larch-interest@pa.dec.com,
        nqthm-users@cli.com, nuprllist@cs.cornell.edu, pvs@csl.sri.com,
        qed@mcs.anl.gov
From: priami@DI.Unipi.IT (Corrado Priami)
Subject: PhD thesis available
content-length: 8805

Dear all,

this message is to announce the availability of my PhD Thesis. I report
below the title, a brief abstract and the table of contents of the thesis.
Hard copies can be obtained by sending a request to
        priami@di.unipi.it.

An electronic copy can be obtained by anonymous ftp at
        ftp.di.unipi.it
in the directory
        \pub\Papers\priami\
The file is
        PhD.ps.Z.

I apologize if you receive more than one copy of this message.

Best wishes,

Corrado Priami

=========================================================================

Author: Corrado Priami
Title: Enhanced Operational Semantics for Concurrency
Institution: Dipartimento di Informatica, Universita` di Pisa
Address: Corso Italia, 40
         I-56125 Pisa - Italy
Numero: TD-08/96
Abstract:
In this study we extend the classical structural operational semantics to
implement the possibility of having different views of the same system
that are all consistent to one another and that can be recovered
mechanically from a single, concrete representation.
We apply this idea to concurrent and distributed systems, and especially
to mobile agents.

Our concrete representation is a transition system (called
proved and defined in SOS style),
whose transitions are labelled by encodings of their deduction
trees. The labels of transitions allow us to retrieve all the
main semantic models presented in the literature
and also to define new semantics (e.g. a new causality). These
semantics are retrieved from the proved transition system
through relabelling functions that only maintain
the relevant information in the labels of transitions.
We show that our approach is robust:
it scales up smoothly to higher-order process calculi and even to real
programming languages like Facile. Its applicability is made
evident through an example of debugging of Facile
``real code'' for an application on mobile agents.

To automate the above
approach for verification of distributed systems, we study the
state explosion problem. We overcome it for languages that
do not contain scope operators like CCS
restriction. Under this assumption we obtain a compact proved transition
system that is linear (in average) with the occurrences of actions in a
process and that preserves non interleaving bisimulation-based
equivalences (thus checked in polynomial time instead of exponential one).
We describe two prototypes that allow their user to change easily from a
semantic model to another.

We also study the refinement of specifications towards real code.
Since implementations must meet performance constraints, we first enhance our
proved semantics to derive from it stochastic models on which performance
can be evaluated. We also show how it is possible to merge semantic
descriptions
with information on architecture topologies in order to get evaluations
that are more accurate as machine sensible. Along this line, we
describe how to refine proved semantics in order to avoid global manager
of names in distributed systems. The resulting description is actually a
specification for distributed name managers that could help improving
distributed implementations.


Table of Contents:

1 Introduction...............................................13
        1.1  Formal methods..................................14
        1.2  Operational semantics...........................16
        1.3  Abstraction levels..............................22
        1.4  Computer aided verification.....................30
        1.5  Towards implementations.........................35
        1.6  Suitability of SOS as formal method.............41
        1.7  Outline of the work.............................42
        1.8  The origins of the chapters.....................45
2.  Mathematical Background..................................49
        2.1  Mathematical Logic..............................49
        2.2  Sets............................................54
        2.3  Relations and Functions.........................57
        2.4  Frequently used structures......................59
        2.5  Algebra.........................................60
        2.6  Complete partial orders.........................64
        2.7  Formal Languages................................66
        2.8  Continuous time Markov chains...................70
3.  Structural Operational Semantics.........................73
        3.1  Transition systems..............................73
        3.2  SOS definitions.................................78
4.  Semantics for Concurrency................................81
        4.1  Pi-calculus.....................................81
        4.2  Higher order Pi-calculus........................89
        4.3  Facile..........................................90
5.  Proved Transition System................................105
        5.1  Proved operational semantics...................105
        5.2  Properties.....................................110
        5.3  Finite branching early semantics...............112
        5.4  An Algebra of Proved Trees.....................117
6.  Non Interleaving Semantics..............................121
        6.1  Non interleaving relations.....................122
        6.2  Causality......................................127
        6.3  Locality, Precedence and Enabling..............135
        6.4  Independence...................................142
        6.5  Concurrency....................................143
        6.6  Equivalences...................................154
        6.7  Higher-Order Mobile Processes..................161
        6.8  Related Works..................................163
        6.9  The causal transition system...................169
7.  Partial Ordering Semantics..............................175
        7.1  Partial and mixed orderings....................176
        7.2  po relabelling.................................178
        7.3  mo vs. po semantics............................181
        7.4  SOS po semantics...............................183
        7.5  Proof of Theorem 7.3.1.........................184
8.  A Case Study: Facile....................................191
        8.1  Proved Transition System.......................192
        8.2  Causality......................................204
        8.3  Locality.......................................207
        8.4  Examples.......................................209
        8.5  Analysis of a Mobile File Browser Agent........213
9.  Extended Transition Systems.............................225
        9.1  Parametric bisimulation........................226
        9.2  Observations and regular languages.............233
        9.3  PisaTool.......................................236
10. Complexity and Concurrency..............................243
        10.1 Why Complexity and Concurrency.................244
        10.2 The scenario...................................245
        10.3 Complexity of a semantic model.................250
        10.4 Event structures and Petri nets................254
        10.5 No free lunches................................255
11. Compact Representations.................................259
        11.1 Compact transition systems.....................260
        11.2 SOS generation.................................278
        11.3 Related work...................................286
12. YAPV....................................................289
        12.1 Relabelling functions..........................289
        12.2 Generalizing bisimulation......................292
        12.3 Implementation of YAPV.........................296
13. Stochastic Pi-calculus..................................307
        13.1 The stochastic extension.......................307
        13.2 Performance measures...........................312
        13.3 An example.....................................314
        13.4 Topologies.....................................315
        13.5 Some remarks...................................321
14. A Distributed Name Manager..............................325
        14.1 Handling names.................................325
        14.2 A router.......................................328
        14.3 Operational semantics..........................331
Conclusions.................................................343
References..................................................347

============================================================================


&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

   Corrado Priami
   Universita' di Pisa                  Tel.: +39 (0)50 887268
   Dipartimento di Informatica          Tlx.: 590291 DIPISA I
   Corso Italia, 40                     Fax:  +39 (0)50 887226
   I-56125 PISA, Italia



From priami@di.unipi.it  Wed May 22 04:00:17 1996
Return-Path: <priami@di.unipi.it>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id EAA03929; Wed, 22 May 1996 04:00:17 -0500
Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by cli.com (4.1/SMI-4.1)
	id AA24794; Wed, 22 May 96 03:51:35 CDT
Organization:  Dipartimento di Informatica di Pisa - Italy
Received: from [131.114.4.128] (priami.di.unipi.it [131.114.4.128]) by mailserver.di.unipi.it (8.7.5/8.7.3) with SMTP id JAA04796; Wed, 22 May 1996 09:34:07 +0200 (MET DST)
Date: Wed, 22 May 1996 09:34:07 +0200 (MET DST)
X-Sender: priami@mailserver.di.unipi.it
Message-Id: <v01510103adca8ac0fc4b@[131.114.4.128]>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
To: coq-club@pauillac.inria.fr, formal-methods@cs.uidaho.edu, fsdm@cs.uq.oz.au,
        hvg@cl.cam.ac.uk, ifip-10.5@ics.uci.edu, info-hol@leopard.cs.byu.edu,
        isabelle-users@cl.cam.ac.uk, larch-interest@pa.dec.com,
        nqthm-users@cli.com, nuprllist@cs.cornell.edu, pvs@csl.sri.com,
        qed@mcs.anl.gov
From: priami@DI.Unipi.IT (Corrado Priami)
Subject: Call for demos
content-length: 2464

Dear all,

in connection with the Seventh International Conference on Concurrency
Theory some demonstrations of academic tools are organized. You find below
the call for demonstrations. Further details on the conference and on the
demonstrations are available by WWW at the location

        http://www.di.unipi.it/~ugo/CONCUR96/

I sincerely apologize if you receive more than one copy of this message.

Best wishes,

Corrado Priami


==============================================================================
                          CONCUR96 - CALL FOR DEMOS
                               August 26 - 29
                                Pisa - ITALY
==============================================================================

In connection with the international conference CONCUR'96, some
sessions devoted to demonstrations of (semi-)automatic academic tools for the
analysis and verification of concurrent systems are organized.
We have a limited number of slots available, thus we will make a selection
of the demonstrations on the basis of proposals prepared as specified below.
CONCUR'96 and Demonstrations will take place at Pisa, Italy, on
August 26-29, 1996.

Authors are invited to submit proposals according to the following format

- names, affiliations and addresses of the authors
- an abstract of one page describing goals and functionalities of the tool
- a precise description of the hardware and the software needed

Proposals that are not prepared according to the above guidelines will not be
considered for selection.

Proposals for academic tool demonstrations must be sent to
(electronic submissions are solicited)

        Corrado Priami
        Dipartimento di Informatica
        Universita' di Pisa
        Corso Italia, 40
        56100 PISA - Italy
        Tel. (+39) 50 887 268
        Fax  (+39) 50 887 226
        Email: priami@di.unipi.it

Important dates:
        Deadline for submission:            June 10 1996
        Notification of acceptance:         July  1 1996

For any information, please send requests to priami@di.unipi.it
=============================================================================


&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

   Corrado Priami
   Universita' di Pisa                  Tel.: +39 (0)50 887268
   Dipartimento di Informatica          Tlx.: 590291 DIPISA I
   Corso Italia, 40                     Fax:  +39 (0)50 887226
   I-56125 PISA, Italia



From clt@Steam.Stanford.EDU  Thu May 23 17:52:39 1996
Return-Path: <clt@Steam.Stanford.EDU>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id RAA04692; Thu, 23 May 1996 17:52:39 -0500
Received: from Steam.Stanford.EDU by cli.com (4.1/SMI-4.1)
	id AA24919; Thu, 23 May 96 17:52:17 CDT
Received: (from clt@localhost) by Steam.Stanford.EDU (8.7.5/8.7.1) id PAA25810; Thu, 23 May 1996 15:52:09 -0700 (PDT)
Date: Thu, 23 May 1996 15:52:09 -0700 (PDT)
Message-Id: <199605232252.PAA25810@Steam.Stanford.EDU>
From: Carolyn Talcott <clt@Steam.Stanford.EDU>
To: fg121@inferenzsysteme.informatik.th-darmstadt.de, qed@mcs.anl.gov,
        rewriting@loria.fr, theorem-provers@ai.mit.edu,
        isabelle-users@cl.cam.ac.uk, coq@margaux.inria.fr, elf-list@cs.cmu.edu,
        info-hol@leopard.cs.byu.edu, imps@linus.mitre.org, nqthm-users@cli.com,
        fsdm-real@cs.uq.oz.au
Subject: announcing a new joint mechanized reasoning web page
Reply-To: clt@Steam.Stanford.EDU
content-length: 1139



%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% New Joint WWW Home-Page for Mechanized Reasoning      %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

[Our sincere Apologies, if you receive this more than once]


Dear Colleagues,

We are pleased to announce the availability of a new WWW home-page for
mechanized reasoning. It consists of the information previously contained
in Carolyn Talcott's "Mechanized Reasoning" page and Michael Kohlhase's
"Deduction Worldwide" pages and will replace these. To conserve existing
links and bandwidth it will be mirrored at both original sites:

Europe: http://jswww.cs.uni-sb.de/ded/mr.html
USA:    http://www-formal.stanford.edu/clt/ARS/ars-db.html

The pages are still quite provisional, we hope that in time they will
evolve to a WWW entry point to and a representation of all mechanized
reasioning activities; so please send us interesting material, links and
suggestions.

   Michael Kohlhase 
   kohlhase@cs.uni-sb.de
   http://jswww.cs.uni-sb.de/~kohlhase/

 and 

   Carolyn Talcott 
   clt@sail.stanford.edu
   http://www-formal.stanford.edu/clt/home.hmtl


From howe@research.att.com  Tue Jun  4 22:54:14 1996
Return-Path: <howe@research.att.com>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id WAA13168; Tue, 4 Jun 1996 22:54:14 -0500
Received: from research.att.com (ns.research.att.com) by cli.com (4.1/SMI-4.1)
	id AA20563; Tue, 4 Jun 96 22:54:10 CDT
Received: from research.att.com by ns; Tue Jun  4 23:52:13 EDT 1996
Received: from hunny.research.att.com by research; Tue Jun  4 23:48:50 EDT 1996
Received: from bolete.research.att.com by hunny.research.att.com with smtp
	(Smail3.1.29.1 #2) id m0uR9bk-003PfbC; Tue, 4 Jun 96 23:50 EDT
Received: by bolete.research.att.com (Smail3.1.29.1 #2)
	id m0uR9aT-002ml1C; Tue, 4 Jun 96 23:48 EDT
Message-Id: <m0uR9aT-002ml1C@bolete.research.att.com>
Date: Tue, 4 Jun 96 23:48 EDT
From: howe@research.att.com (Doug Howe)
To: nqthm-users@cli.com
Subject: FLoC'96: Second Call for Participation
Reply-To: lics-request@research.att.com
content-length: 1876




                   1996 FEDERATED LOGIC CONFERENCE
                                   
                               FLoC'96

    July 27 - August 3, 1996, Rutgers University, New Jersey, USA
                                   


   CADE: 13th International Conference on        July 30 - August 3
         Automated Deduction 

   CAV:  8th International Conference on         July 31 - August 3
         Computer-Aided Verification 

   LICS: 11th Annual IEEE Symposium on           July 27 - July 30
         Logic in Computer Science 

   RTA:  7th International Conference on         July 27 - July 30
         Rewriting Techniques and Applications 



     +---------------------------------------------------------+
     |                                                         |
     |                       *DEADLINES*                       |
     |                                                         |
     | Early Registration                          21 Jun 1996 |
     | On-Campus Housing Reservation               21 Jun 1996 |
     | Hotel Reservation                           28 Jun 1996 |
     |                                                         |
     +---------------------------------------------------------+



TRAVEL UPDATE.  There is a shuttle service between Newark Airport and
  the Rutgers campus.  See the FLoC web page (URL below) for details.


FURTHER INFORMATION.  For programs and registration information:

                http://www.research.att.com/lics/floc/
                 ftp://ftp.research.att.com/dist/floc/

  For e-mail enquiries about the participating meetings:

                        cade13@cisr.anu.edu.au
                         cav96@research.att.com
                        lics96@cs.cmu.edu 
                         rta96@mpi-sb.mpg.de

  For other enquiries about FLoC: lics-request@research.att.com.

From jgrundy@ra.abo.fi  Thu Jun 20 02:41:48 1996
Return-Path: <jgrundy@ra.abo.fi>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id CAA19242; Thu, 20 Jun 1996 02:41:47 -0500
Received: from ra.abo.fi by cli.com (SMI-8.6/SMI-SVR4)
	id CAA11548; Thu, 20 Jun 1996 02:41:45 -0500
Received: from bruce.abo.fi (root@bruce.abo.fi [130.232.209.103]) by ra.abo.fi (8.7.3/8.7.3) with ESMTP id KAA16318; Thu, 20 Jun 1996 10:32:04 +0300 (EET DST)
Received: from bruce.abo.fi (jgrundy@localhost [127.0.0.1]) by bruce.abo.fi (8.7.5/8.7.3) with ESMTP id KAA03940; Thu, 20 Jun 1996 10:32:03 +0300 (EET DST)
Message-Id: <199606200732.KAA03940@bruce.abo.fi>
To: coq-club@pauillac.inria.fr, formal-methods@cs.uidaho.edu, fsdm@cs.uq.oz.au,
        hvg@cl.cam.ac.uk, ifip-10.5@ics.uci.edu, info-hol@leopard.cs.byu.edu,
        isabelle-users@cl.cam.ac.uk, larch-interest@pa.dec.com,
        nqthm-users@cli.com, nuprlnotes@cs.cornell.edu, pvs@csl.sri.com,
        qed@mcs.anl.gov, softverf@leopard.cs.byu.edu, theory@cl.cam.ac.uk,
        theoryc@info.cs.vt.edu, theorynt@listserv.nodak.edu,
        theorem-provers@ai.mit.edu, vdm-forum@mailbase.ac.uk,
        zforum@prg.ox.ac.uk
Subject: TPHOLs'96 Early Registration Closing on Theorem Proving Conference
From: Jim Grundy <jim.grundy@abo.fi>
Date: Thu, 20 Jun 1996 10:31:40 +0300
Sender: jgrundy@ra.abo.fi
content-length: 13841


Please note that the Friday 21 June is the closing date for early registration
for TPHOLs'96.  After that, the cost of attending the conference will rise
slightly.  You need send no money to register, but you must register now
if you wish to pay the lower fee on arrival at the conferecnce.


                            CALL FOR PARTICIPATION

  THE 1996 INTERNATIONAL CONFERENCE ON THEOREM PROVING IN HIGHER ORDER LOGICS

        ************************************************************
        *  If you have Web access, all the following information   *
        *     and more is available in a nicer format from:        *
        *                                                          *
        *        http://www.abo.fi/~jharriso/TPHOLs96.html         *
        ************************************************************

The 1996 International Conference on Theorem Proving in Higher Order Logics
will be held on 27-30 August 1996 (Tuesday to Friday) in Turku (Abo in Swedish)
in the South-west corner of Finland. Two tutorials are also included, starting
after midday on Monday 26th August.

The conference will be a venue for presentations on the following topics, among
others: advances in interactive theorem proving, proof automation and decision
procedures, applications of mechanized theorem proving, comparison between
different theorem proving approaches, exploiting external tools within theorem
provers and incorporating theorem provers into larger systems.

Previous conferences have been at Cambridge (UK), Aarhus, Davis, Leuven,
Vancouver, Malta and Salt Lake City. This conference is being organized by the
Turku Centre for Computer Science (TUCS) and Abo Akademi University.

  ****************************************************************************
  * The third Workshop on Designing Correct Circuits (DCC) will be held from *
  * Monday 2 September to Wednesday 4 September 1996 at Bastad in Southern   *
  * Sweden. This is an excellent opportunity for researchers from outside    *
  * Europe to attend both conferences.                                       *
  ****************************************************************************

If you require any further information, please contact the organizing committee
on "orgcom@abo.fi", or any of the members (Joakim von Wright, Jim Grundy or
John Harrison) at the following address:

       Abo Akademi University
       Department of Computer Science
       Lemminkaisenkatu 14A
       20520 Turku
       FINLAND

  ============================================================================

                                  PROGRAMME

  The 1996 International Conference on Theorem Proving in Higher Order Logics

Monday 26 August

12.00   Registration

12.30   Lunch

14.00   Tutorial: Reflections on aspects of the design of Nuprl and PVS
        Paul Jackson (U. Edinburgh)

15.40   Break

16.00   Tutorial: The Coq proof assistant: principle and practice
        Christine Paulin (ENS Lyon)

18.00   Dinner

*       *       *       *       *       *       *       *

Tuesday 27 August

8.30    Late registration and breakfast

9.30    Conference opens

9.45    Session 1

        A comparison of MDG and HOL for hardware verification
        Sofiene Tahar (U. Montreal), Paul Curzon (U. Cambridge)

        Coq and hardware verification: a case study
        Solange Coupet-Grimal, Line Jakubiec (Lab. Informatique de Marseille)

10.55   Break

11.20   Session 2

        A mechanisation of computability theory in HOL
        Vincent Zammit (U. Kent)

        Using lattice theory in higher order logic
        Linas Laibinis (TUCS, Turku)

12.30   Lunch

14.00   Session 3

        Verification of compiler correctness for the WAM
        Cornelia Pusch (TU Munchen)

        Applying the composition principle to verify a
          micro-kernel operating system
        Heckman, Zhang, Becker, Peticolas, Levitt, Olsson (UC Davis)

15.10   Break

15.40   Session 4

        Proving liveness of fair transition systems
        Holger Busch (Siemens AG, Munchen)

        A modular coding of UNITY in Coq
        Barbara Heyd (INRIA Lorraine), Pierre Cregut (France Telecom)

18.00   Dinner, Volleyball and Sauna

*       *       *       *       *       *       *       *

Wednesday 28 August

8.30    Invited lecture: Set theory, higher order logic or both?
        Mike Gordon (U. Cambridge)

9.30    Break

9.45    Session 5

        Program derivation using the Refinement Calculator
        Michael Butler (U. Southampton), Thomas Langbacka (U. Helsinki)

        A proof tool for reasoning about functional programs
        Graham Collins (U. Glasgow)

10.55   Break

11.20   Session 6

        Function definition in higher-order logic
        Konrad Slind (TU Munchen)

        Five axioms of alpha-conversion
        Andy Gordon (U. Cambridge), Tom Melham (U. Glasgow)

12.30   Lunch

13.30   Session 7

        Implementation issues about the embedding of
          existing high level synthesis algorithms in HOL
        Dirk Eisenbiegler, Christian Blumenroehr, Ramayya Kumar (Karlsruhe)

        Stalmarck's algorithm as a HOL derived rule
        John Harrison (Abo Akademi)

15.00 - 22.00   Excursion

*       *       *       *       *       *       *       *

Thursday 29 August

8.30    Invited lecture: Development of the Mizar Mathematical Library
        Andrzej Trybulec (U. Warsaw, Bialystok)

9.30    Break

9.45    Session 8

        Modeling a hardware synthesis methodology in Isabelle
        David Basin, Stefan Friedrich (MPI, Saarbrucken)

        Improving the result of high-level synthesis using
          interactive transformational design
        Mats Larsson (Volvo, Goteborg)

10.55   Break

11.20   Session 9

        A comparison of HOL and ALF formalizations of a
          categorical coherence theorem
        Sten Agerholm (IFAD), Ilya Beylin (Chalmers), Peter Dybjer (Chalmers)

        Synthetic domain theory in type theory:
          another logic of computable functions
        Bernhard Reus (Ludwig-Maximilians Universitat, Munchen)

12.30   Lunch

14.00   Session 10

        Cryptographic protocol adequacy with HOL: the implementation
        Steven Brackin (Arca Systems, Inc)

        POSTER SESSION

            Abstracting signals: the waveform library
            Robert H. Beers, Phillip J. Windley (BYU)

            A proved type inference tool for ML:
              Damas-Milner within Coq (work in progress)
            Catherine Dubois, Valerie Menissier-Morain (U. d'evry)

            Problem solving with tactics
            Hagiya, Tanaka, Yamamoto (U. Tokyo), Nishizaki (Chiba U.)

            Deeply embedding behavioral hardware description languages
            Michael D. Jones, Trent N. Larson, Phillip J. Windley (BYU)

            Using auxiliary knowledge in automating invariant proofs
            Pertti Kellomaki (Tampere U. Technology)

            Derivation of verification rules from operational definitions
            Michael Norrish (U. Cambridge)

            Natural proofs versus programs optimization in the
              Calculus of Inductive Constructions
            Catherine Parent (VERIMAG, France)

            Extending a state transition system with real-time semantics
            Peticolas, Zhang, Becker, Heckman, Levitt, Olsson (UC Davis)

            A HOL model of interlocking systems
            Wai Wong (Hong Kong Baptist U.)

15.30   Break

16.00   Session 11

        A Mizar mode for HOL
        John Harrison (Abo Akademi)

        Higher-order annotated terms for proof search
        Alan Smaill, Ian Green (U. Edinburgh)

19.00   Conference dinner

*       *       *       *       *       *       *       *

Friday 30 August

8.30    Session 12

        Inference rules for programming languages with
          side effects in expressions
        Paul E. Black, Phillip J. Windley (BYU)

        Formal verification of algorithm W
        Dieter Nazareth, Tobias Nipkow (TU Munchen)

9.40    Break

10.00   Session 13

        Elements of mathematical analysis in PVS
        Bruno Dutertre (Royal Holloway, U. London)

        Importing mathematics from HOL into Nuprl
        Doug Howe (Bell Labs)

11.10   Break

11.30   Session 14

        A structure preserving encoding of Z in HOL
        Kolyang (Bremen), Thomas Santen (GMD First), Burkhart Wolff (Bremen)

        Translating specifications in VDM-SL to higher order logic
        Sten Agerholm (IFAD, Denmark)

12.40   Conference closes

12.50   Lunch

14.00   Administrative session

  ============================================================================

                                REGISTRATION

The fee for early registration, on or before Friday 21 June is FIM200. There
are separate fees for accommodation and meals. If, as we expect, you are
staying at the conference venue, Turun Kristillinen Opisto, the cost is FIM200
per person (single) or FIM150 per person (shared), per night. If you prefer to
stay at a central hotel, the corresponding costs will be approximately FIM270
and FIM150. Meals, conference banquet and refreshments for the whole
conference cost an additional FIM876 per person, or FIM705 for guests not
requiring refreshments during the breaks. A more detailed breakdown of the
costs is available on the Web at:

  http://www.abo.fi/~jharriso/cost.html

After Friday 21 June, the registration fee rises to FIM250, and after the end
of July, we will be unable to guarantee accommodation at the same price and
standard. You can register via the Web; see:

  http://www.abo.fi/~jharriso/webform.html

Alternatively, fill in the following form, and either:

 * Email it to "orgcom@abo.fi"

 * Fax it to any member of the organizing committee on +358 21 265-4732

 * Send it by mail to the organizing committee (see the address above).

By registering for TPHOLs'96 you are agreeing to pay the applicable
registration fee even if you subsequently fail attend the conference. If you
are unable to attend the conference then the organizing committee may waive the
fee if you inform us of your change of plans in a timely manner. However, if
you just fail to show up, we are going to want our money.


 1. Name: ________________________________________________________
    (as you would like it to appear on your name tag)

 2. Affiliation:

    ______________________________________________________________

    ______________________________________________________________

  3. Address:

    ______________________________________________________________

    ______________________________________________________________

    ______________________________________________________________

 4. Email: _______________________________________________________

 5. Fax: +________________________________________________________

 6. Phone: +______________________________________________________

 7. Arrival Day:
      [_] Friday   23 August
      [_] Saturday 24 August
      [_] Sunday   25 August
      [_] Monday   26 August
      [_] Tuesday  27 August
    Arrival Time: ________________________________________________
    Arrival Point:
      [_] Turku Airport
      [_] Turku Railway Station
      [_] Turku Bus Station
      [_] Turku Harbor, Silja Terminal
      [_] Turku Harbor, Viking Terminal
      [_] Unknown
 8. Departure Day:
      [_] Thursday 29 August
      [_] Friday   30 August
      [_] Saturday 31 August
      [_] Sunday    1 September
      [_] Monday    2 September

 9. Number of Accompanying Guests: __
      These are people not attending the conference, but for whom
      you would like meals and accommodation arranged.

10. Accommodation is available either at the conference venue,
    Turun Kristillinen Opisto, located a few kilometers from the
    centre of town; or at various centrally located hotels.  We
    expect most people will stay at Turun Kristillinen Opisto.

    Would you like to stay at:
      [_] Turun Kristillinen Opisto
            FIM200 per person, per night single.
            FIM150 per person, per night shared.
      [_] A central hotel
            FIM270 per person, per night single.
            FIM150 per person, per night shared.
      [_] I'll arrange my own accommodation thanks.

    Note that we are unable to guarantee the same prices or
    quality of accommodation for people registering after July.

11. Special Dietary Requirements: ________________________________

12. Special Access Requirements: _________________________________

13. Would you like to share a room? (other than with your guests)
      [_] no
      [_] yes
          With anyone in particular?
            [_] yes: _____________________________________________
            [_] no
                You are:
                  [_] female
                  [_] male
                You would be content to share with a:
                  [_] female
                  [_] male

14. Would you buy a TPHOLs'96 T-shirt if we made one?
      [_] yes, size [_] S [_] M [_] L [_] XL
      [_] no
    T-shirts would be sold at their cost price.

15. The conference registration fee is as follows:
      * FIM200 for early registration (Friday 21 June or earlier).
      * FIM250 for late registration (Saturday 22 June or later).
    Payable in cash (Finnish Markka only) at the Conference.

    In addition to the registration fee, there will be a fee for
    meals and accommodation (details available elsewhere).  You
    can pay for your accommodation and meals at the conference in
    cash (Finnish Markka only), or with the following credit cards
    only: Diner's Club, EuroCard, MasterCard or Visa.

    How will you be paying for your meals and accommodation?
      [_] Cash (Finnish Markka)
      [_] Diner's Club
      [_] EuroCard
      [_] MasterCard
      [_] Visa

From sandel@cli  Thu Jun 20 09:41:59 1996
Return-Path: <sandel@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id JAA19361; Thu, 20 Jun 1996 09:41:59 -0500
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id JAA11867; Thu, 20 Jun 1996 09:41:58 -0500
From: sandel@cli (Charles Sandel)
Received: by blanco (SMI-8.6) id JAA25317; Thu, 20 Jun 1996 09:41:57 -0500
Date: Thu, 20 Jun 1996 09:41:57 -0500
Message-Id: <199606201441.JAA25317@blanco>
Subject: Non-member submission from [Jim Grundy <jim.grundy@abo.fi>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable
Content-MD5: dE6UvEPIlRtMeL4GR4kYPQ==
content-length: 15633

------------- Begin Forwarded Message -------------

=46rom jgrundy@ra.abo.fi  Thu Jun 20 02:41:47 1996
Return-Path: <jgrundy@ra.abo.fi>
Received: from ra.abo.fi by cli.com (SMI-8.6/SMI-SVR4)
	id CAA11548; Thu, 20 Jun 1996 02:41:45 -0500
Received: from bruce.abo.fi (root@bruce.abo.fi [130.232.209.103]) by =
ra.abo.fi=20
(8.7.3/8.7.3) with ESMTP id KAA16318; Thu, 20 Jun 1996 10:32:04 +0300 =
(EET DST)
Received: from bruce.abo.fi (jgrundy@localhost [127.0.0.1]) by =
bruce.abo.fi (8.7.5/8.7.3)=20
with ESMTP id KAA03940; Thu, 20 Jun 1996 10:32:03 +0300 (EET DST)
Message-Id: <199606200732.KAA03940@bruce.abo.fi>
To: coq-club@pauillac.inria.fr, formal-methods@cs.uidaho.edu, =
fsdm@cs.uq.oz.au,
        hvg@cl.cam.ac.uk, ifip-10.5@ics.uci.edu, =
info-hol@leopard.cs.byu.edu,
        isabelle-users@cl.cam.ac.uk, larch-interest@pa.dec.com,
        nqthm-users@cli.com, nuprlnotes@cs.cornell.edu, pvs@csl.sri.com,
        qed@mcs.anl.gov, softverf@leopard.cs.byu.edu, =
theory@cl.cam.ac.uk,
        theoryc@info.cs.vt.edu, theorynt@listserv.nodak.edu,
        theorem-provers@ai.mit.edu, vdm-forum@mailbase.ac.uk,
        zforum@prg.ox.ac.uk
Subject: TPHOLs'96 Early Registration Closing on Theorem Proving =
Conference
From: Jim Grundy <jim.grundy@abo.fi>
Date: Thu, 20 Jun 1996 10:31:40 +0300
Sender: jgrundy@ra.abo.fi
content-length: 13841


Please note that the Friday 21 June is the closing date for early =
registration
for TPHOLs'96.  After that, the cost of attending the conference will =
rise
slightly.  You need send no money to register, but you must register now
if you wish to pay the lower fee on arrival at the conferecnce.


                            CALL FOR PARTICIPATION

  THE 1996 INTERNATIONAL CONFERENCE ON THEOREM PROVING IN HIGHER ORDER =
LOGICS

        ************************************************************
        *  If you have Web access, all the following information   *
        *     and more is available in a nicer format from:        *
        *                                                          *
        *        http://www.abo.fi/~jharriso/TPHOLs96.html         *
        ************************************************************

The 1996 International Conference on Theorem Proving in Higher Order =
Logics
will be held on 27-30 August 1996 (Tuesday to Friday) in Turku (Abo in =
Swedish)
in the South-west corner of Finland. Two tutorials are also included, =
starting
after midday on Monday 26th August.

The conference will be a venue for presentations on the following =
topics, among
others: advances in interactive theorem proving, proof automation and =
decision
procedures, applications of mechanized theorem proving, comparison =
between
different theorem proving approaches, exploiting external tools within =
theorem
provers and incorporating theorem provers into larger systems.

Previous conferences have been at Cambridge (UK), Aarhus, Davis, Leuven,
Vancouver, Malta and Salt Lake City. This conference is being organized =
by the
Turku Centre for Computer Science (TUCS) and Abo Akademi University.

  =
*************************************************************************=
***
  * The third Workshop on Designing Correct Circuits (DCC) will be held =
from *
  * Monday 2 September to Wednesday 4 September 1996 at Bastad in =
Southern   *
  * Sweden. This is an excellent opportunity for researchers from =
outside    *
  * Europe to attend both conferences.                                   =
    =
*
  =
*************************************************************************=
***

If you require any further information, please contact the organizing =
committee
on "orgcom@abo.fi", or any of the members (Joakim von Wright, Jim Grundy =
or
John Harrison) at the following address:

       Abo Akademi University
       Department of Computer Science
       Lemminkaisenkatu 14A
       20520 Turku
       FINLAND

  =
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D

                                  PROGRAMME

  The 1996 International Conference on Theorem Proving in Higher Order =
Logics

Monday 26 August

12.00   Registration

12.30   Lunch

14.00   Tutorial: Reflections on aspects of the design of Nuprl and PVS
        Paul Jackson (U. Edinburgh)

15.40   Break

16.00   Tutorial: The Coq proof assistant: principle and practice
        Christine Paulin (ENS Lyon)

18.00   Dinner

*       *       *       *       *       *       *       *

Tuesday 27 August

8.30    Late registration and breakfast

9.30    Conference opens

9.45    Session 1

        A comparison of MDG and HOL for hardware verification
        Sofiene Tahar (U. Montreal), Paul Curzon (U. Cambridge)

        Coq and hardware verification: a case study
        Solange Coupet-Grimal, Line Jakubiec (Lab. Informatique de =
Marseille)

10.55   Break

11.20   Session 2

        A mechanisation of computability theory in HOL
        Vincent Zammit (U. Kent)

        Using lattice theory in higher order logic
        Linas Laibinis (TUCS, Turku)

12.30   Lunch

14.00   Session 3

        Verification of compiler correctness for the WAM
        Cornelia Pusch (TU Munchen)

        Applying the composition principle to verify a
          micro-kernel operating system
        Heckman, Zhang, Becker, Peticolas, Levitt, Olsson (UC Davis)

15.10   Break

15.40   Session 4

        Proving liveness of fair transition systems
        Holger Busch (Siemens AG, Munchen)

        A modular coding of UNITY in Coq
        Barbara Heyd (INRIA Lorraine), Pierre Cregut (France Telecom)

18.00   Dinner, Volleyball and Sauna

*       *       *       *       *       *       *       *

Wednesday 28 August

8.30    Invited lecture: Set theory, higher order logic or both?
        Mike Gordon (U. Cambridge)

9.30    Break

9.45    Session 5

        Program derivation using the Refinement Calculator
        Michael Butler (U. Southampton), Thomas Langbacka (U. Helsinki)

        A proof tool for reasoning about functional programs
        Graham Collins (U. Glasgow)

10.55   Break

11.20   Session 6

        Function definition in higher-order logic
        Konrad Slind (TU Munchen)

        Five axioms of alpha-conversion
        Andy Gordon (U. Cambridge), Tom Melham (U. Glasgow)

12.30   Lunch

13.30   Session 7

        Implementation issues about the embedding of
          existing high level synthesis algorithms in HOL
        Dirk Eisenbiegler, Christian Blumenroehr, Ramayya Kumar =
(Karlsruhe)

        Stalmarck's algorithm as a HOL derived rule
        John Harrison (Abo Akademi)

15.00 - 22.00   Excursion

*       *       *       *       *       *       *       *

Thursday 29 August

8.30    Invited lecture: Development of the Mizar Mathematical Library
        Andrzej Trybulec (U. Warsaw, Bialystok)

9.30    Break

9.45    Session 8

        Modeling a hardware synthesis methodology in Isabelle
        David Basin, Stefan Friedrich (MPI, Saarbrucken)

        Improving the result of high-level synthesis using
          interactive transformational design
        Mats Larsson (Volvo, Goteborg)

10.55   Break

11.20   Session 9

        A comparison of HOL and ALF formalizations of a
          categorical coherence theorem
        Sten Agerholm (IFAD), Ilya Beylin (Chalmers), Peter Dybjer =
(Chalmers)

        Synthetic domain theory in type theory:
          another logic of computable functions
        Bernhard Reus (Ludwig-Maximilians Universitat, Munchen)

12.30   Lunch

14.00   Session 10

        Cryptographic protocol adequacy with HOL: the implementation
        Steven Brackin (Arca Systems, Inc)

        POSTER SESSION

            Abstracting signals: the waveform library
            Robert H. Beers, Phillip J. Windley (BYU)

            A proved type inference tool for ML:
              Damas-Milner within Coq (work in progress)
            Catherine Dubois, Valerie Menissier-Morain (U. d'evry)

            Problem solving with tactics
            Hagiya, Tanaka, Yamamoto (U. Tokyo), Nishizaki (Chiba U.)

            Deeply embedding behavioral hardware description languages
            Michael D. Jones, Trent N. Larson, Phillip J. Windley (BYU)

            Using auxiliary knowledge in automating invariant proofs
            Pertti Kellomaki (Tampere U. Technology)

            Derivation of verification rules from operational =
definitions
            Michael Norrish (U. Cambridge)

            Natural proofs versus programs optimization in the
              Calculus of Inductive Constructions
            Catherine Parent (VERIMAG, France)

            Extending a state transition system with real-time semantics
            Peticolas, Zhang, Becker, Heckman, Levitt, Olsson (UC Davis)

            A HOL model of interlocking systems
            Wai Wong (Hong Kong Baptist U.)

15.30   Break

16.00   Session 11

        A Mizar mode for HOL
        John Harrison (Abo Akademi)

        Higher-order annotated terms for proof search
        Alan Smaill, Ian Green (U. Edinburgh)

19.00   Conference dinner

*       *       *       *       *       *       *       *

Friday 30 August

8.30    Session 12

        Inference rules for programming languages with
          side effects in expressions
        Paul E. Black, Phillip J. Windley (BYU)

        Formal verification of algorithm W
        Dieter Nazareth, Tobias Nipkow (TU Munchen)

9.40    Break

10.00   Session 13

        Elements of mathematical analysis in PVS
        Bruno Dutertre (Royal Holloway, U. London)

        Importing mathematics from HOL into Nuprl
        Doug Howe (Bell Labs)

11.10   Break

11.30   Session 14

        A structure preserving encoding of Z in HOL
        Kolyang (Bremen), Thomas Santen (GMD First), Burkhart Wolff =
(Bremen)

        Translating specifications in VDM-SL to higher order logic
        Sten Agerholm (IFAD, Denmark)

12.40   Conference closes

12.50   Lunch

14.00   Administrative session

  =
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D

                                REGISTRATION

The fee for early registration, on or before Friday 21 June is FIM200. =
There
are separate fees for accommodation and meals. If, as we expect, you are
staying at the conference venue, Turun Kristillinen Opisto, the cost is =
FIM200
per person (single) or FIM150 per person (shared), per night. If you =
prefer to
stay at a central hotel, the corresponding costs will be approximately =
FIM270
and FIM150. Meals, conference banquet and refreshments for the whole
conference cost an additional FIM876 per person, or FIM705 for guests =
not
requiring refreshments during the breaks. A more detailed breakdown of =
the
costs is available on the Web at:

  http://www.abo.fi/~jharriso/cost.html

After Friday 21 June, the registration fee rises to FIM250, and after =
the end
of July, we will be unable to guarantee accommodation at the same price =
and
standard. You can register via the Web; see:

  http://www.abo.fi/~jharriso/webform.html

Alternatively, fill in the following form, and either:

 * Email it to "orgcom@abo.fi"

 * Fax it to any member of the organizing committee on +358 21 265-4732

 * Send it by mail to the organizing committee (see the address above).

By registering for TPHOLs'96 you are agreeing to pay the applicable
registration fee even if you subsequently fail attend the conference. If =
you
are unable to attend the conference then the organizing committee may =
waive the
fee if you inform us of your change of plans in a timely manner. =
However, if
you just fail to show up, we are going to want our money.


 1. Name: ________________________________________________________
    (as you would like it to appear on your name tag)

 2. Affiliation:

    ______________________________________________________________

    ______________________________________________________________

  3. Address:

    ______________________________________________________________

    ______________________________________________________________

    ______________________________________________________________

 4. Email: _______________________________________________________

 5. Fax: +________________________________________________________

 6. Phone: +______________________________________________________

 7. Arrival Day:
      [_] Friday   23 August
      [_] Saturday 24 August
      [_] Sunday   25 August
      [_] Monday   26 August
      [_] Tuesday  27 August
    Arrival Time: ________________________________________________
    Arrival Point:
      [_] Turku Airport
      [_] Turku Railway Station
      [_] Turku Bus Station
      [_] Turku Harbor, Silja Terminal
      [_] Turku Harbor, Viking Terminal
      [_] Unknown
 8. Departure Day:
      [_] Thursday 29 August
      [_] Friday   30 August
      [_] Saturday 31 August
      [_] Sunday    1 September
      [_] Monday    2 September

 9. Number of Accompanying Guests: __
      These are people not attending the conference, but for whom
      you would like meals and accommodation arranged.

10. Accommodation is available either at the conference venue,
    Turun Kristillinen Opisto, located a few kilometers from the
    centre of town; or at various centrally located hotels.  We
    expect most people will stay at Turun Kristillinen Opisto.

    Would you like to stay at:
      [_] Turun Kristillinen Opisto
            FIM200 per person, per night single.
            FIM150 per person, per night shared.
      [_] A central hotel
            FIM270 per person, per night single.
            FIM150 per person, per night shared.
      [_] I'll arrange my own accommodation thanks.

    Note that we are unable to guarantee the same prices or
    quality of accommodation for people registering after July.

11. Special Dietary Requirements: ________________________________

12. Special Access Requirements: _________________________________

13. Would you like to share a room? (other than with your guests)
      [_] no
      [_] yes
          With anyone in particular?
            [_] yes: _____________________________________________
            [_] no
                You are:
                  [_] female
                  [_] male
                You would be content to share with a:
                  [_] female
                  [_] male

14. Would you buy a TPHOLs'96 T-shirt if we made one?
      [_] yes, size [_] S [_] M [_] L [_] XL
      [_] no
    T-shirts would be sold at their cost price.

15. The conference registration fee is as follows:
      * FIM200 for early registration (Friday 21 June or earlier).
      * FIM250 for late registration (Saturday 22 June or later).
    Payable in cash (Finnish Markka only) at the Conference.

    In addition to the registration fee, there will be a fee for
    meals and accommodation (details available elsewhere).  You
    can pay for your accommodation and meals at the conference in
    cash (Finnish Markka only), or with the following credit cards
    only: Diner's Club, EuroCard, MasterCard or Visa.

    How will you be paying for your meals and accommodation?
      [_] Cash (Finnish Markka)
      [_] Diner's Club
      [_] EuroCard
      [_] MasterCard
      [_] Visa
------------- End Forwarded Message -------------


From owner-nqthm-users@cli  Thu Jun 20 11:22:36 1996
Return-Path: <owner-nqthm-users@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id LAA19392; Thu, 20 Jun 1996 11:22:35 -0500
Received: by cli.com (SMI-8.6/SMI-SVR4)
	id JAA11873; Thu, 20 Jun 1996 09:42:01 -0500
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id JAA11867; Thu, 20 Jun 1996 09:41:58 -0500
From: sandel@cli (Charles Sandel)
Received: by blanco (SMI-8.6) id JAA25317; Thu, 20 Jun 1996 09:41:57 -0500
Date: Thu, 20 Jun 1996 09:41:57 -0500
Message-Id: <199606201441.JAA25317@blanco>
Subject: Non-member submission from [Jim Grundy <jim.grundy@abo.fi>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable
Content-MD5: dE6UvEPIlRtMeL4GR4kYPQ==
Sender: owner-nqthm-users@cli
Precedence: bulk
content-length: 15633

------------- Begin Forwarded Message -------------

=46rom jgrundy@ra.abo.fi  Thu Jun 20 02:41:47 1996
Return-Path: <jgrundy@ra.abo.fi>
Received: from ra.abo.fi by cli.com (SMI-8.6/SMI-SVR4)
	id CAA11548; Thu, 20 Jun 1996 02:41:45 -0500
Received: from bruce.abo.fi (root@bruce.abo.fi [130.232.209.103]) by =
ra.abo.fi=20
(8.7.3/8.7.3) with ESMTP id KAA16318; Thu, 20 Jun 1996 10:32:04 +0300 =
(EET DST)
Received: from bruce.abo.fi (jgrundy@localhost [127.0.0.1]) by =
bruce.abo.fi (8.7.5/8.7.3)=20
with ESMTP id KAA03940; Thu, 20 Jun 1996 10:32:03 +0300 (EET DST)
Message-Id: <199606200732.KAA03940@bruce.abo.fi>
To: coq-club@pauillac.inria.fr, formal-methods@cs.uidaho.edu, =
fsdm@cs.uq.oz.au,
        hvg@cl.cam.ac.uk, ifip-10.5@ics.uci.edu, =
info-hol@leopard.cs.byu.edu,
        isabelle-users@cl.cam.ac.uk, larch-interest@pa.dec.com,
        nqthm-users@cli.com, nuprlnotes@cs.cornell.edu, pvs@csl.sri.com,
        qed@mcs.anl.gov, softverf@leopard.cs.byu.edu, =
theory@cl.cam.ac.uk,
        theoryc@info.cs.vt.edu, theorynt@listserv.nodak.edu,
        theorem-provers@ai.mit.edu, vdm-forum@mailbase.ac.uk,
        zforum@prg.ox.ac.uk
Subject: TPHOLs'96 Early Registration Closing on Theorem Proving =
Conference
From: Jim Grundy <jim.grundy@abo.fi>
Date: Thu, 20 Jun 1996 10:31:40 +0300
Sender: jgrundy@ra.abo.fi
content-length: 13841


Please note that the Friday 21 June is the closing date for early =
registration
for TPHOLs'96.  After that, the cost of attending the conference will =
rise
slightly.  You need send no money to register, but you must register now
if you wish to pay the lower fee on arrival at the conferecnce.


                            CALL FOR PARTICIPATION

  THE 1996 INTERNATIONAL CONFERENCE ON THEOREM PROVING IN HIGHER ORDER =
LOGICS

        ************************************************************
        *  If you have Web access, all the following information   *
        *     and more is available in a nicer format from:        *
        *                                                          *
        *        http://www.abo.fi/~jharriso/TPHOLs96.html         *
        ************************************************************

The 1996 International Conference on Theorem Proving in Higher Order =
Logics
will be held on 27-30 August 1996 (Tuesday to Friday) in Turku (Abo in =
Swedish)
in the South-west corner of Finland. Two tutorials are also included, =
starting
after midday on Monday 26th August.

The conference will be a venue for presentations on the following =
topics, among
others: advances in interactive theorem proving, proof automation and =
decision
procedures, applications of mechanized theorem proving, comparison =
between
different theorem proving approaches, exploiting external tools within =
theorem
provers and incorporating theorem provers into larger systems.

Previous conferences have been at Cambridge (UK), Aarhus, Davis, Leuven,
Vancouver, Malta and Salt Lake City. This conference is being organized =
by the
Turku Centre for Computer Science (TUCS) and Abo Akademi University.

  =
*************************************************************************=
***
  * The third Workshop on Designing Correct Circuits (DCC) will be held =
from *
  * Monday 2 September to Wednesday 4 September 1996 at Bastad in =
Southern   *
  * Sweden. This is an excellent opportunity for researchers from =
outside    *
  * Europe to attend both conferences.                                   =
    =
*
  =
*************************************************************************=
***

If you require any further information, please contact the organizing =
committee
on "orgcom@abo.fi", or any of the members (Joakim von Wright, Jim Grundy =
or
John Harrison) at the following address:

       Abo Akademi University
       Department of Computer Science
       Lemminkaisenkatu 14A
       20520 Turku
       FINLAND

  =
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D

                                  PROGRAMME

  The 1996 International Conference on Theorem Proving in Higher Order =
Logics

Monday 26 August

12.00   Registration

12.30   Lunch

14.00   Tutorial: Reflections on aspects of the design of Nuprl and PVS
        Paul Jackson (U. Edinburgh)

15.40   Break

16.00   Tutorial: The Coq proof assistant: principle and practice
        Christine Paulin (ENS Lyon)

18.00   Dinner

*       *       *       *       *       *       *       *

Tuesday 27 August

8.30    Late registration and breakfast

9.30    Conference opens

9.45    Session 1

        A comparison of MDG and HOL for hardware verification
        Sofiene Tahar (U. Montreal), Paul Curzon (U. Cambridge)

        Coq and hardware verification: a case study
        Solange Coupet-Grimal, Line Jakubiec (Lab. Informatique de =
Marseille)

10.55   Break

11.20   Session 2

        A mechanisation of computability theory in HOL
        Vincent Zammit (U. Kent)

        Using lattice theory in higher order logic
        Linas Laibinis (TUCS, Turku)

12.30   Lunch

14.00   Session 3

        Verification of compiler correctness for the WAM
        Cornelia Pusch (TU Munchen)

        Applying the composition principle to verify a
          micro-kernel operating system
        Heckman, Zhang, Becker, Peticolas, Levitt, Olsson (UC Davis)

15.10   Break

15.40   Session 4

        Proving liveness of fair transition systems
        Holger Busch (Siemens AG, Munchen)

        A modular coding of UNITY in Coq
        Barbara Heyd (INRIA Lorraine), Pierre Cregut (France Telecom)

18.00   Dinner, Volleyball and Sauna

*       *       *       *       *       *       *       *

Wednesday 28 August

8.30    Invited lecture: Set theory, higher order logic or both?
        Mike Gordon (U. Cambridge)

9.30    Break

9.45    Session 5

        Program derivation using the Refinement Calculator
        Michael Butler (U. Southampton), Thomas Langbacka (U. Helsinki)

        A proof tool for reasoning about functional programs
        Graham Collins (U. Glasgow)

10.55   Break

11.20   Session 6

        Function definition in higher-order logic
        Konrad Slind (TU Munchen)

        Five axioms of alpha-conversion
        Andy Gordon (U. Cambridge), Tom Melham (U. Glasgow)

12.30   Lunch

13.30   Session 7

        Implementation issues about the embedding of
          existing high level synthesis algorithms in HOL
        Dirk Eisenbiegler, Christian Blumenroehr, Ramayya Kumar =
(Karlsruhe)

        Stalmarck's algorithm as a HOL derived rule
        John Harrison (Abo Akademi)

15.00 - 22.00   Excursion

*       *       *       *       *       *       *       *

Thursday 29 August

8.30    Invited lecture: Development of the Mizar Mathematical Library
        Andrzej Trybulec (U. Warsaw, Bialystok)

9.30    Break

9.45    Session 8

        Modeling a hardware synthesis methodology in Isabelle
        David Basin, Stefan Friedrich (MPI, Saarbrucken)

        Improving the result of high-level synthesis using
          interactive transformational design
        Mats Larsson (Volvo, Goteborg)

10.55   Break

11.20   Session 9

        A comparison of HOL and ALF formalizations of a
          categorical coherence theorem
        Sten Agerholm (IFAD), Ilya Beylin (Chalmers), Peter Dybjer =
(Chalmers)

        Synthetic domain theory in type theory:
          another logic of computable functions
        Bernhard Reus (Ludwig-Maximilians Universitat, Munchen)

12.30   Lunch

14.00   Session 10

        Cryptographic protocol adequacy with HOL: the implementation
        Steven Brackin (Arca Systems, Inc)

        POSTER SESSION

            Abstracting signals: the waveform library
            Robert H. Beers, Phillip J. Windley (BYU)

            A proved type inference tool for ML:
              Damas-Milner within Coq (work in progress)
            Catherine Dubois, Valerie Menissier-Morain (U. d'evry)

            Problem solving with tactics
            Hagiya, Tanaka, Yamamoto (U. Tokyo), Nishizaki (Chiba U.)

            Deeply embedding behavioral hardware description languages
            Michael D. Jones, Trent N. Larson, Phillip J. Windley (BYU)

            Using auxiliary knowledge in automating invariant proofs
            Pertti Kellomaki (Tampere U. Technology)

            Derivation of verification rules from operational =
definitions
            Michael Norrish (U. Cambridge)

            Natural proofs versus programs optimization in the
              Calculus of Inductive Constructions
            Catherine Parent (VERIMAG, France)

            Extending a state transition system with real-time semantics
            Peticolas, Zhang, Becker, Heckman, Levitt, Olsson (UC Davis)

            A HOL model of interlocking systems
            Wai Wong (Hong Kong Baptist U.)

15.30   Break

16.00   Session 11

        A Mizar mode for HOL
        John Harrison (Abo Akademi)

        Higher-order annotated terms for proof search
        Alan Smaill, Ian Green (U. Edinburgh)

19.00   Conference dinner

*       *       *       *       *       *       *       *

Friday 30 August

8.30    Session 12

        Inference rules for programming languages with
          side effects in expressions
        Paul E. Black, Phillip J. Windley (BYU)

        Formal verification of algorithm W
        Dieter Nazareth, Tobias Nipkow (TU Munchen)

9.40    Break

10.00   Session 13

        Elements of mathematical analysis in PVS
        Bruno Dutertre (Royal Holloway, U. London)

        Importing mathematics from HOL into Nuprl
        Doug Howe (Bell Labs)

11.10   Break

11.30   Session 14

        A structure preserving encoding of Z in HOL
        Kolyang (Bremen), Thomas Santen (GMD First), Burkhart Wolff =
(Bremen)

        Translating specifications in VDM-SL to higher order logic
        Sten Agerholm (IFAD, Denmark)

12.40   Conference closes

12.50   Lunch

14.00   Administrative session

  =
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D

                                REGISTRATION

The fee for early registration, on or before Friday 21 June is FIM200. =
There
are separate fees for accommodation and meals. If, as we expect, you are
staying at the conference venue, Turun Kristillinen Opisto, the cost is =
FIM200
per person (single) or FIM150 per person (shared), per night. If you =
prefer to
stay at a central hotel, the corresponding costs will be approximately =
FIM270
and FIM150. Meals, conference banquet and refreshments for the whole
conference cost an additional FIM876 per person, or FIM705 for guests =
not
requiring refreshments during the breaks. A more detailed breakdown of =
the
costs is available on the Web at:

  http://www.abo.fi/~jharriso/cost.html

After Friday 21 June, the registration fee rises to FIM250, and after =
the end
of July, we will be unable to guarantee accommodation at the same price =
and
standard. You can register via the Web; see:

  http://www.abo.fi/~jharriso/webform.html

Alternatively, fill in the following form, and either:

 * Email it to "orgcom@abo.fi"

 * Fax it to any member of the organizing committee on +358 21 265-4732

 * Send it by mail to the organizing committee (see the address above).

By registering for TPHOLs'96 you are agreeing to pay the applicable
registration fee even if you subsequently fail attend the conference. If =
you
are unable to attend the conference then the organizing committee may =
waive the
fee if you inform us of your change of plans in a timely manner. =
However, if
you just fail to show up, we are going to want our money.


 1. Name: ________________________________________________________
    (as you would like it to appear on your name tag)

 2. Affiliation:

    ______________________________________________________________

    ______________________________________________________________

  3. Address:

    ______________________________________________________________

    ______________________________________________________________

    ______________________________________________________________

 4. Email: _______________________________________________________

 5. Fax: +________________________________________________________

 6. Phone: +______________________________________________________

 7. Arrival Day:
      [_] Friday   23 August
      [_] Saturday 24 August
      [_] Sunday   25 August
      [_] Monday   26 August
      [_] Tuesday  27 August
    Arrival Time: ________________________________________________
    Arrival Point:
      [_] Turku Airport
      [_] Turku Railway Station
      [_] Turku Bus Station
      [_] Turku Harbor, Silja Terminal
      [_] Turku Harbor, Viking Terminal
      [_] Unknown
 8. Departure Day:
      [_] Thursday 29 August
      [_] Friday   30 August
      [_] Saturday 31 August
      [_] Sunday    1 September
      [_] Monday    2 September

 9. Number of Accompanying Guests: __
      These are people not attending the conference, but for whom
      you would like meals and accommodation arranged.

10. Accommodation is available either at the conference venue,
    Turun Kristillinen Opisto, located a few kilometers from the
    centre of town; or at various centrally located hotels.  We
    expect most people will stay at Turun Kristillinen Opisto.

    Would you like to stay at:
      [_] Turun Kristillinen Opisto
            FIM200 per person, per night single.
            FIM150 per person, per night shared.
      [_] A central hotel
            FIM270 per person, per night single.
            FIM150 per person, per night shared.
      [_] I'll arrange my own accommodation thanks.

    Note that we are unable to guarantee the same prices or
    quality of accommodation for people registering after July.

11. Special Dietary Requirements: ________________________________

12. Special Access Requirements: _________________________________

13. Would you like to share a room? (other than with your guests)
      [_] no
      [_] yes
          With anyone in particular?
            [_] yes: _____________________________________________
            [_] no
                You are:
                  [_] female
                  [_] male
                You would be content to share with a:
                  [_] female
                  [_] male

14. Would you buy a TPHOLs'96 T-shirt if we made one?
      [_] yes, size [_] S [_] M [_] L [_] XL
      [_] no
    T-shirts would be sold at their cost price.

15. The conference registration fee is as follows:
      * FIM200 for early registration (Friday 21 June or earlier).
      * FIM250 for late registration (Saturday 22 June or later).
    Payable in cash (Finnish Markka only) at the Conference.

    In addition to the registration fee, there will be a fee for
    meals and accommodation (details available elsewhere).  You
    can pay for your accommodation and meals at the conference in
    cash (Finnish Markka only), or with the following credit cards
    only: Diner's Club, EuroCard, MasterCard or Visa.

    How will you be paying for your meals and accommodation?
      [_] Cash (Finnish Markka)
      [_] Diner's Club
      [_] EuroCard
      [_] MasterCard
      [_] Visa
------------- End Forwarded Message -------------


From cliff@cs.man.ac.uk  Fri Jun 21 01:51:50 1996
Return-Path: <cliff@cs.man.ac.uk>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id BAA19895; Fri, 21 Jun 1996 01:51:50 -0500
Received: from m1.cs.man.ac.uk by cli.com (SMI-8.6/SMI-SVR4)
	id BAA21956; Fri, 21 Jun 1996 01:51:47 -0500
Received: from rdf042.cs.man.ac.uk by m1.cs.man.ac.uk (4.1/SMI-4.1:AL6)
	id AA21365; Fri, 21 Jun 96 07:51:40 BST
Date: Fri, 21 Jun 96 07:51:38 BST
Message-Id: <9606210651.AA01614@rdf042.cs.man.ac.uk>
From: Cliff B Jones <cliff@cs.man.ac.uk>
To: nqthm-users@cli.com
Subject: Could this CfP be posted please?
content-length: 5429



			   FORMAL METHODS EUROPE

				   FME'97

		   International Symposium and Tutorials

			   15--19 September 1997
		 The Technical University of Graz, Austria

	  Sponsored by the Commission of the European Communities


			   Call for Submissions
			   ********************

The Technical University of Graz will host the fourth FME Symposium
from 15 to 19 September 1997. It is being organised by Formal
Methods Europe which is the advisory panel of the Commission of the
European Communities. This will be the successor of six previous VDM
and FME symposia which have been notably successful in bringing
together users, researchers and developers of precise mathematical
methods for software development.

The theme of FME'97 is Formal Methods: Their Industrial Application
and Strengthened Foundations.

Symposium contributions will report advances in the field from
developments in applicable theory to experiences in commercial
application. The conference will also follow the previous successful
pattern of offering tutorials, tools demonstrations, reports of
industry usage and research papers.

Categories of Papers: three kinds of full-length paper are solicited:

  1.  reports on industrial usage;
  2.  research papers on existing methods (for instance: extensions,
	 innovative case studies);
  3.  articles on stimulating theoretical research with clear
	 potential applicability.

Authors are requested to mention the category (1, 2, or 3) of their
papers when they submit.


TOPICS

The scope of the symposium includes, but is not limited to, the
following topics: 

   *  Practical use, case studies
   *  Comparisons of existing formal methods, extensions, improvement
   *  Theoretical foundations
   *  Tool support
   *  Specification and refinement techniques
   *  Verification against specifications
   *  Development process
   *  Linking formal and informal methods
   *  Concurrency, real-time and reactive systems
   *  Secure or/and safety-critical systems
   *  Object orientation
   *  Education and technology transfer

Submissions are encouraged from the full range of application areas
including medical systems, aerospace and avionics, telecommunication,
traffic modelling and transportation systems, nuclear safety, process
and off-shore industries.


TUTORIALS

There will be eight Tutorials, each lasting a half-day. They will be
organised in two parallel tracks during 15 and 16 September.
Proposals for tutorials are welcome.


TOOL DEMONSTRATIONS

Tool demonstrations will take place during the Symposium, with the
opportunity for presentations to be made about each tool (video
projectors will be available). Proposals for tool demonstrations are
welcome and should be made to the Organising Chair, with whom
provision of necessary computing facilities should be discussed.



CHAIRS

Organising Chair: 

Peter Lucas, IST, Technical University of Graz, A-8010 Graz, 
Muenzgrabenstrasse 11/II, Fax: +43 316 841 7566, Tel: +43 316 873 5712,
Email: lucas@ist.tu-graz.ac.at


Programme Co-Chairs: 

Cliff Jones, Dept. of Computer Science, The University of Manchester,
UK, Email: cbj@cs.man.ac.uk

John Fitzgerald, Centre for Software Reliability, The University of
Newcastle, Newcastle upon Tyne NE1 7RU, UK, Fax: +44 191 222 8788,
Tel: +44 191 222 7999, Email: John.Fitzgerald@ncl.ac.uk


Programme Committee:

Manfred Broy			Technical University, Munich
George Cleland			Harlequin
John Fitzgerald (co-Chair)	CSR, Newcastle University
Peter Froome			Adelard
Chris George			United Nations University IIST
Shinichi Honiden		Toshiba
Daniel Jackson			Carnegie-Mellon University
Cliff Jones (co-Chair)		Manchester University
Carlos Jose Pereira de Lucena	Computer Science Department
					PUC Rio de Janeiro
Doug McIlroy			Bell Laboratories
Brendan Mahony			Defence Science and Technology Organisation 
					Australia
Lynn Marshall			Northern Telecom (Nortel)
Dominique Mery			University Henri Poincare & IUF
Peter D. Mosses			BRICS, University of Aarhus
Jose Oliveira			University of Minho
Nico Plat			Cap Volmac
Andrzej Tarlecki		Warsaw University
Martyn Thomas			Praxis, Deloitte & Touche Consulting Group
Rob Witty			GEC
Joakim von Wright		Abo Akademi University



Organising Committee:

Andreas Bollin (Tools Exhibition), Brigitte Froelich, Gabriele Leitner,
Richard Messnarz, Gerhard Pail (Accounting), Petra Pichler

Local Organization: Graz Tourismus Ges.m.b.H



SUBMISSIONS

All papers and proposals for tutorials should be sent the Programme
Co-chair, John Fitzgerald, at the address given above.

Proposals for tool demonstrations should be sent to the organising
chair.

Submissions by electronic mail are not accepted.


Format of submissions:

* Full, original papers mentioning one of the three above categories
  (5 copies, 20 pages max; following the LNCS format is mandatory; a
  description of the format and Latex style files are available
  by anonymous ftp at ftp.springer.de in directory
  /pub/tex/latex/llncs or via the world-wide web in
  http://www.springer.de)

* Proposals for tutorials (1/2 day, maximum 50 pp of notes) 

* Proposals for tool demonstrations (2 pages of presentation plus
  hardware and software requirements)



Important dates: 

   * Deadline for submission: 17 January, 1997
   * Notification of acceptance sent to authors: 25 April, 1997
   * Camera-ready copy due to publisher: 20 June, 1997 (latest date of
	arrival in Newcastle)

	



From sandel@cli  Fri Jun 21 09:50:46 1996
Return-Path: <sandel@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id JAA20052; Fri, 21 Jun 1996 09:50:45 -0500
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id JAA25291; Fri, 21 Jun 1996 09:50:45 -0500
From: sandel@cli (Charles Sandel)
Received: by blanco (SMI-8.6) id JAA02332; Fri, 21 Jun 1996 09:50:44 -0500
Date: Fri, 21 Jun 1996 09:50:44 -0500
Message-Id: <199606211450.JAA02332@blanco>
Subject: Non-member submission from [Cliff B Jones <cliff@cs.man.ac.uk>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable
Content-MD5: KmmdxNJVAW9CYsiFXYmN7g==
content-length: 6071

------------- Begin Forwarded Message -------------

=46rom cliff@cs.man.ac.uk  Fri Jun 21 01:51:49 1996
Return-Path: <cliff@cs.man.ac.uk>
Received: from m1.cs.man.ac.uk by cli.com (SMI-8.6/SMI-SVR4)
	id BAA21956; Fri, 21 Jun 1996 01:51:47 -0500
Received: from rdf042.cs.man.ac.uk by m1.cs.man.ac.uk (4.1/SMI-4.1:AL6)
	id AA21365; Fri, 21 Jun 96 07:51:40 BST
Date: Fri, 21 Jun 96 07:51:38 BST
Message-Id: <9606210651.AA01614@rdf042.cs.man.ac.uk>
From: Cliff B Jones <cliff@cs.man.ac.uk>
To: nqthm-users@cli.com
Subject: Could this CfP be posted please?
content-length: 5429



			   FORMAL METHODS EUROPE

				   FME'97

		   International Symposium and Tutorials

			   15--19 September 1997
		 The Technical University of Graz, Austria

	  Sponsored by the Commission of the European Communities


			   Call for Submissions
			   ********************

The Technical University of Graz will host the fourth FME Symposium
from 15 to 19 September 1997. It is being organised by Formal
Methods Europe which is the advisory panel of the Commission of the
European Communities. This will be the successor of six previous VDM
and FME symposia which have been notably successful in bringing
together users, researchers and developers of precise mathematical
methods for software development.

The theme of FME'97 is Formal Methods: Their Industrial Application
and Strengthened Foundations.

Symposium contributions will report advances in the field from
developments in applicable theory to experiences in commercial
application. The conference will also follow the previous successful
pattern of offering tutorials, tools demonstrations, reports of
industry usage and research papers.

Categories of Papers: three kinds of full-length paper are solicited:

  1.  reports on industrial usage;
  2.  research papers on existing methods (for instance: extensions,
	 innovative case studies);
  3.  articles on stimulating theoretical research with clear
	 potential applicability.

Authors are requested to mention the category (1, 2, or 3) of their
papers when they submit.


TOPICS

The scope of the symposium includes, but is not limited to, the
following topics:=20

   *  Practical use, case studies
   *  Comparisons of existing formal methods, extensions, improvement
   *  Theoretical foundations
   *  Tool support
   *  Specification and refinement techniques
   *  Verification against specifications
   *  Development process
   *  Linking formal and informal methods
   *  Concurrency, real-time and reactive systems
   *  Secure or/and safety-critical systems
   *  Object orientation
   *  Education and technology transfer

Submissions are encouraged from the full range of application areas
including medical systems, aerospace and avionics, telecommunication,
traffic modelling and transportation systems, nuclear safety, process
and off-shore industries.


TUTORIALS

There will be eight Tutorials, each lasting a half-day. They will be
organised in two parallel tracks during 15 and 16 September.
Proposals for tutorials are welcome.


TOOL DEMONSTRATIONS

Tool demonstrations will take place during the Symposium, with the
opportunity for presentations to be made about each tool (video
projectors will be available). Proposals for tool demonstrations are
welcome and should be made to the Organising Chair, with whom
provision of necessary computing facilities should be discussed.



CHAIRS

Organising Chair:=20

Peter Lucas, IST, Technical University of Graz, A-8010 Graz,=20
Muenzgrabenstrasse 11/II, Fax: +43 316 841 7566, Tel: +43 316 873 5712,
Email: lucas@ist.tu-graz.ac.at


Programme Co-Chairs:=20

Cliff Jones, Dept. of Computer Science, The University of Manchester,
UK, Email: cbj@cs.man.ac.uk

John Fitzgerald, Centre for Software Reliability, The University of
Newcastle, Newcastle upon Tyne NE1 7RU, UK, Fax: +44 191 222 8788,
Tel: +44 191 222 7999, Email: John.Fitzgerald@ncl.ac.uk


Programme Committee:

Manfred Broy			Technical University, Munich
George Cleland			Harlequin
John Fitzgerald (co-Chair)	CSR, Newcastle University
Peter Froome			Adelard
Chris George			United Nations University IIST
Shinichi Honiden		Toshiba
Daniel Jackson			Carnegie-Mellon University
Cliff Jones (co-Chair)		Manchester University
Carlos Jose Pereira de Lucena	Computer Science Department
					PUC Rio de Janeiro
Doug McIlroy			Bell Laboratories
Brendan Mahony			Defence Science and Technology Organisation=20
					Australia
Lynn Marshall			Northern Telecom (Nortel)
Dominique Mery			University Henri Poincare & IUF
Peter D. Mosses			BRICS, University of Aarhus
Jose Oliveira			University of Minho
Nico Plat			Cap Volmac
Andrzej Tarlecki		Warsaw University
Martyn Thomas			Praxis, Deloitte & Touche Consulting Group
Rob Witty			GEC
Joakim von Wright		Abo Akademi University



Organising Committee:

Andreas Bollin (Tools Exhibition), Brigitte Froelich, Gabriele Leitner,
Richard Messnarz, Gerhard Pail (Accounting), Petra Pichler

Local Organization: Graz Tourismus Ges.m.b.H



SUBMISSIONS

All papers and proposals for tutorials should be sent the Programme
Co-chair, John Fitzgerald, at the address given above.

Proposals for tool demonstrations should be sent to the organising
chair.

Submissions by electronic mail are not accepted.


Format of submissions:

* Full, original papers mentioning one of the three above categories
  (5 copies, 20 pages max; following the LNCS format is mandatory; a
  description of the format and Latex style files are available
  by anonymous ftp at ftp.springer.de in directory
  /pub/tex/latex/llncs or via the world-wide web in
  http://www.springer.de)

* Proposals for tutorials (1/2 day, maximum 50 pp of notes)=20

* Proposals for tool demonstrations (2 pages of presentation plus
  hardware and software requirements)



Important dates:=20

   * Deadline for submission: 17 January, 1997
   * Notification of acceptance sent to authors: 25 April, 1997
   * Camera-ready copy due to publisher: 20 June, 1997 (latest date of
	arrival in Newcastle)

=09


------------- End Forwarded Message -------------


From owner-nqthm-users@cli  Fri Jun 21 11:36:56 1996
Return-Path: <owner-nqthm-users@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id LAA20080; Fri, 21 Jun 1996 11:36:56 -0500
Received: by cli.com (SMI-8.6/SMI-SVR4)
	id JAA25297; Fri, 21 Jun 1996 09:50:48 -0500
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id JAA25291; Fri, 21 Jun 1996 09:50:45 -0500
From: sandel@cli (Charles Sandel)
Received: by blanco (SMI-8.6) id JAA02332; Fri, 21 Jun 1996 09:50:44 -0500
Date: Fri, 21 Jun 1996 09:50:44 -0500
Message-Id: <199606211450.JAA02332@blanco>
Subject: Non-member submission from [Cliff B Jones <cliff@cs.man.ac.uk>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable
Content-MD5: KmmdxNJVAW9CYsiFXYmN7g==
Sender: owner-nqthm-users@cli
Precedence: bulk
content-length: 6071

------------- Begin Forwarded Message -------------

=46rom cliff@cs.man.ac.uk  Fri Jun 21 01:51:49 1996
Return-Path: <cliff@cs.man.ac.uk>
Received: from m1.cs.man.ac.uk by cli.com (SMI-8.6/SMI-SVR4)
	id BAA21956; Fri, 21 Jun 1996 01:51:47 -0500
Received: from rdf042.cs.man.ac.uk by m1.cs.man.ac.uk (4.1/SMI-4.1:AL6)
	id AA21365; Fri, 21 Jun 96 07:51:40 BST
Date: Fri, 21 Jun 96 07:51:38 BST
Message-Id: <9606210651.AA01614@rdf042.cs.man.ac.uk>
From: Cliff B Jones <cliff@cs.man.ac.uk>
To: nqthm-users@cli.com
Subject: Could this CfP be posted please?
content-length: 5429



			   FORMAL METHODS EUROPE

				   FME'97

		   International Symposium and Tutorials

			   15--19 September 1997
		 The Technical University of Graz, Austria

	  Sponsored by the Commission of the European Communities


			   Call for Submissions
			   ********************

The Technical University of Graz will host the fourth FME Symposium
from 15 to 19 September 1997. It is being organised by Formal
Methods Europe which is the advisory panel of the Commission of the
European Communities. This will be the successor of six previous VDM
and FME symposia which have been notably successful in bringing
together users, researchers and developers of precise mathematical
methods for software development.

The theme of FME'97 is Formal Methods: Their Industrial Application
and Strengthened Foundations.

Symposium contributions will report advances in the field from
developments in applicable theory to experiences in commercial
application. The conference will also follow the previous successful
pattern of offering tutorials, tools demonstrations, reports of
industry usage and research papers.

Categories of Papers: three kinds of full-length paper are solicited:

  1.  reports on industrial usage;
  2.  research papers on existing methods (for instance: extensions,
	 innovative case studies);
  3.  articles on stimulating theoretical research with clear
	 potential applicability.

Authors are requested to mention the category (1, 2, or 3) of their
papers when they submit.


TOPICS

The scope of the symposium includes, but is not limited to, the
following topics:=20

   *  Practical use, case studies
   *  Comparisons of existing formal methods, extensions, improvement
   *  Theoretical foundations
   *  Tool support
   *  Specification and refinement techniques
   *  Verification against specifications
   *  Development process
   *  Linking formal and informal methods
   *  Concurrency, real-time and reactive systems
   *  Secure or/and safety-critical systems
   *  Object orientation
   *  Education and technology transfer

Submissions are encouraged from the full range of application areas
including medical systems, aerospace and avionics, telecommunication,
traffic modelling and transportation systems, nuclear safety, process
and off-shore industries.


TUTORIALS

There will be eight Tutorials, each lasting a half-day. They will be
organised in two parallel tracks during 15 and 16 September.
Proposals for tutorials are welcome.


TOOL DEMONSTRATIONS

Tool demonstrations will take place during the Symposium, with the
opportunity for presentations to be made about each tool (video
projectors will be available). Proposals for tool demonstrations are
welcome and should be made to the Organising Chair, with whom
provision of necessary computing facilities should be discussed.



CHAIRS

Organising Chair:=20

Peter Lucas, IST, Technical University of Graz, A-8010 Graz,=20
Muenzgrabenstrasse 11/II, Fax: +43 316 841 7566, Tel: +43 316 873 5712,
Email: lucas@ist.tu-graz.ac.at


Programme Co-Chairs:=20

Cliff Jones, Dept. of Computer Science, The University of Manchester,
UK, Email: cbj@cs.man.ac.uk

John Fitzgerald, Centre for Software Reliability, The University of
Newcastle, Newcastle upon Tyne NE1 7RU, UK, Fax: +44 191 222 8788,
Tel: +44 191 222 7999, Email: John.Fitzgerald@ncl.ac.uk


Programme Committee:

Manfred Broy			Technical University, Munich
George Cleland			Harlequin
John Fitzgerald (co-Chair)	CSR, Newcastle University
Peter Froome			Adelard
Chris George			United Nations University IIST
Shinichi Honiden		Toshiba
Daniel Jackson			Carnegie-Mellon University
Cliff Jones (co-Chair)		Manchester University
Carlos Jose Pereira de Lucena	Computer Science Department
					PUC Rio de Janeiro
Doug McIlroy			Bell Laboratories
Brendan Mahony			Defence Science and Technology Organisation=20
					Australia
Lynn Marshall			Northern Telecom (Nortel)
Dominique Mery			University Henri Poincare & IUF
Peter D. Mosses			BRICS, University of Aarhus
Jose Oliveira			University of Minho
Nico Plat			Cap Volmac
Andrzej Tarlecki		Warsaw University
Martyn Thomas			Praxis, Deloitte & Touche Consulting Group
Rob Witty			GEC
Joakim von Wright		Abo Akademi University



Organising Committee:

Andreas Bollin (Tools Exhibition), Brigitte Froelich, Gabriele Leitner,
Richard Messnarz, Gerhard Pail (Accounting), Petra Pichler

Local Organization: Graz Tourismus Ges.m.b.H



SUBMISSIONS

All papers and proposals for tutorials should be sent the Programme
Co-chair, John Fitzgerald, at the address given above.

Proposals for tool demonstrations should be sent to the organising
chair.

Submissions by electronic mail are not accepted.


Format of submissions:

* Full, original papers mentioning one of the three above categories
  (5 copies, 20 pages max; following the LNCS format is mandatory; a
  description of the format and Latex style files are available
  by anonymous ftp at ftp.springer.de in directory
  /pub/tex/latex/llncs or via the world-wide web in
  http://www.springer.de)

* Proposals for tutorials (1/2 day, maximum 50 pp of notes)=20

* Proposals for tool demonstrations (2 pages of presentation plus
  hardware and software requirements)



Important dates:=20

   * Deadline for submission: 17 January, 1997
   * Notification of acceptance sent to authors: 25 April, 1997
   * Camera-ready copy due to publisher: 20 June, 1997 (latest date of
	arrival in Newcastle)

=09


------------- End Forwarded Message -------------


From boyer@cli  Sat Jun 22 13:40:27 1996
Return-Path: <boyer@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id NAA21266; Sat, 22 Jun 1996 13:40:27 -0500
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id NAA13077; Sat, 22 Jun 1996 13:40:26 -0500
Received: by blanco (SMI-8.6) id NAA10494; Sat, 22 Jun 1996 13:40:25 -0500
Date: Sat, 22 Jun 1996 13:40:25 -0500
Message-Id: <199606221840.NAA10494@blanco>
From: "Robert S. Boyer" <boyer@cli.com>
To: nqthm-users@cli
Subject: Paper published
content-length: 220

The following article has only recently appeared:

  Robert S. Boyer and Yuan Yu, Automated Proofs of Object Code for a
  Widely Used Microprocessor, Journal of the ACM, Vol. 43, No. 1,
  January 1996, pp. 166-192.

Bob

From sandel@cli  Sat Jun 22 13:45:50 1996
Return-Path: <sandel@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id NAA21278; Sat, 22 Jun 1996 13:45:49 -0500
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id NAA13102; Sat, 22 Jun 1996 13:45:48 -0500
From: sandel@cli (Charles Sandel)
Received: by blanco (SMI-8.6) id NAA10579; Sat, 22 Jun 1996 13:45:47 -0500
Date: Sat, 22 Jun 1996 13:45:47 -0500
Message-Id: <199606221845.NAA10579@blanco>
Subject: Submission from ["Robert S. Boyer" <boyer@cli.com>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable
Content-MD5: IG5+SOuJ3xbHxST34sAc6A==
content-length: 742

------------- Begin Forwarded Message -------------

=46rom boyer  Sat Jun 22 13:40:27 1996
Return-Path: <boyer>
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id NAA13077; Sat, 22 Jun 1996 13:40:26 -0500
Received: by blanco (SMI-8.6) id NAA10494; Sat, 22 Jun 1996 13:40:25 =
-0500
Date: Sat, 22 Jun 1996 13:40:25 -0500
Message-Id: <199606221840.NAA10494@blanco>
From: "Robert S. Boyer" <boyer@cli.com>
To: nqthm-users
Subject: Paper published
content-length: 220

The following article has only recently appeared:

  Robert S. Boyer and Yuan Yu, Automated Proofs of Object Code for a
  Widely Used Microprocessor, Journal of the ACM, Vol. 43, No. 1,
  January 1996, pp. 166-192.

Bob
------------- End Forwarded Message -------------


From owner-nqthm-users@cli  Sat Jun 22 15:43:09 1996
Return-Path: <owner-nqthm-users@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id PAA21310; Sat, 22 Jun 1996 15:43:08 -0500
Received: by cli.com (SMI-8.6/SMI-SVR4)
	id NAA13108; Sat, 22 Jun 1996 13:45:52 -0500
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id NAA13102; Sat, 22 Jun 1996 13:45:48 -0500
From: sandel@cli (Charles Sandel)
Received: by blanco (SMI-8.6) id NAA10579; Sat, 22 Jun 1996 13:45:47 -0500
Date: Sat, 22 Jun 1996 13:45:47 -0500
Message-Id: <199606221845.NAA10579@blanco>
Subject: Submission from ["Robert S. Boyer" <boyer@cli.com>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable
Content-MD5: IG5+SOuJ3xbHxST34sAc6A==
Sender: owner-nqthm-users@cli
Precedence: bulk
content-length: 742

------------- Begin Forwarded Message -------------

=46rom boyer  Sat Jun 22 13:40:27 1996
Return-Path: <boyer>
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id NAA13077; Sat, 22 Jun 1996 13:40:26 -0500
Received: by blanco (SMI-8.6) id NAA10494; Sat, 22 Jun 1996 13:40:25 =
-0500
Date: Sat, 22 Jun 1996 13:40:25 -0500
Message-Id: <199606221840.NAA10494@blanco>
From: "Robert S. Boyer" <boyer@cli.com>
To: nqthm-users
Subject: Paper published
content-length: 220

The following article has only recently appeared:

  Robert S. Boyer and Yuan Yu, Automated Proofs of Object Code for a
  Widely Used Microprocessor, Journal of the ACM, Vol. 43, No. 1,
  January 1996, pp. 166-192.

Bob
------------- End Forwarded Message -------------


From tommasi@lifl.fr  Wed Jun 26 02:30:29 1996
Return-Path: <tommasi@lifl.fr>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id CAA23529; Wed, 26 Jun 1996 02:30:29 -0500
Received: from lifl.lifl.fr by cli.com (SMI-8.6/SMI-SVR4)
	id CAA09074; Wed, 26 Jun 1996 02:30:27 -0500
Received: from messina.lifl.fr by lifl.lifl.fr, Wed, 26 Jun 1996 09:29:04 +0200
Received: by messina.lifl.fr, Wed, 26 Jun 1996 09:02:17 +0100
Date: Wed, 26 Jun 1996 09:02:17 +0100
From: Marc.Tommasi@lifl.fr
Message-Id: <199606260802.JAA11422@messina.lifl.fr>
To: nqthm-users@cli.com
Subject: TAPSOFT 97 : Call for Paper
content-length: 7859


Please find enclosed the call for papers for TAPSOFT '97.  This call and
other information on TAPSOFT '97 is also accessible by WWW at
http://www.lifl.fr/tapsoft97.
I sincerely apologize if you receive more than one copy of this
message.

##########################################################################
                     TAPSOFT'97 -- CALL FOR PAPERS

                   April 14-18, 1997 -- Lille, FRANCE 


                 DEADLINE FOR SUBMISSIONS : 13 Oct 1996


TAPSOFT'97 is the Seventh International Joint Conference on the Theory and
Practice of Software Development. The TAPSOFT series was started in Berlin in 
1985, on the initiative of Hartmut Ehrig and Christiane Floyd (among others).
Since then it has been held  biennially, in Pisa, Barcelona, Brighton, Orsay 
and Aarhus. The overall aim of TAPSOFT was formulated as:

 to bring together theoretical computer scientists and software
 engineers (researchers and practitioners) with a view to    
 discussing how formal methods can usefully be applied in software
 development.  

TAPSOFT is traditionally composed of CAAP -- Colloquium on Trees in Algebra 
and Programming, and FASE -- Colloquium on Formal Approaches in Software
Engineering.
In recognition of the importance of support tools for practical use of
formal approaches, TAPSOFT'97 will also have (at least) a session where TOOLS 
are demonstrated.

The five first editions of CAAP were held in Lille, from 1976 to 1980.
CAAP'97 will be the last one thus it comes back to Lille. In 1998, a new joint 
conference, ETAPS (European joint conferences on Theory and Practice of 
Software) will be held yearly in Spring. It is the successor of TAPSOFT and 
CAAP-ESOP-CC.


----------------------------------- CAAP ------------------------------------ 

Programme Committee:

S. Abramsky (UK)
A. Arnold (France) 
G. Ausiello (Italy) 
C. Boehm (Italy)    
M. Dauchet (chair, France) 
J. Diaz (Spain)
H. Ehrig (Germany)  
P. Franchi Zannettacci (France)  
J.-P. Jouannaud (France)
H. Kirchner (France)
U. Montanari (Italy) 
M. Nielsen (Denmark)
M. Nivat (France)
J.-F. Perrot (France)
J.-C. Raoult (France)  
S. Tison (France)

This colloquium series was originally devoted to the algebraic and
combinatorial properties of trees, and their role in various fields of
Computer Science. Now the scope of CAAP has been extended to other discrete
data structures and CAAP'97 will cover

  algebraic, logical and combinatorial properties of discrete structures
  and their applications to Computer Science.

Contributions on the following topics are especially welcome:

-- properties of discrete structures,
-- the theory of formal languages, 
-- syntax and semantics of programming languages,
-- algorithms and data-structures,
-- logic and formal verification,
-- theoretical problems arising in software development.

--------------------------------- FASE --------------------------------------

Programme Committee:

E. Astesiano (Italy)
D. Basin (Germany)
M. Bidoit (chair, France)
E. Brinskma (The Netherlands)
L. Cardelli (USA)               
A. Finkel (France)
J. Fitzgerald (UK)
P.G. Larsen (Denmark)
T. Henzinger (USA)
P. Klint (The Netherlands)
P. Mosses (Denmark)
F. Orejas (Spain)
D. Sannella (UK)
B. Steffen (Germany)
M. Wirsing (Germany)  


This colloquium aims at being a forum where different formal approaches to
problems of software specification, development, and verification
are presented, compared, and discussed. Contributions on the following
topics are especially welcome:

-- formal concepts for software development,
-- software development using formal methods,
-- formal approaches for real-time and distributed systems,
-- provably correct software and verification methods,
-- reports on case studies of applications of formal methods,
-- programming languages and type systems,
-- tools and environments supporting formal approaches -- possibly in 
   conjunction with demonstrations.

--------------------------- INVITED SPEAKERS --------------------------------

                          E. Astesiano    (Italy)
                          J.-P. Jouannaud (France)
                          T. Maibaum      (UK)
                          P. Mosses       (Denmark)
                          W. Thomas       (Germany)
                          F. Vaandrager   (The Netherlands)

------------------------ SUBMISSION TO TAPSOFT'97 ---------------------------


- Papers: 
  ------

Prospective authors are invited to submit
          => five copies of a full draft paper, 
      and => an electronic copy by e-mail 
             (plain text or uuencoded gziped PostScript), 
      and => an abstract by e-mail.

The final paper should be no more than 15 pages in the Springer-Verlag format 
for Lecture Notes in Computer Science (the series in which the Proceedings of 
TAPSOFT'97 should be published); see the back cover of a recent volume for 
details. Submissions need not adhere to that format, but those that are clearly 
too long will be rejected immediately. 

Papers must be unpublished and not submitted for publication elsewhere.  
Papers that attempt to establish links between different approaches and/or 
include expository or survey material, as well as presenting original results,  will be welcomed.

- Tools: 
  -----

Demonstrations of tools supporting formal approaches to software development are  welcome. Proposers of demonstrations should submit
          => five copies of a brief description of the tools, making clear 
             the relevance to TAPSOFT (about four  pages), and an electronic 
             copy by e-mail (plain text or uuencoded gziped PostScript). 
             The final abstract of tool demonstrations should be no more than 
             4 pages in the Springer-Verlag format. 
          => The hardware and software requirements for installing and
             demonstrating the tools should be specified on a separate page.


---------------------------------- DATES -----------------------------------            

           13 Oct 1996    => Deadline for receipt of submissions 
            9 Dec 1996    => Notification of acceptance 
           15 Jan 1997    => Final paper due 
        14-18 Apr 1997    => Presentation at conference

Papers arriving late may be rejected immediately, without refereeing. The
receipt of all submitted papers will be acknowledged.

The address for submissions to CAAP is 

                        Max Dauchet (CAAP) 
                        Universite de Lille I 
                        LIFL -- Bat. M3 
                        59 655 VILLENEUVE D'ASCQ Cedex, FRANCE 
                        fax: (+33) 03 20 43 65 66 
                        email: submitcaap@lifl.fr

The address for submissions to FASE and Tools is:

                        Michel Bidoit (FASE) 
                        LIENS, Ecole Normale Superieure
                        45, rue d'Ulm 
                        75230 PARIS Cedex 05, FRANCE
                        fax: (+33) 01 44 32 20 80 
                        email: fase97@ens.fr 

----------------------------- SATELLITE MEETINGS ---------------------------

Facilities will be provided for holding short specialized workshops and
other meetings in conjunction with TAPSOFT'97. Please contact the TAPSOFT
organisers as soon as possible, if interested.


--------------------------- Additional informations -------------------------

  http://www.lifl.fr/tapsoft97/

  ftp://ftp.lifl.fr/pub/tapsoft97

  Anne-Cecile.Caron@univ-lille1.fr

TAPSOFT Steering Committee: 
--------------------------
A. Arnold, P. Degano, H. Ehrig, M.-C. Gaudel, T. Maibaum, U. Montanari, 
P.D. Mosses, M. Nivat, F. Orejas.

TAPSOFT'97 Organising Committee:
------------------------------- 
A.C. Caron (chair), Y. Andre, F. Bossut, J.L. Coquide, M. Dauchet, 
R. Gilleron, S. Tison, M. Tommasi.




From plaisted@cs.unc.edu  Tue Jul  2 12:41:10 1996
Return-Path: <plaisted@cs.unc.edu>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id MAA28347; Tue, 2 Jul 1996 12:41:10 -0500
Received: from mcenroe.cs.unc.edu by cli.com (SMI-8.6/SMI-SVR4)
	id MAA03022; Tue, 2 Jul 1996 12:41:05 -0500
Received: from plaisted.cs.unc.edu by mcenroe.cs.unc.edu (8.6.10/UNC_06_21_94)
	id NAA08311; Tue, 2 Jul 1996 13:40:58 -0400
From: David Plaisted <plaisted@cs.unc.edu>
Received: by plaisted.cs.unc.edu (8.6.10/UNC_06_21_94)
	id NAA01380; Tue, 2 Jul 1996 13:40:56 -0400
Date: Tue, 2 Jul 1996 13:40:56 -0400
Message-Id: <199607021740.NAA01380@plaisted.cs.unc.edu>
To: nqthm-users@cli.com
Subject: RTA97 Preliminary Call for Papers
content-length: 3557



				RTA-97
		     Preliminary Call for Papers

 [We apologize if you receive multiple copies of this announcement.]


Eighth International Conference on                     June 2--4, 1997
Rewriting Techniques and Applications          Sitges,Barcelona, Spain

	       This information is also available under
		 http://www.lri.fr/~rta97/rta97.html


The eighth Conference on Rewriting Techniques and Applications
solicits original papers in any of the following or related areas:


 Term rewriting systems                   Symbolic and algebraic computation
 Constrained rewriting and deduction      Equational programming languages
 String and graph rewriting               Completion techniques
 Rewrite-based theorem proving            Unification and matching algorithms
 Conditional and typed rewriting          Constraint solving
 Higher-order rewriting                   Lambda calculi 
 Parallel/distributed rewriting and deduction

   
In addition to full research papers, descriptions of new working
systems (4 proceedings pages) and problem sets that provide realistic,
interesting challenges in the field of rewriting techniques are also
welcome.  High quality papers on new applications of rewriting
techniques are particularly encouraged.  Submissions must reach the
program chair, at the address below, no later than

			   November 6, 1996

Notification of acceptance or rejection will be made by January 13,
1997.  Camera-ready copy (following special guidelines for Springer
Lecture Notes) will be due by March 7, 1997.


RTA-97 Program Chair:
---------------------
    Hubert Comon, RTA-97                      telephone:  +33 01 69 41 66 35 
    LRI and CNRS,
    B\^at. 490,  Universit\'e Paris-Sud             fax: +33 01 69 41 65 86
    91405 Orsay cedex, France                     email:   rta97@lri.fr     


RTA-97 Program Committee:
-------------------------
F. Baader (Aachen)           H. Comon (Orsay)         M. Fernandez (Paris)
H. Ganzinger (Saarbr\"ucken) M. Jantzen (Hamburg)     H. Kirchner (Nancy)  
A. Middeldorp (Tsukuba)      P. Narendran (Albany)    R. Nieuwenhuis(Barcelona)
T. Nipkow (M\"unchen)        V. Tannen (Philadelphia) S. Tison (Lille)


RTA Organizing Committee:
-------------------------
Ronald Book (Santa Barbara)                    Jieh Hsiang (Taipei) 
Claude Kirchner (Nancy, chair)                 Klaus Madlener (Kaiserslautern) 
David Plaisted (Chapel Hill,publicity chair))  Mitsuhiro Okada (Tokyo)


Local Arrangements Chair:
-------------------------
    Robert Nieuwenhuis,                 Universitat Polit\`ecnica de Catalunya 
    Pau Gargallo 5, 
    E-08028 Barcelona, Spain            email: roberto@lsi.upc.es


Paper Submission Guidelines:
----------------------------
Submissions must be unpublished, not submitted for publication
elsewhere and should fall into one of the three categories: regular
research papers (at most 15 pages), system descriptions (4 pages) or
problem sets.  All submissions must be sent electronically in
postscript form to the program chair (if not possible, six hard copies
may be sent).  The title page should include the submission category,
the author's name, address, and phone number, as well as electronic
address and fax number, if available.  Papers that are late, too long
or require major revision will be rejected.  Using Springer LNCS style
files is strongly recommended. Proofs of theorems should be provided
in the paper, or, if space does not permit, should be made accessible
otherwise (e.g., as an appendix to the submission).







From owner-nqthm-users@cli  Tue Jul  2 14:12:16 1996
Return-Path: <owner-nqthm-users@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id OAA28392; Tue, 2 Jul 1996 14:12:15 -0500
Received: by cli.com (SMI-8.6/SMI-SVR4)
	id MAA03028; Tue, 2 Jul 1996 12:41:12 -0500
Received: from mcenroe.cs.unc.edu by cli.com (SMI-8.6/SMI-SVR4)
	id MAA03022; Tue, 2 Jul 1996 12:41:05 -0500
Received: from plaisted.cs.unc.edu by mcenroe.cs.unc.edu (8.6.10/UNC_06_21_94)
	id NAA08311; Tue, 2 Jul 1996 13:40:58 -0400
From: David Plaisted <plaisted@cs.unc.edu>
Received: by plaisted.cs.unc.edu (8.6.10/UNC_06_21_94)
	id NAA01380; Tue, 2 Jul 1996 13:40:56 -0400
Date: Tue, 2 Jul 1996 13:40:56 -0400
Message-Id: <199607021740.NAA01380@plaisted.cs.unc.edu>
To: nqthm-users@cli.com
Subject: RTA97 Preliminary Call for Papers
Sender: owner-nqthm-users@cli
Precedence: bulk
content-length: 3557



				RTA-97
		     Preliminary Call for Papers

 [We apologize if you receive multiple copies of this announcement.]


Eighth International Conference on                     June 2--4, 1997
Rewriting Techniques and Applications          Sitges,Barcelona, Spain

	       This information is also available under
		 http://www.lri.fr/~rta97/rta97.html


The eighth Conference on Rewriting Techniques and Applications
solicits original papers in any of the following or related areas:


 Term rewriting systems                   Symbolic and algebraic computation
 Constrained rewriting and deduction      Equational programming languages
 String and graph rewriting               Completion techniques
 Rewrite-based theorem proving            Unification and matching algorithms
 Conditional and typed rewriting          Constraint solving
 Higher-order rewriting                   Lambda calculi 
 Parallel/distributed rewriting and deduction

   
In addition to full research papers, descriptions of new working
systems (4 proceedings pages) and problem sets that provide realistic,
interesting challenges in the field of rewriting techniques are also
welcome.  High quality papers on new applications of rewriting
techniques are particularly encouraged.  Submissions must reach the
program chair, at the address below, no later than

			   November 6, 1996

Notification of acceptance or rejection will be made by January 13,
1997.  Camera-ready copy (following special guidelines for Springer
Lecture Notes) will be due by March 7, 1997.


RTA-97 Program Chair:
---------------------
    Hubert Comon, RTA-97                      telephone:  +33 01 69 41 66 35 
    LRI and CNRS,
    B\^at. 490,  Universit\'e Paris-Sud             fax: +33 01 69 41 65 86
    91405 Orsay cedex, France                     email:   rta97@lri.fr     


RTA-97 Program Committee:
-------------------------
F. Baader (Aachen)           H. Comon (Orsay)         M. Fernandez (Paris)
H. Ganzinger (Saarbr\"ucken) M. Jantzen (Hamburg)     H. Kirchner (Nancy)  
A. Middeldorp (Tsukuba)      P. Narendran (Albany)    R. Nieuwenhuis(Barcelona)
T. Nipkow (M\"unchen)        V. Tannen (Philadelphia) S. Tison (Lille)


RTA Organizing Committee:
-------------------------
Ronald Book (Santa Barbara)                    Jieh Hsiang (Taipei) 
Claude Kirchner (Nancy, chair)                 Klaus Madlener (Kaiserslautern) 
David Plaisted (Chapel Hill,publicity chair))  Mitsuhiro Okada (Tokyo)


Local Arrangements Chair:
-------------------------
    Robert Nieuwenhuis,                 Universitat Polit\`ecnica de Catalunya 
    Pau Gargallo 5, 
    E-08028 Barcelona, Spain            email: roberto@lsi.upc.es


Paper Submission Guidelines:
----------------------------
Submissions must be unpublished, not submitted for publication
elsewhere and should fall into one of the three categories: regular
research papers (at most 15 pages), system descriptions (4 pages) or
problem sets.  All submissions must be sent electronically in
postscript form to the program chair (if not possible, six hard copies
may be sent).  The title page should include the submission category,
the author's name, address, and phone number, as well as electronic
address and fax number, if available.  Papers that are late, too long
or require major revision will be rejected.  Using Springer LNCS style
files is strongly recommended. Proofs of theorems should be provided
in the paper, or, if space does not permit, should be made accessible
otherwise (e.g., as an appendix to the submission).







From Hakim.Bouamama@imag.fr  Sat Jul  6 05:35:45 1996
Return-Path: <Hakim.Bouamama@imag.fr>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id FAA01257; Sat, 6 Jul 1996 05:35:44 -0500
Received: from ujf.ujf-grenoble.fr by cli.com (SMI-8.6/SMI-SVR4)
	id FAA19995; Sat, 6 Jul 1996 05:35:43 -0500
Received: from aguamarina.ujf-grenoble.fr (aguamarina.ujf-grenoble.fr [193.54.240.194]) by ujf.ujf-grenoble.fr (8.6.13-durand/8.6.9) with ESMTP id MAA00670 for <nqthm-users@cli.com>; Sat, 6 Jul 1996 12:35:41 +0200
Received: from ametista.ujf-grenoble.fr (ametista.ujf-grenoble.fr [193.54.240.195]) by aguamarina.ujf-grenoble.fr (8.6.11/8.6.9) with ESMTP id MAA00680 for <nqthm-users@cli.com>; Sat, 6 Jul 1996 12:34:57 +0200
Received: from ametista (localhost.ujf-grenoble.fr [127.0.0.1]) by ametista.ujf-grenoble.fr (8.6.11/8.6.9) with SMTP id MAA00772 for <nqthm-users@cli.com>; Sat, 6 Jul 1996 12:35:35 +0200
Sender: bouamama@aguamarina.ujf-grenoble.fr
Message-ID: <31DE4177.446B9B3D@imag.fr>
Date: Sat, 06 Jul 1996 12:35:35 +0200
From: Hakim Bouamama <Hakim.Bouamama@imag.fr>
X-Mailer: Mozilla 2.02 (X11; I; SunOS 4.1.3_U1 sun4m)
MIME-Version: 1.0
To: nqthm-users@cli.com
Subject: test
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
content-length: 383

Sorry,
It's just a test
-- 
------------------------------------------------------------------------
Hakim BOUAMAMA 
TIMA, batiment C d'Informatique, BP 53X, 38041 Grenoble Cedex 9, France
Tel : (33) 76.63.58.78        Fax :  +33 76 44 04 54       
Bureau C208                   Email : Hakim.Bouamama@imag.fr
------------------------------------------------------------------------

From M.Kerber@cs.bham.ac.uk  Wed Jul 10 09:42:57 1996
Return-Path: <M.Kerber@cs.bham.ac.uk>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id JAA26065; Wed, 10 Jul 1996 09:02:02 -0500
Received: from percy.cs.bham.ac.uk by cli.com (SMI-8.6/SMI-SVR4)
	id JAA17950; Wed, 10 Jul 1996 09:01:57 -0500
Message-Id: <199607101401.JAA17950@cli.com>
Received: from wallace by percy.cs.bham.ac.uk with SMTP (PP) 
          id <24065-0@percy.cs.bham.ac.uk>; Wed, 10 Jul 1996 14:58:40 +0100
To: nqthm-users@cli.com
cc: M.Kerber@cs.bham.ac.uk
Subject: Call for Participation, CADE-WS on Partial Functions
Date: Wed, 10 Jul 1996 14:58:37 +0100
From: Manfred Kerber <M.Kerber@cs.bham.ac.uk>
content-length: 3136

                      Updated Call for Participation 

                            CADE-13 Workshop on 

                  Mechanization of Partial Functions 

          30 July 1996 Rutgers University, New Brunswick, NJ, USA 

Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of
partial functions. There is a rich variety of approaches for dealing
with partial functions and the undefined expressions that often result
from their application. Ranging from workarounds for concrete
situations to proper general treatments, these approaches have their
own advantages and disadvantages. For example, some can be used in
standard logical formalisms, while others require new formalisms. The
purpose of the workshop is to discuss the different approaches and to
compare their advantages and disadvantages.

Potential participants can apply by submitting a short statement that
contains a description of their current interests by e-mail to Manfred
Kerber at M.Kerber@cs.bham.ac.uk. Those invited to attend the workshop
have to register for the workshop in conjunction with the CADE main
conference.

Further information, in particular pointers to the general information
about CADE and FLoC as well as to PostScript versions of the presented
contributions, can be found by www:
http://www.cs.bham.ac.uk/~mmk/cade96-partiality/

Organizers: 
    William Farmer, The MITRE Corporation, USA, farmer@mitre.org 
    Manfred Kerber, The University of Birmingham, UK, M.Kerber@cs.bham.ac.uk 
    Michael Kohlhase, Uni des Saarlandes, Germany, kohlhase@cs.uni-sb.de 

The workshop schedule is:
 9:00- 9:05  Opening Remarks
 9:05-10:15  Invited Address
             R. Constable 
             "Reasoning about Partial Functions in Type Theory" 
10:15-10:30  Break
10:30-12:15  Session I
             C. Jones, "TANSTAAFL (with partial functions)"
             J. Giesl, "Proving partial correctness of partial functions"
             O. Mueller*, K. Slind, "Isabelle/HOL as a Platform for Partiality"
             R. Gumb*, K. Lambert, "A free logical foundation for nonstrict functions"
             M. Kerber*, M. Kohlhase, "Partiality without the cost"
             Discussion
12:15-13:45  Lunch Break
13:45-15:00  Session II
             W. Maurer, "The use of partial functions in proving
                         that a program does not crash"
             A. Yakhnis, V. Yakhnis*, V. Winter, "Software with Partial Functions: 
                         Automating Correctness Proofs via Nonstrict Explicit Domains"
             J. Avenhaus*, K. Madlener, "Partial Functions in Clausal Specifications"
             Discussion
15:00-15:15  Break
15:15-16:30  Session III
             R. Arthan, "Undefinedness in Z: Issues for specification and proof"
             W. Farmer, "Mechanizing the traditional approach to partial functions"
             E. Gunter, "Partial functions as total functions"
             Discussion
16:30-17:00  Panel Discussion on Approaches
             Panel members: R. Arthan, R. Constable, W. Farmer, C. Jones, M. Kohlhase
* Presenter

From sandel@cli  Wed Jul 10 10:42:57 1996
Return-Path: <sandel@cli>
Received: from cli.com by ftp.cli.com. (SMI-8.6/SMI-SVR4)
	id KAA27236; Wed, 10 Jul 1996 10:15:36 -0500
Received: from blanco by cli.com (SMI-8.6/SMI-SVR4)
	id KAA18098; Wed, 10 Jul 1996 10:15:33 -0500
From: sandel@cli (Charles Sandel)
Received: by blanco (SMI-8.6) id KAA14896; Wed, 10 Jul 1996 10:15:32 -0500
Date: Wed, 10 Jul 1996 10:15:32 -0500
Message-Id: <199607101515.KAA14896@blanco>
Subject: Non-member submission from [Manfred Kerber <M.Kerber@cs.bham.ac.uk>]
To: nqthm-users@cli.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable
Content-MD5: QSh+wYlT/AE+rrZtzKI1PQ==
content-length: 3895

------------- Begin Forwarded Message -------------

=46rom M.Kerber@cs.bham.ac.uk  Wed Jul 10 09:02:00 1996
Return-Path: <M.Kerber@cs.bham.ac.uk>
Received: from percy.cs.bham.ac.uk by cli.com (SMI-8.6/SMI-SVR4)
	id JAA17950; Wed, 10 Jul 1996 09:01:57 -0500
Message-Id: <199607101401.JAA17950@cli.com>
Received: from wallace by percy.cs.bham.ac.uk with SMTP (PP)=20
          id <24065-0@percy.cs.bham.ac.uk>; Wed, 10 Jul 1996 14:58:40 =
+0100
To: nqthm-users@cli.com
cc: M.Kerber@cs.bham.ac.uk
Subject: Call for Participation, CADE-WS on Partial Functions
Date: Wed, 10 Jul 1996 14:58:37 +0100
From: Manfred Kerber <M.Kerber@cs.bham.ac.uk>
content-length: 3136

                      Updated Call for Participation=20

                            CADE-13 Workshop on=20

                  Mechanization of Partial Functions=20

          30 July 1996 Rutgers University, New Brunswick, NJ, USA=20

Many practical applications of deduction systems in mathematics and
computer science rely on the correct and efficient treatment of
partial functions. There is a rich variety of approaches for dealing
with partial functions and the undefined expressions that often result
from their application. Ranging from workarounds for concrete
situations to proper general treatments, these approaches have their
own advantages and disadvantages. For example, some can be used in
standard logical formalisms, while others require new formalisms. The
purpose of the workshop is to discuss the different approaches and to
compare their advantages and disadvantages.

Potential participants can apply by submitting a short statement that
contains a description of their current interests by e-mail to Manfred
Kerber at M.Kerber@cs.bham.ac.uk. Those invited to attend the workshop
have to register for the workshop in conjunction with the CADE main
conference.

Further information, in particular pointers to the general information
about CADE and FLoC as well as to PostScript versions of the presented
contributio