On the Foundations of Answer Set Programming

Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf’s result to all search problems in the class NP. Moreover, we do this in a uniform way as defined in (Marek and Truszczyfiski 1999).