Subscribe to thousands of academic journals for just $40/month
Read and share the articles you need for your research, all in one place.

From (Quantified) Boolean Formulae to Answer Set Programming

Journal of Logic And Computation , Volume 19 (4) – Aug 1, 2009

Details

Publisher
Oxford University Press
Copyright
Copyright © 2009 Oxford University Press
ISSN
0955-792X
eISSN
1465-363X
D.O.I.
10.1093/logcom/exn041
Publisher site
See Article on Publisher Site

Preview Only

Expand Tray Hide Tray

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...

Preview Only. This article cannot be rented because we do not currently have permission from the publisher.

 
/lp/oxford-university-press/from-quantified-boolean-formulae-to-answer-set-programming-w1JyBRWQhl