Table Of ContentLecture Notes in Artificial Intelligence 814
Subseries of Lecture Notes in Computer Science
Edited by J. G. Carbonell and J. Siekmann
Lecture Notes in Computer Science
Edited by G. Goos and J. Hartmanis
Alan Bundy (Ed.)
Automated Deduction
CADE-12
12th International Conference on
Automated Deduction
Nancy, France, June 26 - July ,1 1994
Proceedings
galreV-regnirpS
Berlin Heidelberg NewYork
London Paris Tokyo
Hong Kong Barcelona
Budapest
Series Editors
Jaime G. Carbonell
School of Computer Science, Carnegie Mellon University
Schenley Park, Pittsburgh, PA 15213-3890, USA
JSrg Siekmann
University of Saarland
German Research Center for Artificial Intelligence (DFKI)
Stuhlsatzenhausweg 3, D-66123 Saarbriicken, Germany
Volume Editor
Alan Bundy
Department of Artificial Intelligence, The University of Edinburgh
80 South Bridge, Edinburgh EH 1 1HN, United Kingdom
CR Subject Classification (1991):I.2.3, E4.1-2
ISBN 3-540-58156-1 Springer-Verlag Berlin Heidelberg New York
ISBN 0-387-58156-1 Springer-Verlag New York Berlin Heidelberg
CIP data applied for.
This work is subject to copyright. All rights are reserved, whether the whole or part of
the material is concerned, specifically the rights of translation, reprinting, re-use of
illustrations, recitation, broadcasting, reproduction on microfilms or in any other way,
and storage in data banks. Duplication of this publication or parts thereof is permitted
only under the provisions of the German Copyright Law of September 9, 1965, in its
current version, and permission for use must always be obtained from Springer-Verlag.
Violations are liable for prosecution under the German Copyright Law.
(cid:14)9 Springer-Verlag Berlin Heidelberg 1994
Printed in Germany
Typesetting: Camera ready by author
SPIN: 10131285 45/3140-543210 - Printed on acid-free paper
Preface
This volume contains the papers presented at the Twelfth International Con-
ference on Automated Deduction (CADE-12) held on June 26-July ,1 1994, at
the Palais des Congr~s de Nancy, France, sponsored by CADE Inc. and hosted
by INRIA and CRIN; many other organizations provided co-sponsorship. The
CADE conferences are the major forum for the presentation of new research in
all aspects of automated deduction.
There were 771 papers submitted to CADE-12:152 regular papers, 32 system
descriptions and 2 problem sets. Of these 771 papers, 67 were accepted: 64 reg-
ular papers, 91 system descriptions and 2 problem sets (some papers switched
categories during refereeing). In addition, the CADE-12 programme contained
3 invited talks, a banquet speech, a panel discussion, 7 workshops and 8 tutori-
als. The number of papers submitted and accepted are both records for CADE
conferences. The field of automated deduction is clearly growing. This growth
has been achieved with no dilution of the very high standards in the field. In
particular, the quality of papers accepted by CADE-12 is at least as high as at
previous CADEs. This volume presents many of the most important research
results in automated deduction since CADE-11.
Much of the growth is accounted for by the spread of interest in the field
around the globe. CADE-12 received papers from: Australia, Austria, Bel-
gium, Canada, France, Germany, Italy, Japan, Norway, China, Poland, Portugal,
Spain, Sweden, The Netherlands, UK, USA and Ukraine.
Since CADE-11, the CADE conference series has been put on a firmer footing
with the incorporation of CADE. CADE Inc. will sponsor all future CADE
conferences. It will protect the officers of CADE from financial liability and
provide initial funding for CADE conferences as well as providing a holding
fund for any surpluses. CADE Inc. is a sub-corporation of the Association of
Automated Reasoning. It will be run by a Board of Trustees consisting of the
current and past four CADE Programme Chairs plus a Secretary and Treasurer.
I am particularly grateful to Nell Murray for agreeing to hold the joint post of
Secretary and Treasurer of CADE Inc.
I would like to thank the many people who made CADE-12 possible. I am
grateful: to the Programme Committee and the additional referees they recruited
for reviewing a record number of papers to a very high standard in a short time
scale; to Claude Kirchner and his Local Arrangements Committee for their en-
ergy and dedication in organising an excellent conference; to my fellow Trustees
for their advice and encouragement, especially to Secretary/Treasurer Neil Mur-
ray; to the Invited Speakers, John Slaney, Ursula Martin and Bob Constable,
the Banquet Speaker, Richard Platek, and the Panel Organiser, Bob Boyer; to
the tutorial and workshop organisers; to Janice Lonsdale for help in organising
the Programme Committee Meeting at Imperial College; a~d last, but by no
means least, to Ian Green, Millie Tupman, Carole Douglas and the members of
my research group at Edinburgh, who helped with the myriad administrative
tasks involved in programme chairing a conference.
Alan Bundy
CADE-12 Programme Chair
lY
Herbrand Award for
Distinguished Contributions to Automated Reasoning
Recipient: Professor W. W. Bledsoe
We are delighted to announce that the second Herbrand Award for Distinguished
Contributions to Automated Reasoning will be given at CADE-12 to Professor
Woody Bledsoe, of the University of Texas at Austin. The Herbrand Award was
initiated at CADE-11 to honour an individual or (a group of) individuals for
exceptional contributions to the field of Automated Deduction. The winner is
selected by the Trustees, the Programme Committee and previous winners. At
CADE-11 the Award was made to Dr. Larry Wos. Woody Bledsoe has made
numerous contributions to the field of Automated Deduction including natural
proof systems, interactive systems, decision procedures, analogical reasoning and
applications to set theory, analysis and program verification. He has been a
source of inspiration to generations of researchers at Austin and throughout the
world.
Nomination for this award can be made at any time to the CADE chair.
A nomination should include a letter (of up to 2000 words) from a principal
nominator describing the nominee's contributions, along with two other letters
(of up to 2000 words) of endorsement.
Previous CADEs
CADE-1 Argonne National Laboratory, USA, 1974 (IEEE Transactions on Com-
puters C-25, #8).
CADE-2 Oberwolfach, Germany, 1976.
CADE-3 MIT, USA, 1977.
CADE-4 University of Texas at Austin, USA, 1979.
CADE-5 Les Arcs, France, 1980 (Springer-Verlag LNCS 87).
CADE-6 Courant Institute, New York, USA, 1982 (Springer-Verlag LNCS 138).
CADE-7 Napa, California, USA, 1984 (Springer-Verlag LNCS 170).
CADE-8 University of Oxford, UK, 1986 (Springer-Verlag LNCS 230).
CADE-9 Argonne National Laboratory, USAr 1988 (Springer-Verlag LNCS 310).
CADE-10 Kaiserslautern, Germany, 1990 (Springer-Verlag LNAI 449).
CADE-11 Saratoga Springs, USA, 1992 (Springer-Verlag LNAI 607).
IIV
CADE Inc. trustees
Alan Bundy (Chair) University of Edinburgh
Neff Murray (Secretary/Treasurer) State University of New York at Albany
Deepak Kapur (CADE-11) State University of New York at Albany
Mark Stickel (CADE-10) SRI International
Ewing Lusk (CADE-9) Argonne National Laboratory
J6rg Siekmann (CADE-8) UniversitSt Kaiserslautern
Programme chair
Alan Bundy University of Edinburgh
Assistant to programme chair
Ian Green University of Edinburgh
Programme committee
Luigia Carlucci Aiello Universit5 di Roma "La Sapienza"
Jfirgen Avenhaus Universitiit Kaiserslautern
David Basin Max-Planck-Institut fiir Informatik, Saarbriicken
Wolfgang Bibel Technische Hochschule Darmstadt
Francois Bry Ludwig-Maximilians- UniversitSt Miinchen
Ricardo Caferra LIFIA-IMA G
Edmund Clarke Carnegie Mellon University
Anthony Cohn University of Leeds
William Farmer The MITRE Corporation
Alan Frisch University of York
Dov Gabbay Imperial College
Harald Ganzinger Max-Planck-Institut iir Informatik, Saarbriicken
Stephen Garland MIT
Fausto Giunchiglia IRST ~ University of Trento
Mike Gordon University of Cambridge
Elsa Gunter A A~T T Bell Laboratories
Masami Hagiya University of Tokyo
Ryuzo Hasegawa Institute for New Generation Computer Technology
Larry Henschen Northwestern University
Larry Hines University of Texas at Austin
Steffen HSlldobler Technische UniversitSt Dresden
Douglas Howe AT~T Bell Laboratories
Matt Kaufmann Computational Logic Inc.
H~l~ne Kirchner CRIN- CNRS A~ INRIA Lorraine
Alexander Leitsch Technische Universitiit Wien
Ursula Martin University o/ St. Andrews
David McAllester MIT
William McCune Argonne National Laboratory
Michael McRobbie The Australian National University
Tobias Nipkow Technische Universitiit Miinchen
Itans-Jiirgen Ohlbach Max-Planck-Institut fiir Informatik, Saarbriicken
VIII
Programme committee (contd.)
William Pase ORA Canada
Alberto Pettorossi Universitd di Roma Tot atagreV
Frank Pfenning Carnegie Mellon University
David Plaisted UNC Chapel Hill ~ MPI f~r Inormatik, 8aarbr~cken
Uday Reddy University of Illinois at ngiapmahC-anabrU
Michael Rusinowitch CRIN-INRIA
Taisuke Sato Electrotechnical yrotarobaL
Ken Satoh Fujitsu Laboratories Ltd.
Natarajan Shankar SRI International
John Slaney The Australian National University
Alan Smaill University of Edinburgh
Gert Smolka DFKI ~ UniversitSt sed Saarlandes, Saarbr~cken
Andrei Voronkov alasppU University
Richard Waldinger SRI International
Lincoln Wallen University of drofxO
Christoph Walther Technisehe Hoehsehule Darmstadt
Referees
ordnasselA odnamrA Deepak Kaput Gernot Salzer
Leo Bachmair Hans Kleine Brining Manfred Schmidt-Schaufl
Jonas Barklund Eckhard Koch Peter .H Schmitt
Peter Barth Christoph Kreitz Josef Schneeberger
Antje Beringer Sentot Kromodimoeljo Johann Schumann
Bob Boyer Reinhold Letz Roberto Sebastiani
Stefan Brrining Craig MacNish Luciano Serafini
Bruno Buchberger Paolo Mancarella Ute Sigmund
Marco Cadoli M. MarteUi Don Simon
Alessandro Cimatti Ron van der Meyden Mark Stickel
Pierangelo Dell'Acqua J Moore Jrirgen Stuber
JSrg Denzinger Kunaki Mukai Sakthi Subramanian
Francesco .M Donini Daniele Nardi Christian Suttner
ewU Egly Paliath Narendran Toshihisa Takagi
Norbert Eisinger Nicola Olivetti Kazuko Takahashi
Amy Felty Eugenio Omodeo Yukihide Takayama
Chris reUirmreF ewU Petermann Michael Thielscher
Hiroshi Fujita William Pierce Paul Thistlewaite
Ulrich Furbach- Fiora Pirri ozoY Toda
Stefan Gerberding Katalin Prasser Paolo Traverso
Jrirgen Giesl Christian Prehofer Ralf Treinen
Enrico Giunchiglia Maurizio Proietti Haruyasu Ueda
John Gooday Martin Protzen Adolfo Villafiorita
Mark Grundy Thomas Rath JSrg Wrirtz
Ursula Halls Horst Reichel ewU Waldmann
Hirotaka Hara Michael .M Richter Emile Weydert
Robert Hasker Mark Saaltink Matt Wilding
Kouji Iwanuma Ko Sakai Jia-Huai uoY
Jrirgen Janas Bill Young
xI
Invited speakers
Robert .L Constable Cornell University
Ursula Martin University of St. Andrews
Richard Platek Odyssey Research Associates ~ Cornell University
John Slaney The Australian National University
Local arrangements committee
Claude Kirchner (Chair)
Anne-Lise Charbonnier Miki Hermann
Eric Domenjoud Armelle Savary
Assistance with refereeing process
Josie Bundy Weiru Liu
Ian Frank Raul Monroy
Ian Gent Santiago Negrete
Ian Green Julian Richardson
Andrew Ireland Alan Smaill
Ina Kraan Geraint Wiggins
Sponsor Host
CADE Inc. INRIA Lorraine & CRIN
Co-sponsors
Department of Artificial Intelligence, Institut National
University of Edinburgh Polytechnique de Lorraine
CCL Esprit Working Group Minist~re de l'Enseignement
Computational Logic Inc. Supdrieur et de la Recherche
CNET Sun Microsystems
CNRS-SPI Universitd de Nancy I
Conseil Gdndral de Meurthe et Moselle Universitd de Nancy II
Conseil Rdgional de Lorraine Ville de Nancy
District de l'agglom~ration Nancdenne Ville de Villers s~l Nancy
With the cooperation of
AEBEC amegoN
ttelweH drakcaP ~CO
MBI remmuS smetsyS
ehT lanoitanretnI Joint ecnerefnoC no laicifitrA ,ecnegilletnI .cnI
Table of contents
Invited talk
The crisis in finite mathematics: Automated reasoning as cause and cure ..... 1
John Slaney (The Australian National University)
Heuristics for induction
A divergence critic ......................................................... 14
Toby Walsh (INRIA Lorraine)
Synthesis of induction orderings for existence proofs ........................ 29
Dieter I-Iutter (DFKI Saarbriieken)
Lazy generation of induction hypotheses .................................... 42
Martin Protzen (Technische IIoehschule Darmstadt)
Experiments with resolution systems
The search efficiency of theorem proving strategies ......................... 57
David A. Plaisted (University of North Carolina at Chapel Hill)
A method for building models automatically: Experiments with an
extension of OTTER ....................................................... 72
Christophe Bourely, Ricardo Caferra and Nicolas Peltier (LIFIA-IMA )G
Model elimination without contrapositives .................................. 87
Peter Baumgartner and Ulrich Furbach (Universitiit Koblenz)
Implicit vs. explicit induction
Induction using term orderings ............................................ 102
Francois Bronsard, Uday S. Reddy and Robert .W Hasker
(The University of Illinois at )ngiapmahC-anabrU
Mechanizable inductive proofs for a class of V B formulas ................... 118
Jacques Chazarain and Emmanuel Kounalis
(Universitd ed Nice Sophia Antipolis)
On the connection between narrowing and proof by consistency ............ 133
Olav Lysne (University of )olsO
Induction
A fixedpoint approach to implementing (co)inductive definitions ........... 148
Lawrence .C Paulson (University of )egdirbmaC
On notions of inductive validity for first-order equational clauses ........... 162
Claus-Peter Wirth and Bernhard Gramlich (Universitdt Kaiserslautern)
A new application for explanation-based generalisation within automated
deduction .................................................................. 177
Siani Baker (University of )egdirbmaC
(cid:141)
Heuristics for controlling resolution
Semantically guided first-order theorem proving using hyper-linking ....... 192
Heng uhC and David A. Plaisted
(University of North Carolina at Chapel Hill)
The applicability of logic program analysis and transformation to theorem
proving ........... . ....................................................... 207
D.A. ed Waal and J.P. Gallagher (University of Bristol)
Detecting non-provable goals .............................................. 222
Stefan Bri~ning (Teehnische Hochsehule Darmstadt)
Panel discussion
A mechanically proof-checked encyclopedia of mathematics: Should we
build one? Can we? ....................................................... 237
Robert S. Boyer (University of Texas at Austin ~ Computational ,cigoL
Inc.), N.G. ed Bruijn (Eindhoven University of Technology), drardG
Huet (INRIA Rocquencourt) and Andrzej Trybulec (Warsaw University
in Biatystok)
ATP problems
The TPTP problem library ............................................... 252
Geoff Suteliffe (James Cook University), Christian Suttner and Theodor
Yemenis ( Teehnische Universitdt Miinchen)
Unification
Combination techniques for non-disjoint equational theories ............... 267
Eric Domenjoud, Francis Klay and Christophe Ringeissen (CRIN-CNRS
INRIA Lorraine)
Primal grammars and unification modulo a binary clause .................. 282
Gernot Salzer (Teehnisehe Universitdt Wien)
Logic programming applications
Conservative query normalization on parallel circumscription .............. 296
Kouji Iwanuma ( Yamanashi University)
Bottom-up evaluation of datalog programs with arithmetic constraints ..... 311
Laurent Fribourg and Marcos Veloso Peixoto (LIENS Paris)
On intuitionistic query answering in description bases ..................... 326
Veronique Royer (ONERA, Chatillon) and J. Joachim Quantz
( Technische ti~tisrevinU Berlin)
Applications
Deductive composition of astronomical software from subroutine libraries.. 341
Mark Stiekel, Richard Waldinger (SRI International), Michael Lowry,
Thomas Pressburger and Ian doowrednU (NASA Ames Research Center)
