Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2018, Article ID 4157030, 10 pages
https://doi.org/10.1155/2018/4157030
Research Article

Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic Programs

1Department of Computing Science, Umeå University, 901 87 Umeå, Sweden
2Departamento de Actuaría, Física y Matemáticas, Universidad de las Américas Puebla, Sta. Catarina Mártir, 72820 Cholula, PUE, Mexico

Correspondence should be addressed to Juan Carlos Nieves; es.umu.sc@seveincj

Received 28 June 2017; Revised 9 October 2017; Accepted 24 October 2017; Published 1 March 2018

Academic Editor: Fabrizio Riguzzi

Copyright © 2018 Juan Carlos Nieves and Mauricio Osorio. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. Baral, Knowledge Representation, Reasoning and Declarative Problem Solving, Cambridge University Press, Cambridge, Mass, USA, 2003. View at Publisher · View at Google Scholar
  2. M. Gelfond and V. Lifschitz, “The Stable Model Semantics for Logic Programming,” in Proceedings of the 5th Conference on Logic Programming, R. Kowalski and K. Bowen, Eds., pp. 1070–1080, MIT Press, 1988.
  3. J. Dix, “A classification theory of semantics of normal logic programs. II. Weak properties,” Fundamenta Informaticae, vol. 22, no. 3, pp. 257–288, 1995. View at Google Scholar · View at MathSciNet
  4. J. Dix, M. Osorio, and C. Zepeda, “A general theory of confluent rewriting systems for logic programming and its applications,” Annals of Pure and Applied Logic, vol. 108, no. 1-3, pp. 153–188, 2001. View at Publisher · View at Google Scholar · View at Scopus
  5. J.-H. You and L. Y. Yuan, “A three-valued semantics for deductive databases and logic programs,” Journal of Computer and System Sciences, vol. 49, no. 2, pp. 334–361, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. T. C. Przymusinski, “Well-founded completions of logic programs,” in Proceedings of the 8th International Conference Logic Programming, pp. 726–741, June 1991. View at Scopus
  7. P. M. Dung, “On the relations between stable and well-founded semantics of logic programs,” Theoretical Computer Science, vol. 105, no. 1, pp. 7–25, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. D. Pearce, “Stable inference as intuitionistic validity,” Journal of Logic Programming, vol. 38, no. 1, pp. 79–91, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. J. Arrazola, J. Dix, and M. Osorio, “Confluent rewriting systems in non-monotonic reasoning,” Computación y Sistemas, vol. 2, pp. 104–123, 1999. View at Google Scholar
  10. M. Osorio and F. Zacarias, “High-Level Logic Programming,” in Foundations of Information and Knowledge Systems, Lecture Notes in Computer Science, pp. 226–240, Springer Berlin Heidelberg, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  11. A. V. Gelder, K. A. Ross, and J. S. Schlipf, “The well-founded semantics for general logic programs,” Journal of the ACM, vol. 38, no. 3, pp. 620–650, 1991. View at Google Scholar · View at MathSciNet
  12. J. W. Lloyd, Foundations of Logic Programming, Springer, Berlin, Germany, 1987.
  13. D. van Dalen, Logic and Structure, Springer-Verlag, Berlin, Germany, 3rd edition, 1994.
  14. S. Brass and J. Dix, “Characterizations of the disjunctive stable semantics by partial evaluation,” Journal of Logic Programming, vol. 32, no. 3, pp. 207–228, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. K. L. Clark, “Logic and Databases,” in chapter Negation as Failure, pp. 293–322, Plenum Press, 1978. View at Google Scholar
  16. S. Brass and J. Dix, “Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated gcwa,” Journal of Automated Reasoning, vol. 20, no. 1, pp. 143–165, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  17. G. Brewka, J. Dix, and K. Konolige, Nonmonotonic Reasoning: An overview, CSLI Lectures Notes 73, CSLI Publications, Stanford, CA, USA, 1997.
  18. S. Brass, U. Zukowski, and B. Freitag, “Transformation-based bottom-up computation of the well-founded model,” in Non-Monotonic Extensions of Logic Programming, NMELP '96, T. C. P. Jürgen Dix and L. M. Pereira, Eds., vol. 1216 of Lecture Notes in Computer Science, pp. 171–201, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  19. M. Osorio, J. A. Navarro, and J. Arrazola, “Equivalence in answer set programming,” in Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, pp. 57–75, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  20. S. Greco, “Minimal founded semantics for disjunctive logic programming,” LPNMR, pp. 221–235, 1999. View at Google Scholar
  21. C. Baral and M. Gelfond, “Logic programming and knowledge representation,” The Journal of Logic Programming, vol. 19-20, no. 1, pp. 73–148, 1994. View at Publisher · View at Google Scholar · View at Scopus
  22. J. Dix, “The logic programming paradigm,” AI Communications, vol. 11, no. 2, pp. 123–131, 1998. View at Google Scholar · View at Scopus
  23. M. Osorio and B. Jayaraman, “Aggregation and negation-as-failure,” New Generation Computing, vol. 17, no. 3, pp. 255–284, 1999. View at Publisher · View at Google Scholar · View at Scopus
  24. A. V. Gelder, “The well-founded semantics of aggregation,” PODS, pp. 127–138, 1992. View at Google Scholar
  25. M. Osorio, J. Diaz, and A. Santoyo, “0-1 integer programming for computing semi-stable semantics of argumentation frameworks,” Computación y Sistemas, vol. 21, no. 3, pp. 457–471, 2017. View at Google Scholar
  26. J. Dix, “A classification theory of semantics of normal logic programs. I. Strong properties,” Fundamenta Informaticae, vol. 22, no. 3, pp. 227–255, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. M. Osorio, J. A. Navarro, J. R. Arrazola, and V. Borja, “Logics with Common Weak Completions,” Journal of Logic and Computation, vol. 16, no. 6, pp. 867–890, 2006. View at Google Scholar
  28. M. Osorio, J. C. Nieves, and C. Giannella, “Useful Transformations in Answer Set Programming,” in Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning (AAAI Spring 2001 Symposium), A. Provetti and S. T. Cao, Eds., Stanford, USA, March 2001. View at Google Scholar
  29. J. C. Nieves, M. Osorio, and U. Cortés, “Semantics for possibilistic disjunctive programs,” Theory and Practice of Logic Programming, vol. 13, no. 1, pp. 33–70, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  30. J. C. Nieves, U. Cortés, and M. Osorio, “Preferred extensions as stable models,” Theory and Practice of Logic Programming, vol. 8, no. 4, pp. 527–543, July 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  31. P. M. Dung, “On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games,” Artificial Intelligence, vol. 77, no. 2, pp. 321–357, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  32. J. C. Nieves, M. Osorio, and C. Zepeda, “A schema for generating relevant logic programming semantics and its applications in argumentation theory,” Fundamenta Informaticae, vol. 106, no. 2-4, pp. 295–319, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus