From (Quantified) Boolean Formulae to Answer Set Programming

Authors:
Igor Stéphan;Benoit Da Mota;Pascal Nicolas
Affiliations:
-;-;-
Venue:
Journal of Logic and Computation
Year:
2009

Citing 0
Cited 1

Dialectical Proofs for Constrained Argumentation

Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010

Quantified Score

Hi-index	0.00

Visualization

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.