Accession Number:

AD0415321

Title:

ON THE MINIMAL COVERING PROBLEM,

Descriptive Note:

Corporate Author:

AIR FORCE CAMBRIDGE RESEARCH LABS L G HANSCOM FIELD MASS

Personal Author(s):

Report Date:

1963-06-01

Pagination or Media Count:

36.0

Abstract:

This paper presents several algorithms for determining those irredundant and minimal clauses that imply a truth function given in conjunctive normal form. Algebraic methods of directly obtaining all minimal clauses or just a single minimal clause are given for use in those cases in which the entire set of irredundant clauses is not required. Programs using the LISP and COMIT Programming Systems and two basic machine codes have been written to evaluate the algorithms of this paper relative to each other and to alternative procedures.

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE