“Woah! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

From (Quantified) Boolean Formulae to Answer Set Programming

From (Quantified) Boolean Formulae to Answer Set Programming 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Logic And Computation Oxford University Press

From (Quantified) Boolean Formulae to Answer Set Programming

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.
Loading next page...
 
/lp/oxford-university-press/from-quantified-boolean-formulae-to-answer-set-programming-w1JyBRWQhl

Sorry, we don't have permission to share this article on DeepDyve,
but here are related articles that you can start reading right now: