Sciweavers

FCS
2007
13 years 8 months ago
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 ...
Anja Remshagen, Klaus Truemper
SAT
2004
Springer
131views Hardware» more  SAT 2004»
14 years 7 days ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik