Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Second Annual IEEE Symposium on

Logic in Computer Science (LICS 1987)

Paper: Inference Rules for Rewrite-Based First-Order Theorem Proving (at LICS 1987)

Authors: Leo Bachmair Nachum Dershowitz

Abstract

In this paper we present a complete inference system for first-order theorem proving that is based on a canonical system for Boolean algebra. We also present a technique for proving the completeness of rewrite-based proof methods.

BibTeX

  @InProceedings{BachmairDershowitz-InferenceRulesforRe,
    author = 	 {Leo Bachmair and Nachum Dershowitz},
    title = 	 {Inference Rules for Rewrite-Based First-Order Theorem Proving},
    booktitle =  {Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science (LICS 1987)},
    year =	 {1987},
    month =	 {June}, 
    pages =      {331--337},
    location =   {Ithaca, NY, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2017-04-0512:37
Andrzej Murawski