ON THE MINIMAL COVERING PROBLEM,

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.

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1963
Accession Number
AD0415321

Entities

People

  • S. R. Petrick

Organizations

  • Air Force Cambridge Research Laboratories

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Languages
  • Computer Programming
  • Computing-Related Activities
  • Coverings
  • Formal Languages
  • Machine Languages
  • Programming Languages

Readers

  • Artificial Intelligence
  • Computer Programming and Software Development.