一个极小不可满足公式子类的等价结构(英文)

Equivalence Structure of a Subclass of Minimal Unsatisfiable Formulas

研究一个极小不可满足公式子类 (MAX( 1 ) )的等价结构 考虑了MAX( 1 )上的变元改名问题和文字改名问题 此两个问题均可在O(nlog2 (n) )

the equivalence structure of a subclass (MAX(1)) of minimal unsatisfiable formulas is investigated.The var renaming and the lit_renaming problems over MAX(1)is considered,both are solvable in O(n 2) time.