Loop Formulas for Disjunctive Logic Programs (2003)
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.
In Proceedings of International Conference on Logic Programming (ICLP), pp. 451-465 2003.

Joohyung Lee Ph.D. Alumni joolee [at] asu edu
Vladimir Lifschitz Faculty vl [at] cs utexas edu