RESOLUTION FOR QUANTIFIED BOOLEAN-FORMULAS

被引：214

作者：

BUNING, HK ^{[1
]}

KARPINSKI, M ^{[1
]}

FLOGEL, A ^{[1
]}

机构：

[1] UNIV BONN, INST INFORMAT, D-53012 BONN, GERMANY

来源：

INFORMATION AND COMPUTATION | 1995年 / 117卷 / 01期

关键词：

D O I：

10.1006/inco.1995.1025

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A complete and sound resolution operation directly applicable to the quantified Boolean formulas is presented. If we restrict the resolution to unit resolution, then the completeness and soundness for extended quantified Horn formulas is shown. We prove that the truth of a quantified Horn formula can be decided in O(rn) time, where n is the length of the formula and r is the number of universal variables, whereas in contrast the evaluation problem for extended quantified Horn formulas is coNP-complete for formulas with prefix For All There Exists. Further, we show that the resolution is exponential for extended quantified Horn formulas. (C) 1995 Academic Press, Inc.

引用

页码：12 / 18

页数：7

共 6 条

[1] LINEAR-TIME ALGORITHM FOR TESTING THE TRUTH OF CERTAIN QUANTIFIED BOOLEAN FORMULAS [J].