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 条
  • [41] Fixed-parameter tractability results for feedback set problems in tournaments
    Dom, Michael
    Guo, Jiong
    Hueffner, Falk
    Niedermeier, Rolf
    Truss, Anke
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 320 - 331
  • [42] On the fixed-parameter tractability of parameterized model-checking problems
    Stewart, Iain A.
    INFORMATION PROCESSING LETTERS, 2008, 106 (01) : 33 - 36
  • [43] Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
    Zhu, Binhai
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 71 - 80
  • [44] Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems
    Chen, Hubie
    Gottlob, Georg
    Lanzinger, Matthias
    Pichler, Reinhard
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 1726 - 1733
  • [45] Fixed-parameter tractability results for feedback set problems in tournaments
    Dom, Michael
    Guo, Jiong
    Hueffner, Falk
    Niedermeier, Rolf
    Truss, Anke
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (01) : 76 - 86
  • [46] Fixed-parameter tractability of capacitated k-facility location
    Kong, Xiangyan
    Zhang, Zhen
    FRONTIERS OF COMPUTER SCIENCE, 2023, 17 (06)
  • [47] Subexponential time and fixed-parameter tractability: Exploiting the miniaturization mapping
    Chen, Yijia
    Fium, Joerg
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2007, 4646 : 389 - +
  • [48] Fixed-parameter tractability of capacitated k-facility location
    Xiangyan KONG
    Zhen ZHANG
    Frontiers of Computer Science, 2023, 17 (06) : 165 - 167
  • [49] Fixed-Parameter Tractability of Graph Isomorphism in Graphs with an Excluded Minor
    Lokshtanov, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Saurabh, Saket
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 914 - 923
  • [50] FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .1. BASIC RESULTS
    DOWNEY, RG
    FELLOWS, MR
    SIAM JOURNAL ON COMPUTING, 1995, 24 (04) : 873 - 921
12345