We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Wang Kewen, Chen Huowang, Wu Quanyuan. The Least Fixpoint Transformation for Disjunctive Logic Programs[J]. Journal of Computer Science and Technology, 1998, 13(3): 193-201.
Citation: Wang Kewen, Chen Huowang, Wu Quanyuan. The Least Fixpoint Transformation for Disjunctive Logic Programs[J]. Journal of Computer Science and Technology, 1998, 13(3): 193-201.

The Least Fixpoint Transformation for Disjunctive Logic Programs

More Information
  • Published Date: May 09, 1998
  • The paradigm of disjunctive logic programming (DLP) enhances greatly the expressive power of normal logic programming (NLP) and many (declarative) semantics have beeu 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 operator TGP for each disjunctive program and shows that TGP has the…
  • [1]
    Minker J. Overview of disjunctive logic programming. Ann. Math. and Al., 1994, 12:1-24.
    [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.
    [3]
    Wang Kewen. On Disjunctive Logic Programming and Abduction. Ph.D. Dissertation, Nankai Institute of Mathematics, 1996, 4. ……….

Catalog

    Article views (10) PDF downloads (1175) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return