Location of Repository

EPC<sub><</sub>, And Equality Generalized Subsumption In Resolution-Based Automatic-Theorem-Proving

By T. Mackling

Abstract

The standard notions of tautology and subsumption can be naturally generalized, (so that refutation completeness is preserved with respect to the associated deletion), within the context of (a specified set of) modified deduction rules for binary clausal resolution-refutation which build-in the reflexivity, symmetry, transitivity and predicate substitutivity axioms for equality. The generalized notions of subsumption and tautology, \Sigma 0 -subsumption and \Sigma 0 -tautology , respectively, are presented, and EPC! , a binary clausal system which provides an adequate deductive context for refutation completeness under deletion with respect to these generalized notions, is introduced. Additionally, some refutation completeness preserving clause "normalization" techniques including generalized forms of replacement factoring and a form of demodulation, are presented. Some refinements for the rules are offered, as well as a possible further generalization for subsumption, and a generaliz..

Year: 1997
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.8901
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • ftp://ftp.cim.mcgill.ca/pub/pa... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.