Advertisement

Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

  • Xiaoping Chen
  • Jianmin Ji
  • Fangzhen Lin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5649)

Abstract

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.

Keywords

Logic Program Unit Propagation External Support Loop Formula Normal Logic Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Wang, K., Zhou, L.: Comparisons and computation of well-founded semantics for disjunctive logic programs. ACM Trans. Comput. Logic 6(2), 295–327 (2005)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Lifschitz, V., Tang, L., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25(3), 369–389 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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. 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
  6. 6.
    Van Gelder, A.: The alternating fixpoint of logic programs with negation. In: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pp. 1–10. ACM, New York (1989)CrossRefGoogle Scholar
  7. 7.
    Leone, N., Rullo, P., Scarcello, F.: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation. Information and Computation 135(2), 69–112 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 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. 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
  10. 10.
    Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115–137 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499–562 (2006)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Lin, F., Chen, Y.: Discovering Classes of Strongly Equivalent Logic Programs. Journal of Artificial Intelligence Research 28, 431–451 (2007)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Brass, S., Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation. The Journal of Logic Programming 40(1), 1–46 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. J. Autom. Reasoning 36(4), 345–377 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Xiaoping Chen
    • 1
  • Jianmin Ji
    • 1
  • Fangzhen Lin
    • 2
  1. 1.School of Computer Science and TechnologyUniversity of Science and Technology of ChinaP.R. China
  2. 2.Department of Computer Science and EngineeringHong Kong University of Science and TechnologyHong Kong

Personalised recommendations