Skip to main content
  • Conference proceedings
  • © 1990

10th International Conference on Automated Deduction

Kaiserslautern, FRG, July 24-27, 1990. Proceedings


Part of the book series: Lecture Notes in Computer Science (LNCS, volume 449)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Conference series link(s): CADE: International Conference on Automated Deduction

Conference proceedings info: CADE 1990.

Buying options

Softcover Book USD 169.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (74 papers)

  1. Front Matter

  2. A theorem prover for a computational logic

    • Robert S. Boyer, J Strother Moore
    Pages 1-15
  3. A complete semantic back chaining proof system

    • Xumin Nie, David A. Plaisted
    Pages 16-27
  4. Parallelizing the closure computation in automated deduction

    • John K. Slaney, Ewing L. Lusk
    Pages 28-39
  5. Partheo: A high-performance parallel theorem prover

    • J. Schumann, R. Letz
    Pages 40-56
  6. Substitution-based compilation of extended rules in deductive databases

    • Sang Ho Lee, Lawrence J. Henschen
    Pages 57-71
  7. Automatic theorem proving in paraconsistent logics: Theory and implementation

    • Newton C. A. da Costa, Lawrence J. Henschen, James J. Lu, V. S. Subrahmanian
    Pages 72-86
  8. Case-free programs: An abstraction of definite horn programs

    • Toshiro Wakayama, T. H. Payne
    Pages 87-101
  9. Generalized well-founded semantics for logic programs

    • Chitta Baral, Jorge Lobo, Jack Minker
    Pages 102-116
  10. Tactical theorem proving in program verification

    • M. Heisel, W. Reif, W. Stephan
    Pages 117-131
  11. Extensions to the rippling-out tactic for guiding inductive proofs

    • Alan Bundy, Frank van Harmelen, Alan Smaill, Andrew Ireland
    Pages 132-146
  12. Guiding induction proofs

    • Dieter Hutter
    Pages 147-161
  13. Term rewriting induction

    • Uday S. Reddy
    Pages 162-177
  14. A resolution principle for clauses with constraints

    • Hans-Jürgen Bürckert
    Pages 178-192
  15. Ritt-Wu's decomposition algorithm and geometry theorem proving

    • Shang-Ching Chou, Xiao-Shan Gao
    Pages 207-220
  16. An improved general E-unification method

    • Daniel J. Dougherty, Patricia Johann
    Pages 261-275

Other Volumes

  1. 10th International Conference on Automated Deduction

About this book

This volume contains the papers presented at the 10th International Conference on Automated Deduction (CADE-10). CADE is the major forum at which research on all aspects of automated deduction is presented. Although automated deduction research is also presented at more general artificial intelligence conferences, the CADE conferences have no peer in the concentration and quality of their contributions to this topic. The papers included range from theory to implementation and experimentation, from propositional to higher-order calculi and nonclassical logics; they refine and use a wealth of methods including resolution, paramodulation, rewriting, completion, unification and induction; and they work with a variety of applications including program verification, logic programming, deductive databases, and theorem proving in many domains. The volume also contains abstracts of 20 implementations of automated deduction systems. The authors of about half the papers are from the United States, many are from Western Europe, and many too are from the rest of the world. The proceedings of the 5th, 6th, 7th, 8th and 9th CADE conferences are published as Volumes 87, 138, 170, 230, 310 in the series Lecture Notes in Computer Science.


  • Artificial intelligence
  • Automat
  • Resolution
  • automated deduction
  • intelligence
  • logic
  • programming
  • proving
  • theorem proving
  • verification

Bibliographic Information

  • Book Title: 10th International Conference on Automated Deduction

  • Book Subtitle: Kaiserslautern, FRG, July 24-27, 1990. Proceedings

  • Editors: Mark E. Stickel

  • Series Title: Lecture Notes in Computer Science

  • DOI:

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1990

  • Softcover ISBN: 978-3-540-52885-2Published: 17 July 1990

  • eBook ISBN: 978-3-540-47171-4Published: 06 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XVIII, 690

  • Topics: Artificial Intelligence, Formal Languages and Automata Theory

Buying options

Softcover Book USD 169.00
Price excludes VAT (USA)