From (Quantified) Boolean Formulae to Answer Set Programming
Igor Stéphan, Benoit Da Mota, Pascal Nicolas · Journal of Logic and Computation · 2008
We propose in this article a translation from quantified Boolean formulae to answer set programming. The computation of a solution of a quantified Boolean formula is then equivalent to the computation of a stable model for a normal logic program. The case of unquantified Boolean formulae is also considered since it is equivalent to the case of quantified Boolean formulae with only existential quantifiers.