Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formulas of loops with no external support can be computed in polynomial time, and if the given program has no constraints, an iterative procedure based on these formulas, the program completion, and unit propagation computes the least fixed point of a simplification operator used by DLV. We also relate loops with no external supports to the unfounded sets and the well-founded semantics of disjunctive logic programs by Wang and Zhou. However, the problem of computing loop formulas of loops with at most one external support rule is NP-hard for disjunctive logic programs. We thus propose a polynomial algorithm for computing some of these loop formulas, and show experimentally that this polynomial approximation algorithm can be effective in practice.
KeywordsLogic Program Unit Propagation External Support Loop Formula Normal Logic Program
Unable to display preview. Download preview PDF.
- 1.Chen, X., Ji, J., Lin, F.: Computing loops with at most one external support rule. In: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning, pp. 401–410 (2008)Google Scholar
- 4.Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Proceedings of the 19th International Conference on Logic Programming, pp. 451–465 (2003)Google Scholar
- 5.Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 293–322. Plenum Press, New York (1978)Google Scholar
- 8.Lee, J.: A model-theoretic counterpart of loop formulas. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, pp. 503–508 (2005)Google Scholar
- 9.Anger, C., Gebser, M., Schaub, T.: Approaching the core of unfounded sets. In: Proceedings of the International Workshop on Nonmonotonic Reasoning (NMR 2006), pp. 58–66 (2006)Google Scholar
- 15.Drescher, C., Gebser, M., Grote, T., Kaufmann, B., König, A., Ostrowski, M., Schaub, T.: Conflict-driven disjunctive answer set solving. In: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning, pp. 422–432 (2008)Google Scholar