Fixed-parameter tractability of disjunction-free default reasoning

被引：2
|
作者：
Zhao, XS [1 ]
Ding, DC
机构：
[1] Zhongshan Univ, Inst Log & Cognit, Guangzhou 510275, Peoples R China
[2] Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China
来源：
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY | 2003年 / 18卷 / 01期
关键词：
disjunction-free default; fixed-parameter tractability; credulous reasoning; skeptical reasoning;
D O I：
10.1007/BF02946660
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, the parameter which is the source of the complexity of disjunction-free default reasoning is determined. It is shown that when the value of this parameter is fixed, the disjunction-free default reasoning can be solved in time bounded by a polynomial whose degree does not depend on the parameter. Consequently, disjunction-free default reasoning is fixed parameter tractable.
引用
收藏
页码：118 / 124
页数：7
相关论文
共 50 条
  • [1] Fixed-parameter tractability of disjunction-free default reasoning
    XiShun Zhao
    DeCheng Ding
    Journal of Computer Science and Technology, 2003, 18 : 118 - 124
  • [2] Fixed-parameter tractability
    Samer, Marko
    Szeider, Stefan
    Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) : 425 - 454
  • [3] Parameterized Complexity and Fixed-Parameter Tractability of Description Logic Reasoning
    Motik, Boris
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING (LPAR-18), 2012, 7180 : 13 - 14
  • [4] Regular disjunction-free default theories
    Xi-Shun Zhao
    Journal of Computer Science and Technology, 2004, 19 : 329 - 340
  • [5] Regular disjunction-free default theories
    Zhao, XS
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (03) : 329 - 340
  • [6] Scheduling and fixed-parameter tractability
    Mnich, Matthias
    Wiese, Andreas
    MATHEMATICAL PROGRAMMING, 2015, 154 (1-2) : 533 - 562
  • [7] Scheduling and fixed-parameter tractability
    Matthias Mnich
    Andreas Wiese
    Mathematical Programming, 2015, 154 : 533 - 562
  • [8] Minimizing Movement: Fixed-Parameter Tractability
    Demaine, Erik D.
    Hajiaghayi, MohammadTaghi
    Marx, Daniel
    ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 718 - +
  • [9] Minimizing Movement: Fixed-Parameter Tractability
    Demaine, Erik D.
    Hajiaghayi, Mohammadtaghi
    Marx, Daniel
    ACM TRANSACTIONS ON ALGORITHMS, 2014, 11 (02) : 1 - 29
  • [10] Bounded fixed-parameter tractability and reducibility
    Downey, Rod
    Flum, Joerg
    Grohe, Martin
    Weyer, Mark
    ANNALS OF PURE AND APPLIED LOGIC, 2007, 148 (1-3) : 1 - 19
12345