Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
