Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

LPNMR

2001

Springer

2001

Springer

Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class NP. Moreover, we do this in a uniform way as deﬁned in (MT99). Speciﬁcally, we show that there is a single DATALOG¬ program PT rg such that given any Turing machine M , any polynomial p with non-negative integer coeﬃcients and any input σ of size n over a ﬁxed alphabet Σ, there is an extensional database edbM,p,σ such that there is a one-to-one correspondence between the stable models of edbM,p,σ ∪ PT rg and the accepting computations of the machine M that reach the ﬁnal state in at most p(n) steps. Moreover, edbM,p,σ can be computed in polynomial time from p, σ and the description of M and the decoding of such accepting computations from its corresponding stable model of edbM,p,σ ∪ PT rg can be computed in linear time. A similar statement holds for Default Logic with respect to ΣP 2 -s...

Related Content

Added |
30 Jul 2010 |

Updated |
30 Jul 2010 |

Type |
Conference |

Year |
2001 |

Where |
LPNMR |

Authors |
V. Wiktor Marek, Jeffrey B. Remmel |

Comments (0)