Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!godot.cc.duq.edu!news.duke.edu!news.mathworks.com!newsfeed.internetmci.com!in2.uu.net!allegra!alice!research!felty
From: felty@research.att.com (Amy Felty)
Subject: CADE-13 Advance Program and Call for Participation
X-Nntp-Posting-Host: arran.research.att.com
Message-ID: <FELTY.96Apr20162034@arran.research.att.com>
Followup-To: comp.ai
Sender: usenet@research.att.com (netnews <9149-80593> 0112740)
Reply-To: felty@research.att.com
Organization: AT&T Bell Laboratories
Date: Sat, 20 Apr 1996 20:20:34 GMT
Lines: 756


        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
