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.

• Type: Conference
• Year: 2003
• Where: ICLP
• Authors: Joohyung Lee, Vladimir Lifschitz
• Keywords: Disjunctive Logic Programs, Disjunctive Programs, ICLP 2003, Loop Formulas, Programming Languages