After the introduction of quantified monosigned formulae
the resolution for them is investigated and proved to be sound and refutational complete. This kind of resolution can be used not only for theoretical studies but also for practical applications. As a result
a subclass of quantified monosigned formulae which can be solved the satisfiability problem in polynomial time is recognized.
关键词
量化单一带标公式消解可满足性多项式时间可判定
Keywords
quantified monosigned formulaeresolutionsatisfiabilityin polynomial time