Table of contents

  1. Front Matter
  2. Hantao Zhang, Deepak Kapur
    Pages 1-20
  3. Tie Cheng Wang
    Pages 21-40
  4. V. S. Subrahmanian
    Pages 81-100
  5. D. Duchier, D. McDermott
    Pages 121-130
  6. M. Heisel, W. Reif, W. Stephan
    Pages 131-140
  7. Donald Simon
    Pages 141-150
  8. Marc Bezem
    Pages 151-161
  9. Hantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy
    Pages 162-181
  10. Jean Gallier, Paliath Narendran, David Plaisted, Stan Raatz, Wayne Snyder
    Pages 182-196
  11. Michael A. McRobbie, Robert K. Meyer, Paul B. Thistlewaite
    Pages 197-217
  12. A. A. Aaby, K. T. Narayana
    Pages 218-237
  13. Douglas J. Howe
    Pages 238-257
  14. H. Azzoune
    Pages 258-277
  15. Jack Minker, Arcot Rajasekar
    Pages 278-293
  16. Shan Chi, Lawrence J. Henschen
    Pages 294-312

About these proceedings

Introduction

This volume contains the papers presented at the Ninth International Conference on Automated Deduction (CADE-9) held May 23-26 at Argonne National Laboratory, Argonne, Illinois. The conference commemorates the twenty-fifth anniversary of the discovery of the resolution principle, which took place during the summer of 1963. The CADE conferences are a forum for reporting on research on all aspects of automated deduction, including theorem proving, logic programming, unification, deductive databases, term rewriting, ATP for non-standard logics, and program verification. All papers submitted to the conference were refereed by at least two referees, and the program committee accepted the 52 that appear here. Also included in this volume are abstracts of 21 implementations of automated deduction systems.

Keywords

Erfüllbarkeitsproblem der Aussagenlogik Isabelle Resolution algorithms automated deduction automated theorem proving logic proof theorem proving

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0012819
  • Copyright Information Springer-Verlag 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-19343-2
  • Online ISBN 978-3-540-39216-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book