Lecture Notes in Artificial Intelligence

Transcription

1 Lecture Notes in Artificial Intelligence 1104 Subseries of Lecture Notes in Computer Science Edited by J. G. Carbonell and J. Siekmann Lecture Notes in Computer Science Edited by G. Goos, J. Hartmanis and J. van Leeuwen

2 M.A. McRobbie J.K. Slaney (Eds.) Automated Deduction Cade-13 13th International Conference on Automated Deduction New Brunswick, NJ, USA July 30 - August 3, 1996 Proceedings Springer

3 Series Editors Jaime G. Carbonell, Carnegie Mellon Universit3~ Pittsburgh, PA, USA J~rg Siekmann, University of Saarland, Saarbriicken, Germany Volume Editors Michael A. McRobbie The Australian National University Centre for Information Science Research Canberra, ACT 0200, Australia John K. Slaney The Australian National University Research School of Information Sciences and Engineering Canberra, ACT 0200, Australia Cataloging-in-Publication Data applied for Die Deutsche Bibliothek - CIP-Einheitsaufnahme Automated deduction : proceedings / CADE-13, 13th International Conference on Automated Deduction, New Brunswick, N J, USA, July 30 - August 3, M. A. MeRobbie ; J. K. Slaney (ed.). - Berlin ; Heidelberg ; New York ; Barcelona ; Budapest ; Hong Kong ; London; Milan ; Paris ; Santa Clara ; Singapore ; Tokyo : Springer, 1996 (Lecture notes in computer science ; Vol : Lecture notes in artificial intelligence) ISBN NE: MacRobbie, Michael A. [Hrsg.]; CADE <13, 1996, New Brunswick, NJ>; GT CR Subject Classification (1991): 1.2.3,E4.1-2 ISBN Springer-Verlag Berlin Heidelberg New York 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. 9 Springer-Verlag Berlin Heidelberg 1996 Printed in Germany Typesetting: Camera ready by author SPIN / Printed on acid-free paper

4 Preface This volume contains the papers presented at the Thirteenth International Conference on Automated Deduction (CADE-13) held July 30-August 3, 1996 in New Brunswick, New Jersey, USA, hosted by the Center for Discrete Mathematics and Computer Science (DIMACS) of Rutgers University. The CADE conferences are the major forum for the presentation of new research in all aspects of automated deduction. There were 133 papers submitted to CADE-13:114 regular papers and 19 system descriptions. Of these, 46 regular papers and 15 system descriptions were Selected for presentation at the conference. In addition, there were 6 workshops, a tutorial, a panel discussion and, for the first time 'live' at CADE, a theorem proving system competition. CADE-13 formed part of the Federated Logic Conference (FLoC) along with the 8th International Conference on Computer Aided Verification (CAV), the llth Annual IEEE Symposium on Logic in Computer Science (LICS) and the 7th International Conference on Rewriting Techniques and Applications (RTA). The purpose of FLoC was to bring together these related conferences in order to counteract the fragmentation of the field which has begun to appear as the community has grown over recent years. Interaction between the conferences was. enhanced by holding a joint banquet with CAV and by inviting plenary speakers jointly with CAV and with the other conferences. The Herbrand Award for distinguished contributions to automated deduction was presented to Alan Robinson, truly one of the pioneers of our discipline. In addition, CADE-13 saw the inauguration of a bursary in memory of Woody Bledsoe which supports a student for the purpose of participation in CADE. Once again, CADE-13 attracted interest from many parts of the world. Papers were submitted from: Australia, Austria, Brazil, Canada, China, Denmark, Finland, France, Germany, India, Israel, Italy, Japan, Lithuania, Netherlands, Norway, Spain, Sweden, UK, Uruguay and USA. We would like to thank many people for contributing to the success of FLoC and CADE-13. Foremost among the many must be those responsible for local arrangements, in particular Amy Felty, Doug Howe, Jon Riecke and the staff of DIMACS. Moshe Vardi and the FLoC steering committee did a great job of pulling FLoC together and causing it to happen at all. Our next greatest debt of thanks is to the Program Committee for undertaking the exacting task of reviewing so many papers under time pressure. We wish to record our gratitude to: the CADE Trustees, especially the Chair, Alan Bundy, for their hard work on behalf of CADE as well as for their wisdom and support; to the invited speakers Harald Ganzinger, Robin Milner, Amir Pnueli, Dana Scott and John Rushby; to the organisers of workshops, tutorial and theorem proving competition. Finally, our thanks go to those staff of the Australian National University, particularly Barbara Duckworth, Amanda Erbacher and Tim Surendonk, without whom our task would have been impossible. Michael McRobbie and John Slaney June 1996 CADE-13 Program Co-chairs

5 vi Herbrand Award for Distinguished Contributions to Automated Reasoning Recipient: Professor A. Robinson We are delighted to announce that the third Herbrand Award for Distinguished Service to Automated Reasoning will be given at CADE-13 to Professor Alan Robinson, formerly of Syracuse University. 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, and at CADE-12 it was made to Professor Woody Bledsoe. While the Herbrand Award is intended to mark the full range of his contributions over his long involvement in Automated Deduction, we wish particularly to recall Alan Robinson's best-known achievement in the development of unification and resolution as a proof procedure for first-order logic. It is fair to see this, as much as any other single contribution, as having shaped thirty years of research in our discipline. Nomination for this award can be made at any time to the Chair of the CADE Trustees. 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 endorsement. CADE-1 CADE-2 CADE-3 CADF_,-4 CADE-5 CADE-6 CADE-7 CADE-8 CADE-9 CADE-10 CADE-11 CADE-12 Previous CADEs Argonne National Laboratory, USA, 1974 (IEEE Transactions on Computers C-25, 8). Oberwolfach, Germany, MIT, USA, University of Texas at Austin, USA, Les Arcs, France, 1980 (Springer-Verlag LNCS 87). Courant Institute, NY, USA, 1982 (Springer-Verlag LNCS 138). Napa, California, USA, 1984 (Springer-Verlag LNCS 170). University of Oxford, UK, 1986 (Springer-Verlag LNCS 230). Argonne National Laboratory, 1988 (Springer-Verlag LNCS 310). Kaiserslautern, Germany, 1990 (Springer-Verlag LNCS 449). Saratoga Springs, USA, 1992 (Springer-Verlag LNCS 607). Nancy, France, 1994 (Springer-Verlag LNCS 814).

6 VII CADE Inc. Trustees Alan Bundy (Chair) Neil Murray (Secretary/Treasurer) William McCune (CADE-14) Michael McRobbie (CADE-13) John Slaney (CADE-13) Deepak Kaput (CADE- 11) Mark Stickel (CADE-10) Ewing Lusk (CADE-9) University of Edinburgh SUNY at Albany Argonne National Laboratory The Australian National University The Australian National University SUNY at Albany SR1 International Argonne National Laboratory Michael McRobbie John Slaney Program Co-chairs The The Australian National University The The Australian National University Program committee Owen L. Astrachan Juergen Avenhaus Leo Bachmair David Basin Wolfgang Bibel Francois Bry Bruno Buchberger Ricardo Caferra Key-Sun Choi Tony Cohn Luis Farifias del Cerro William M. Farmer Amy Felty Melvin Fitting Masayuki Fujita Stephen J. Garland Fausto Giunchiglia Elsa L. Gunter Ryuzo Hasegawa Larry Henschen Larry Hines Steffen HSlldobler Matt Kaufmann Alexander Leitsch Ewing Lusk Duke University Universitdit Kaiserslautern SUNY at Stony Brook MPI-I Saarbriicken Technishe Hochschule Darmstadt Universit(it MiJnchen RISC, Linz LIFIA-IMA G, Grenoble KAIST, Korea University of Leeds IRIT, Toulouse The MITRE Corporation ATSJT Bell Laboratories Lehman College, CUNY Mitsubishi Research Institute MIT IRST, Trento ATSJT Bell Laboratories Kyushu University Northwestern University EDS RSJD, Austin Technische ufitvct... ~tta~ "'" Dresden Motorola Inc. Technische Universitiit Wien Argonne National Laboratory

7 VIII Program committee (continued) David McAllester William McCune Ursula Martin Hans Jiirgen Ohlbach William Pase Frank Pfenning Fiora Pirri David A. Plaisted Joachim Posegga Uday S. Reddy Michael Rusinowitch Ken Satoh Johann Schumann Camilla Schwind Natarajan Shankar JSrg H. Siekmann Alan Smaill Gert Smolka Mark E. Stickel Geoff Sutcliffe Erik Tiden Andrei Voronkov Lincoln A. Wallen Dongming Wang Hantao Zhang A TSJT Bell Laboratories Argonne National Laboratory University of St Andrews MPI-I Saarbriicken Carnegie Mellon University Uiversit6 di Roma "La Sapienza" University of N Carolina, Chapel Hill Deutsche Telekom A G University of Illinois CRIN-INRIA, Nancy Hokkaido University Technische UniversitSt Miinchen Universitg de la Mgditerrange SRI International DFKI 8~ UniversitSt des Saarlandes Edinburgh University DFKI ~ Universiffit des Saarlandes SRI International James Cook University Siemens A G Uppsala University Oxford University LIFIA-IMA G, Grenoble University of Iowa Referees J. Akahani U. Egly B. Gramlich A. Armando N. Eisinger I. Green M. Baaz D. Fehrer A. Herzig B. Beckert C. Fermiiller D. Howe B. Bennett R. Fettig. R. H~hnle C. Benzmiiller S. Fevre K. Inoue S.-E. Bornscheuer H. Fujita A. Ireland R. Boulton U. Furbach K. Iwanuma S. Brfining I. Gent M. Kohlhase A. Cichon K. Georgatos M. Koshimura D. Cyrluk S. Gerberding C. Kreitz A. Degtyarev I. Gnaedig S. Kromodimoeljo S. Demri C. Goller T. Kuboyama J. Denzinger G. Gottlob U. Kfihler N. Dershowitz J. Gouhault-Larrecq S. Lehmke

8 Ix Referees (continued) C. Lengauer H. Rolletschek M. Thielscher R. Letz M. Saaltink A. Toenne S. Linton K. Sakai C. Traverso D. Lugiez G. Salzer K. Vershinin T. Margaria-Steffen E. Sandner V. Vialard S. Matthews J. Schicho L. Vigano S. Melville P.H. Schmitt A. Villafiorita A. Miola S. Schmitt M. Vittek W. Nejdl H. Schfitz T. Walsh Y. Okubo R. Sebastiani C. Walther J. Otten C. Sengler H. Wansing P. Pecchiari D. Shand T. Weigert N. Peltier V. Sofronie F. Winkler J. Pfalzgraf K. Stokkermans A. Wolf K. Prasser A. Strohmaier A. Wolpers P. Prohle C. Suttner A. Yahya W. Reif L. Thalman J. Zhang C. Ringeissen Invited speakers Harald Ganzinger Robin Milner (FLoC keynote lecture Amir Pnueli (CADE/CAV banquet speaker) Dana Scott John Rushby (jointly with CAV) MPI-I Saarbriicken Cambridge University Weizmann Institute Carnegie Mellon University SRI International Local arrangements chair Amy Felty ATS~T Bell Laboratories Assistance to program chair Barbara Duckworth Amanda Erbacher Helen Harris Zdzistav Meglicki Timothy Surendonk Deidre Whitelaw FLoC Sponsors CADE Sponsor ATS~T Laboratories Bell Labs - Lucent Technologies DIMACS, Rutgers University (host) IEEE Computer Society CADE Incorporated

9 Contents Invited Lecture Saturation-based theorem proving: Past successes and future potential... 1 Harald Ganzinger Session 1A A resolution theorem prover for intuitionistic logic... 2 Tanel Tammet Proof-terms for classical and intuitionistic resolution David Pym, Eike Ritter and Lincoln Wallen Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-Unification Andrei Voronkov Session 1B Extensions to a generalization critic for inductive proof Andrew Ireland and Alan Bundy Learning domain knowledge to improve theorem proving JSr9 Denzinger and Stephan Schulz Patching faulty conjectures Martin Protzen Session 2A Internal analogy in theorem proving Erica Melis and Jon Whittle Termination of theorem proving by reuse Thomas Kolbe and Christoph Walther Termination of algorithms over non-freely generated data types Claus Sengler Session 2B ABSFOL: a proof checker with abstraction Fausto G iunchiglia and Adolfo Villafiorita SPASS &z FLOTTER version Christoph Weidenbaeh, Bernd Gaede and Geor9 Rock

10 xii The design of the CADE-13 ATP system competition Christian Suttner and Geoff Sutcliffe SCAN - Elimination of predicate quantifiers Hans Jiirgen Ohlbach GEOTHER: a geometry theorem prover Dongming Wang Session 3A Structuring metatheory on inductive definitions David Basin and Sedn Matthews An embedding of Ruby in Isabelle Ole Rasmussen Mechanical verification of mutually recursive procedures Peter V. Homeier and David F. Martin Session 3B FasTraC: a decentrmized traffic control system based on logic programming Giovanni Felici, Giovanni Rinaldi and Klaus Truemper Presenting machine-found proofs Xiaorong Huang and Armin Fiedler MUltlog 1.0: towards an expert system for many-valued logics Matthias Baaz, Christian G. Fermiiller, Gernot Salzer and Richard Zach CtCoq: a system presentation Janet Bertot and Yves Bertot An introduction to geometry expert Shang-Ching Chou, Xiao-Shan Gao and Jing-Zhong Zhang SiCoTHEO: simple competitive parallel theorem provers J. Schumann Invited Lecture What can we hope to achieve from automated deduction? Dana S. Scott Session 4A Unification algorithms cannot be combined in polynomial time Miki Hermann and Phokion G. Kolaitis

11 Xfll Unification and matching modulo nilpotence Quing Guo, Paliath Narendran and D.A. Wolfram An improved lower bound for the elementary theories of trees Sergei Vorobyov Session 4B INKA: the next generation Dieter Hutter and Claus Sengler XRay: a prolog technology theorem prover for default reasoning: a system description Torsten Schaub, Stefan Briining and Pascal Nicolas IMPS: an updated system description William M. Farmer, Joshua D. Guttman and F. Javier Thayer Fdbrega The tableau-based theorem prover 3TAp, version Bernhard Beckert, Reiner H6hnle, Peter Oel and Martin Sulzmann System description : generating models by SEM Jian Zhang and Hantao Zhang Session 5A Optimizing proof search in model elimination John Harrison An abstract machine for fixed-order dynamically stratified programs Konstantinos Sagonas, Terrance Swift and David S. Warren Unification in pseudo-linear sort theories is decidable Christoph Weidenbach Session 5B Theorem proving with group presentations: examples and questions Ursula Martin Transforming termination by self-labelling Aart Middeldorp, Hitoshi Ohsaki and Hans Zantema Theorem proving in cancellative abelian monoids (extended abstract) Harald Ganzinger and Uwe Waldmann

12 XIV Session 6A On the practical value of different definitional translations to normal form Uwe Egly and Thomas Rath Converting non-classical matrix proofs into sequent-style systems Stephan Schmitt and Christoph Kreitz Efficient model generation through compilation Heribert Schiitz and Tim Geisler Session 6B Algebra and automated deduction Steve Linton, Ursula Martin, Pdter PrShle and Duncan Shand On Shostak's decision procedure for combinations of theories David Cyrluk, Patrick Lincoln and Natarajan Shankar Ground resolution with group computations on semantic symmetries Thierry Boy de la Tour Session 7A A new method for knowledge compilation: the achievement by cycle search Olivier Roussel and Philippe Mathieu Rewrite semantics for production rule systems: theory and applications Wayne Snyder and James G. Schmolze Experiments in the heuristic use of past proof experience Matthias Fuchs Session 7B Lemma discovery in automating induction Deepak Kapur and M. Subramaniam Advanced indexing operations on substitution trees Peter Graf and Christoph Meyer Semantic trees revisted: some new completeness results Christian G. Fermiiller

13 xv Session 8A Building decision procedures for modal logics from propositional decision procedures - the case study of modal K......, Fausto Giunchiglia and Roberto Sebastiani Resolution-based calculi for modal and temporal logics Andreas Nonnengart Tableaux and algorithms for propositional dynamic logic with converse Giuseppe De Giacomo and Fabio Massacci Session 8B Reflection of formal tactics in a deductive reflection framework Harald Ruefl Walther recursion David McAllester and Kostas Arkoudas Proof search with set variable instantiation in the calculus of constructions Amy Felty Session 9A Search strategies for resolution in temporal logics Clare Dixon Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices Gernot Salzer Grammar specification in categorial logics and theorem proving Saturnino F. Luz-Filho Session 9B Path indexing for AC-theories Peter Graf More Chureh-Rosser proofs (in Isabelle/HOL) Tobias Nipkow Partitioning methods for satisfiability testing on large formulas Tai Joon Park and Allen Van Gelder Author Index