Skip to main content
SpringerLink
Log in

Consistency Property of Finite FC-Normal Logic Programs

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

Abstract

Marek’s forward-chaining construction is one of the important techniques for investigating the non-monotonic reasoning. By introduction of consistency property over a logic program, they proposed a class of logic programs, FC-normal programs, each of which has at least one stable model. However, it is not clear how to choose one appropriate consistency property for deciding whether or not a logic program is FC-normal. In this paper, we firstly discover that, for any finite logic program Π, there exists the least consistency property LCon (Π) over Π, which just depends on Π itself, such that, Π is FC-normal if and only if Π is FC-normal with respect to (w.r.t.) LCon (Π). Actually, in order to determine the FC-normality of a logic program, it is sufficient to check the monotonic closed sets in LCon (Π) for all non-monotonic rules, that is LFC (Π). Secondly, we present an algorithm for computing LFC (Π). Finally, we reveal that the brave reasoning task and cautious reasoning task for FC-normal logic programs are of the same difficulty as that of normal 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. Michael Gelfond, Vladimir Lifschitz. The stable model semantics for logic programming. In Proc. Fifth International Conference and Symposium on Logic Programming, Seattle, Washington, 1988, pp.1070–1080.

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

    Google Scholar 

  3. Vladimir Lifschitz. Answer set programming and plan generation. Artif. Intell., 2002, 138(1-2): 39–54.

    Article  MATH  Google Scholar 

  4. Chitta Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, 2003.

  5. Marek V W, Nerode A, Remmel J B. Logic programs, well-ordering, and forward chaining. Annals of Pure and Applied Logic, 1999, 96: 231–276.

    Article  MATH  Google Scholar 

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

  7. Daoyun Xu, Decheng Ding. Fc-normal and extended stratified logic program. Science in China (Series F), 2002, 45(4): 259–272.

    MATH  Google Scholar 

  8. Evgeny Dantsin, Thomas Eiter, Georg Gottlob et al. Complexity and expressive power of logic programming. ACM Computing Surveys, 2001, 33(3): 374–425.

    Article  Google Scholar 

  9. Gottlob G, Scarcello F, Sideri M. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 2002, 138(1-2): 55–86.

    Article  MATH  Google Scholar 

  10. V Wiktor Marek, Miroslaw Truszczynski. Autoepistemic logic. J. ACM, 1991, 38(3): 588–619.

    Article  MATH  Google Scholar 

  11. Fangzhen Lin, Xishun Zhao. On odd and even cycles in normal logic programs. In Proc. the 19th National Conference on Artificial Intelligence (AAAI-2004), Menlo Park, CA., AAAI Press, 2004, pp.80–85.

  12. Henry A Kautz, Bart Selman. Hard problems for simple default logics. Artif. Intell., 1991, 49(1-3): 243–279.

    Article  MATH  Google Scholar 

  13. Mingyi Zhang, Ying Zhang, Yisong Wang. On compatibility and forward chaining normality. In Proc. NMR06 Workshop, Lake District, UK, 2006, pp.163–171.

  14. Zhang Mingyi. A characterization of extension of general default theories. In Proc. 9th Cannadian Conference on Artificial Intelligence, Vancouver, BC, Canada, 1992, pp.134–139.

  15. Zheng Chuanjin. Extensions and strong compatible subsets of defaults. Chinese Journal of Computers, 1994, 17(2): 142–146.

    Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Guizhou University, Guiyang, 550025, China

    Yi-Song Wang

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

    Ming-Yi Zhang

  3. Institute of Logic and Cognition, Sun Yat-Sen University, Guangzhou, 510275, China

    Yu-Ping Shen

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. Yu-Ping Shen
    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 is partially supported by the National Natural Science Foundation of China under Grant No. 60573009 and the Stadholder Foundation of Guizhou Province under Grant No. 2005(212).

Electronic Supplementary Material

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, YS., Zhang, MY. & Shen, YP. Consistency Property of Finite FC-Normal Logic Programs. J Comput Sci Technol 22, 554–561 (2007). https://doi.org/10.1007/s11390-007-9071-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-007-9071-1

Keywords

Search

Navigation