[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

The least fixpoint transformation for disjunctive logic programs

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

Abstract

The paradigm of disjunctive logic programming (DLP) enhances greatly the expressive power of normal logic programming (NLP) and many (declarative) semantics have been defined for DLP to cope with various problems of knowledge representation in artificial intelligence. However, the expressive ability of the semantics and the soundness of program transformations for DLP have been rarely explored. This paper defines an immediate consequence operatorT GP for each disjunctive program and shows thatT GP has the least and computable fixpointLft(P). Lft is, in fact, a program transformation for DLP, which transforms all disjunctive programs into negative programs. It is shown thatLft preserves many key semantics, including the disjunctive stable models, well-founded model, disjunctive argument semantics DAS, three-valued models, etc. This means that every disjunctive programP has a unique canonical formLft(P) with respect to these semantics. As a result, the work in this paper provides a unifying framework for studying the expressive ability of various semantics for DLP. On the other hand, the computing of the above semantics for negative programs is just a trivial task, therefore,Lft(P) is also an optimization method for DLP. Another application ofLft is to derive some interesting semantic results for DLP.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Minker J. Overview of disjunctive logic programming.Ann. Math. and AI., 1994, 12: 1–24.

    MathSciNet  Google Scholar 

  2. Wang K W, Wu Q Y, Chen H W. Argumentation in disjunctive logic programming.Science in China Ser. E, 1998, 41(1): 106–112.

    Article  MATH  MathSciNet  Google Scholar 

  3. Wang Kewen. On Disjunctive Logic Programming and Abduction. Ph.D. Dissertation, Nankai Institute of Mathematics, 1996, 4.

  4. Lloyd J. Foundations of Logic Programming (2nd Edition). Springer, 1987

  5. Lobo J, Minker J, Rajaskar A. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

  6. Minker J, Rajasekar A. A fixed point semantics for disjunctive logic programs.J. Logic Programming, 1990, 9: 45–74.

    Article  MATH  MathSciNet  Google Scholar 

  7. Yahya A, Henschen L. Deduction in non-Horn databases.J. Automated Reasoning, 1985, 1: 141–160.

    Article  MATH  MathSciNet  Google Scholar 

  8. Wang K W. Foundation to bi-dišjunctive logic programming I.Chinese Journal of Computers, 1997, 20(4): 194–201.

    Google Scholar 

  9. Wang K W. Foundation to bi-disjunctive logic programming II.Chinese Journal of Computers, 1997, 20(4): 202–208.

    Google Scholar 

  10. Wang K W, Chen H W, Wu Q Y. Consistency-based abduction with extended disjunctive logic programs.Science in China E, 1997, 27(3): 574–582.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Changsha Institute of Technology, 410073, Changsha, P. R. China

    Wang Kewen, Chen Huowang & Wu Quanyuan

Authors
  1. Wang Kewen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen Huowang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wu Quanyuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is partially supported by the National ‘863’ Hi-Tech Program of China.

Wang Kewen is a post-doctor in School of Computer, Changsha Institute of Technology. He received his Ph.D. degree in Mathematics from Nankai University. His current research interests include knowledge representation, applied logics and logic programming.

Chen Huowang is a Professor of Computer Science, Changsha Institute of Technology. He graduated from Department of Mathematics, Fudan, University. His current research interests include artificial intelligence, software engineering.

Wu Quanyuan is a Professor of Computer Science, Changsha Institute of Technology. He graduated from Department of Mathematics, Fudan, University. His current research interests include knowledge engineering, distributed computing and object-oriented technology.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, K., Chen, H. & Wu, Q. The least fixpoint transformation for disjunctive logic programs. J. of Comput. Sci. & Technol. 13, 193–201 (1998). https://doi.org/10.1007/BF02943187

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943187

Keywords

Search

Navigation