Loop Formulas for Disjunctive Logic Programs

13 years 11 months ago
Loop Formulas for Disjunctive Logic Programs
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. The concept of a tight program and Fages’ theorem are extended to disjunctive programs as well.
Joohyung Lee, Vladimir Lifschitz
Added 07 Jul 2010
Updated 07 Jul 2010
Type Conference
Year 2003
Where ICLP
Authors Joohyung Lee, Vladimir Lifschitz
Comments (0)