Skip to main content
SpringerLink
Log in

Logic Programs, Compatibility and Forward Chaining Construction

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Logic programming under the stable model semantics is proposed as a non-monotonic language for knowledge representation and reasoning in artificial intelligence. In this paper, we explore and extend the notion of compatibility and the Λ operator, which were first proposed by Zhang to characterize default theories. First, we present a new characterization of stable models of a logic program and show that an extended notion of compatibility can characterize stable submodels. We further propose the notion of weak auto-compatibility which characterizes the Normal Forward Chaining Construction proposed by Marek, Nerode and Remmel. Previously, this construction was only known to construct the stable models of FC-normal logic programs, which turn out to be a proper subclass of weakly auto-compatible logic programs. We investigate the properties and complexity issues for weakly auto-compatible logic programs and compare them with some subclasses of logic programs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Frank Van Harmelen, Vladimir Lifschitz, Bruce Porter (eds.). Handbook of Knowledge Representation. Elsevier, 2008.

  2. Baral C. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, 2003.

  3. Gelfond M, Lifschitz V. The stable model semantics for logic programming. In Proc. the Fifth International Conference and Symposium on Logic Programming, Seattle, Washington, Aug. 15–19, 1988, pp.1070–1080.

  4. Lifschitz V. Answer set programming and plan generation. Artificial Intelligence, 2002, 138(1/2): 39–54.

    Article  MATH  MathSciNet  Google Scholar 

  5. Marek V W, Truszczynski M. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm: A 25-Year Perspective. Apt K R, Marek V W, Truszczynski M, Warren D S (eds.), Springer-Verlag, 1999, pp.375–398.

  6. Niemelä I. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 1999, 25(3/4): 241–273.

    Article  MATH  MathSciNet  Google Scholar 

  7. Zhao X S, Shen Y P. Comparison of semantics of disjunctive logic programs based on model-equivalent reduction. Journal of Computer Science and Technology, 2007,22(4): 562–568.

    Article  MathSciNet  Google Scholar 

  8. Chen W, Zhang M Y, Wu M N. Logic-program-based negotiation mechanism. Journal of Computer Science and Technology, 2009, 24(4): 753–760.

    Article  Google Scholar 

  9. Lifschitz V. Twelve definitions of a stable model. In Proc. the 24th Int. Conf. Logic Programming, LNCS 5366, Udine, Italy, Dec. 9–13, 2008, pp.37–51.

  10. Marek V W, Nerode A, Remmel J B. Logic programs, wellordering, and forward chaining. Annals of Pure and Applied Logic, 1999, 96(1-3): 231–276.

    Article  MATH  MathSciNet  Google Scholar 

  11. Reiter R. A logic for default reasoning. Artificial Intelligence, 1980, 13(1/2): 81–132.

    Article  MATH  MathSciNet  Google Scholar 

  12. Zhang M. A characterization of extension of general default theories. In Proc. the Ninth Canadian Conference on Artificial Intelligence, Vancouver, Canada, 1992, pp.134–139.

  13. Zhang M. A new research into default logic. Information and Computation, 1996, 129(2): 73–85.

    Article  MATH  MathSciNet  Google Scholar 

  14. Dantsin E, Eiter T, Gottlob G, Voronkov A. Complexity and expressive power of logic programming. ACM Computing Surveys, 2001, 33(3): 374–425.

    Article  Google Scholar 

  15. Marek V W, Truszczynski M. Autoepistemic logic. J. ACM, 1991, 38(3): 588–619.

    Article  MATH  MathSciNet  Google Scholar 

  16. Apt K R, Blair H A, Walker A. Towards a theory of declarative knowledge. Foundations of Deductive Databases and Logic Programming, Minker J (ed.), Morgan Kaufmann, Los Altos, 1988, pp.293–322.

  17. Lin F, Zhao X. On odd and even cycles in normal logic programs. In Proc. the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, San Jose, USA, July 25-29, 2004, pp.80–85.

  18. Papadimitriou C H, Yannakakis M. Tie-breaking semantics and structural totality. In Proc. 11th ACM Conference on Principles of Database Systems (PODS 1992), San Diego, USA, June 2–4, 1992, pp.16–22.

  19. Robert Saxon Milnikel. Skeptical reasoning in FC-normal logic programs is π 11 -complete. Fundamenta Informaticae, 2001, 45(3): 237–252.

    MATH  MathSciNet  Google Scholar 

  20. Wang Y, Zhang M, Shen Y. Consistency property of finite FC-normal logic programs. Journal of Computer Science and Technology, 2007, 22(4): 554–561.

    Article  MathSciNet  Google Scholar 

  21. Lloyd J W. Foundations of Logic Programming. 2nd Edition, Springer-Verlag, 1987.

  22. Zhang M, Zhang Y, Wang Y. On compatibility and forward chaining normality. In The Eleventh International Workshop on Non-Monotonic Reasoning, Lake District, UK, May 30–June 1, 2006, pp.163–171.

  23. Martha Sideri Georg Gottlob, Francesco Scarcello. Fixedparameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 2002, 138(1/2): 55–86.

    Article  MATH  MathSciNet  Google Scholar 

  24. William F Dowling, Jean H Gallier. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 1984, 1(3): 267–284.

    Article  MATH  MathSciNet  Google Scholar 

  25. Xu D, Ding D. FC-normal and extended stratified logic program. Science in China (Series F), 2002, 45(4): 259–272.

    MATH  MathSciNet  Google Scholar 

  26. Garey M R, Johnson D S. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.

  27. Kunen K. Signed data dependencies in logic programs. Journal of Logic Programming, 1989, 7(3): 231–245.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Technology, Guizhou University, Guiyang, 550025, China

    Yi-Song Wang (Member, CCF)

  2. School of Computer and Information Science, Southwest University, Chonqing, 400715, China

    Ming-Yi Zhang (Member, CCF)

  3. Guizhou Academy of Sciences, Guiyang, 550001, China

    Ming-Yi Zhang (Member, CCF)

  4. Department of Computing Science, University of Alberta, Alberta, Canada

    Jia-Huai You

Authors
  1. Yi-Song Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming-Yi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jia-Huai You
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ming-Yi Zhang.

Additional information

This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 60963009 and 90718009. Yi-Song Wang was also partially supported by Scientific Research Fund for Talents Recruiting of Guizhou University under Grant No. (2007)042, the Science and Technology Foundation of Guizhou Province under Grant No. [2008]2119 and the Natural Science Foundation of Educational Commission of Guizhou Province under Grant No. (2008)011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, YS., Zhang, MY. & You, JH. Logic Programs, Compatibility and Forward Chaining Construction. J. Comput. Sci. Technol. 24, 1125–1137 (2009). https://doi.org/10.1007/s11390-009-9285-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-009-9285-5

Keywords

Search

Navigation