10th International Conference on Automated Deduction

1. Front Matter

   PDF

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. Str+ve \(\subseteq\) : The Str+ve-based subset prover

    • Larry Hines

    Pages 193-206

16. Ritt-Wu's decomposition algorithm and geometry theorem proving

    • Shang-Ching Chou, Xiao-Shan Gao

    Pages 207-220

17. Encoding a dependent-type λ-calculus in a logic programming language

    • Amy Felty, Dale Miller

    Pages 221-235

18. Investigations into proof-search in a system of first-order dependent function types

    • David Pym, Lincoln Wallen

    Pages 236-250

19. Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete

    • David A. Basin

    Pages 251-260

20. An improved general E-unification method

    • Daniel J. Dougherty, Patricia Johann

    Pages 261-275

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