Recognizing unnecessary clauses in resolution based systems

Document Type

Article

Publication Date

8-1-1992

Abstract

We concentrate on the problem of unnecessary inference in the context of resolution based systems. In such systems several strategies have been developed that allow for the delection of clauses without sacrificing completeness. Unfortunately these strategies fail to recognize other frequently generated unnecessary formulas. We will present a generalized subsumption theorem that can be used to recognize such formulas and to develop new deletion methods which retain completeness. © 1992 Kluwer Academic Publishers.

Identifier

0026904087 (Scopus)

Publication Title

Journal of Automated Reasoning

External Full Text Location

https://doi.org/10.1007/BF00247826

e-ISSN

15730670

ISSN

01687433

First Page

43

Last Page

76

Issue

1

Volume

9

This document is currently not available here.

Share

COinS