On Using Satisfiability-Based Pruning Techniques in Covering Algorithms

doi 10.1109/date.2000.840296
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE Comput. Soc