Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs | IEEE Conference Publication | IEEE Xplore