A generalization of the Lin-Zhao theorem

Authors:
Paolo Ferraris;Joohyung Lee;Vladimir Lifschitz
Affiliations:
University of Texas at Austin, Austin, USA;Arizona State University, Tempe, USA;University of Texas at Austin, Austin, USA
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2006

Citing 0
Cited 20

On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction

Journal of Computer Science and Technology
On Reductive Semantics of Aggregates in Answer Set Programming

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Translating Preferred Answer Set Programs to Propositional Logic

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A meta-programming technique for debugging answer-set programs

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
Symmetric splitting in the general theory of stable models

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Answer-set programming with bounded treewidth

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Head-elementary-set-free logic programs

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Alternative characterizations for program equivalence under answer-set semantics based on unfounded sets

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Logic programs with propositional connectives and aggregates

ACM Transactions on Computational Logic (TOCL)
Guarded resolution for answer set programming

Theory and Practice of Logic Programming
Loop formulas for splitable temporal logic programs

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
STeLP: a tool for temporal answer set programming

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
First-Order encodings for modular nonmonotonic datalog programs

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
First-order stable model semantics and first-order loop formulas

Journal of Artificial Intelligence Research
Computing Loops with at Most One External Support Rule
Tableau Calculi for Logic Programs under Answer Set Semantics

ACM Transactions on Computational Logic (TOCL)
Forgetting for answer set programs revisited

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.