The Stable Models of a Predicate Logic Program

V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
1994 The Journal of Logic Programming  
Statement of problems and results In this paper we investigate and solve the problem classifying the Turing complexity of stable models of finite and recursive predicate logic programs. Gelfond-Lifschitz [7] introduced the concept of a stable model M of a Predicate Logic Program P . Here we show that, up to a recursive 1-1 coding, the set of all stable models of finite Predicate Logic Programs and the Π 0 1 classes (equivalently, the set of all infinite branches of recursive trees) coincide
more » ... orems 4.1 and 5.1). Typical consequences: 1) there are finite Predicate Logic Programs which have stable models, but which have no hyperarithmetic stable models; 2) for every recur-1
doi:10.1016/s0743-1066(14)80008-3 fatcat:ukrtmiky6ngvnasnonojeox4ye