作者: Robert Saxon Milnikel
DOI:
关键词: Discrete mathematics 、 Mathematics 、 Computational logic 、 Dynamic logic (modal logic) 、 Philosophy of logic 、 Default logic 、 Programming language 、 Skepticism
摘要: FC-normal logic programs are a generalization by Marek, Nerode, and Remmel of Reiter's normal default theories. They have the property that, unlike most programs, they guaranteed to simple stable models. In this paper it is shown that problem skeptical reasoning in Π^1_1-complete, same complexity as for without restriction FC-normality. defined such way make testing program FC-normality very difficult general. A large subclass locally defined, be recursive, consequence expressive entire class programs.