Sciweavers

Share
AMAI
2006
Springer

A generalization of the Lin-Zhao theorem

8 years 8 months ago
A generalization of the Lin-Zhao theorem
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In this paper we simplify and generalize the statement of this theorem. The simplification is achieved by modifying the definition of a loop in such a way that a program is turned into the corresponding propositional formula by adding loop formulas directly to the conjunction of its rules, without the intermediate step of forming the program's completion. The generalization makes the idea of a loop formula applicable to stable models in the sense of a very general definition that covers disjunctive programs, programs with nested expressions, and more.
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2006
Where AMAI
Authors Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
Comments (0)
books