The Complexity of Futile Questioning

Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified Boolean formula. A variation of the problem includes also costs for the logic variables. Typically, the problem is simplified instead of solved directly, which may lead to inaccurate results. Alternatively, the problem can be transformed to a standard format. We investigate the complexity of the futile questioning problem and two subclasses. Based on the complexity result, we argue that a transformation to the standard format is not suitable for practical purposes.

[1]  Klaus Truemper,et al.  An Effective Algorithm for the Futile Questioning Problem , 2005, Journal of Automated Reasoning.

[2]  Mark W. Krentel.  Generalizations of Opt P to the Polynomial Hierarchy , 1992, Theor. Comput. Sci..

[3]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[4]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[5]  Moshe Y. Vardi,et al.  Symbolic Decision Procedures for QBF , 2004, CP.

[6]  Marco Benedetti,et al.  Evaluating QBFs via Symbolic Skolemization , 2005, LPAR.

[7]  Georg Gottlob,et al.  The Complexity of Logic-Based Abduction , 1993, STACS.

[8]  Klaus Truemper,et al.  Learning to Ask Relevant Questions , 1999, Artif. Intell..

[9]  Karem A. Sakallah,et al.  Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution , 2003, SAT.

[10]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[11]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[12]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[13]  Armando Tacchella,et al.  Backjumping for Quantified Boolean Logic satisfiability , 2001, Artif. Intell..

[14]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[15]  Jim Kadin,et al.  P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP , 1989, J. Comput. Syst. Sci..

[16]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[17]  Hans Kleine Büning,et al.  Resolution for Quantified Boolean Formulas , 1995, Inf. Comput..

[18]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[19]  Mark W. Krentel.  The Complexity of Optimization Problems , 1986, Computational Complexity Conference.