A generalization of the Lin-Zhao theorem |
| |
Authors: | Paolo Ferraris Joohyung Lee Vladimir Lifschitz |
| |
Affiliation: | (1) University of Texas at Austin, Austin, Texas, USA;(2) Arizona State University, Tempe, Arizona, USA |
| |
Abstract: | 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. |
| |
Keywords: | logic programming stable models answer set programming nonmonotonic reasoning Clark’ s completion loop formulas |
本文献已被 SpringerLink 等数据库收录! |
|