We use cookies to improve your experience with our site.

Indexed in:

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

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 14 Issue 2
March  1999
Turn off MathJax
Article Contents
Abstract
References
Related Articles
ZHANG Mingyi, ZHANG Ying. Characterizations and Algorithms of Extensionsfor CADL and QDL[J]. Journal of Computer Science and Technology, 1999, 14(2): 140-145.
Citation: ZHANG Mingyi, ZHANG Ying. Characterizations and Algorithms of Extensionsfor CADL and QDL[J]. Journal of Computer Science and Technology, 1999, 14(2): 140-145.
shu

Characterizations and Algorithms of Extensionsfor CADL and QDL

  • Guizhou Acodemy of Sciences; Guiyotng 550001; P. R. China） ZHANG Ying; Department of Cotnputer Science; Cuizhou Unriuersity; Guiyang 550025; P.R. Chiana; Received October 27; 1997; revised January 6; 1998;

More Information
  • Published Date: March 09, 1999
    Abstract
  • Receatly, Giordano and Martelli ( 1994) proposed two new cumu- lative variants of Reiter's default logic (DL) : Commitment to Assumptions Default Logic (CADL) and Quasi-Default Logic (QDL). They have only given quasi-inductive characterizations of extensions for the two variants. In this paper, finite characteri- zatioas of extensions for CADL and QDL by applying notions of (joint) compatibility are presented respectively. And corresponding algorithms and complexity results for reasoning are obtairfed.
    • FullText(HTML)
    • References (3)
  • [1]
    Reiter R. A logic for default reasoning. Artif. Intell., 1980, 13: 81-132.
    [2]
    Brewka G. Cumulative default logic: in defense of nonmonotonic inference rules. Artif.Iretell., 1991, 50: 183-205.
    [3]
    Schaub T. On commitment and cumulativity in default logic. In Proceedings of European Conference on Symbolic and Quantitative Approaches to Uncertainty, R Kruse (ed.), Berlin: Springer, 1991, pp.304-309. ………..
    • Relative Articles

  • Related Articles

    [1]Lin Zhu, Qiang-Sheng Hua, Hai Jin. Joint-Communication Optimal Matrix Multiplication with Asymmetric Memories[J]. Journal of Computer Science and Technology, 2025, 40(3): 835-854. DOI: 10.1007/s11390-023-3489-y
    [2]Ming-Liang Xu, Ning-Bo Gu, Wei-Wei Xu, Ming-Yuan Li, Jun-Xiao Xue, Bing Zhou. Mechanical Assembly Packing Problem Using Joint Constraints[J]. Journal of Computer Science and Technology, 2017, 32(6): 1162-1171. DOI: 10.1007/s11390-017-1791-2
    [3]Ke Liu, Zhi-Yong Liu. Preface: Special Issue on Advances in Computer Science and Technology (Part 1) --- Current Advances in the Research of the NSFC Joint Research Fund for Overseas Chinese Scholars and Scholars in Hong Kong and Macao[J]. Journal of Computer Science and Technology, 2014, 29(4): 547-549. DOI: 10.1007/s11390-014-1448-3
    [4]Yi-Song Wang, Ming-Yi Zhang, Jia-Huai You. Logic Programs, Compatibility and Forward Chaining Construction[J]. Journal of Computer Science and Technology, 2009, 24(6): 1125-1137.
    [5]Zhong-Xuan Liu, Hong-Jian Wang, Si-Long Peng. Image Magnification Method Using Joint Diffusion[J]. Journal of Computer Science and Technology, 2004, 19(5).
    [6]XU DaoYun, DING DeCheng, ZHANG MingYi. Characterization of an Auto-Compatible Default Theory[J]. Journal of Computer Science and Technology, 2003, 18(3).
    [7]SU Kaili. Constraints on Extensions of a Default Theory[J]. Journal of Computer Science and Technology, 2001, 16(4).
    [8]WANG Kewen, ZHOU Lizhu. Closed World Assumption for Disjunctive Reasoning[J]. Journal of Computer Science and Technology, 2001, 16(4).
    [9]Shen Yidong. An Algorithm for Determining Database Consistency Under the Closed World Assumption[J]. Journal of Computer Science and Technology, 1992, 7(4): 289-294.
    [10]Shen Yidong. A Comparison of Closed World Assumptions[J]. Journal of Computer Science and Technology, 1992, 7(3): 243-246.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (30) PDF downloads (1388) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return