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 条
  • [11] Jungles, bundles, and fixed-parameter tractability
    Fomin, Fedor V.
    Pilipczuk, Michal
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 396 - 413
  • [12] Fixed-parameter tractability for the Tree Assembly problem
    Shi, Feng
    You, Jie
    Zhang, Zhen
    Liu, Jingyi
    Wang, Jianxin
    THEORETICAL COMPUTER SCIENCE, 2021, 886 : 3 - 12
  • [13] Disjunction-Free Disjunction Property
    Jerabek, Emil
    UNITY OF LOGIC AND COMPUTATION, CIE 2023, 2023, 13967 : XLI - XLII
  • [14] Fixed-parameter tractability of anonymizing data by suppressing entries
    Evans, Patricia A.
    Wareham, H. Todd
    Chaytor, Rhonda
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (04) : 362 - 375
  • [15] Fixed-Parameter Tractability of Maximum Colored Path and Beyond
    Fomin, Fedor, V
    Golovach, Petr A.
    Korhonen, Tuukka
    Simonov, Kirill
    Stamoulis, Giannos
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 3700 - 3712
  • [16] Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
    Marx, Daniel
    Razgon, Igor
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 469 - 478
  • [17] Fixed-Parameter Tractability of (n - k) List Coloring
    Banik, Aritra
    Jacob, Ashwin
    Paliwal, Vijay Kumar
    Raman, Venkatesh
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (07) : 1307 - 1316
  • [18] On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
    Federico Corò
    Gianlorenzo D’Angelo
    Vahan Mkrtchyan
    Theory of Computing Systems, 2020, 64 : 1094 - 1109
  • [19] Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
    Kratsch, Stefan
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wahlstroem, Magnus
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, 2012, 7391 : 581 - 593
  • [20] Fixed-Parameter Tractability of Token Jumping on Planar Graphs
    Ito, Takehiro
    Kaminski, Marcin
    Ono, Hirotaka
    ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 208 - 219
12345