Sciweavers

Share
AGP
2003
IEEE

Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation

9 years 3 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature of NP problems: The property is encoded in a way such that polynomial size certificates for it correspond to stable models of a program. However, the problemsolving capacity of full disjunctive logic programs (DLPs) is beyond NP at the second level of the polynomial hierarchy. While problems there also have a “guess and check” structure, an encoding in a DLP is often non-obvious, in particular if the “check” itself is co-NP-complete; usually, such problems are solved by interleaving separate “guess” and “check” programs, where the check is expressed by inconsistency of the check program. We present general transformations of head-cycle free (extended) logic programs into stratified disjunctive logic programs which enable one to integrate such “guess” and “check” programs automaticall...
Thomas Eiter, Axel Polleres
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where AGP
Authors Thomas Eiter, Axel Polleres
Comments (0)
books