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 条
  • [21] FIXED-PARAMETER TRACTABILITY OF MULTICUT PARAMETERIZED BY THE SIZE OF THE CUTSET
    Marx, Daniel
    Razgon, Igor
    SIAM JOURNAL ON COMPUTING, 2014, 43 (02) : 355 - 388
  • [22] Fixed-parameter tractability of anonymizing data by suppressing entries
    Chaytor, Rhonda
    Evans, Patricia A.
    Wareham, Todd
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 23 - +
  • [23] On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
    Coro, Federico
    D'Angelo, Gianlorenzo
    Mkrtchyan, Vahan
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (06) : 1094 - 1109
  • [24] Fixed-Parameter Tractability of Maximum Colored Path and Beyond
    V. Fomin, Fedor
    Golovach, Petr a.
    Korhonen, Tuukka
    Simonov, Kirill
    Plattner, Hasso
    Stamoulis, Giannos
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (04)
  • [25] Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables
    Robert Crowston
    Gregory Gutin
    Mark Jones
    Venkatesh Raman
    Saket Saurabh
    Anders Yeo
    Algorithmica, 2014, 68 : 739 - 757
  • [26] Fixed-Parameter Tractability of (n − k) List Coloring
    Aritra Banik
    Ashwin Jacob
    Vijay Kumar Paliwal
    Venkatesh Raman
    Theory of Computing Systems, 2020, 64 : 1307 - 1316
  • [27] Fixed-parameter tractability of anonymizing data by suppressing entries
    Patricia A. Evans
    H. Todd Wareham
    Rhonda Chaytor
    Journal of Combinatorial Optimization, 2009, 18 : 362 - 375
  • [28] FIXED-PARAMETER TRACTABILITY OF MULTICUT IN DIRECTED ACYCLIC GRAPHS
    Kratsch, Stefan
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Wahlstroem, Magnus
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (01) : 122 - 144
  • [29] Fixed-Parameter Tractability of (n - k) List Coloring
    Banik, Aritra
    Jacob, Ashwin
    Paliwal, Vijay Kumar
    Raman, Venkatesh
    COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 61 - 69
  • [30] Fixed-parameter tractability of the Maximum Agreement Supertree problem
    Guillemot, Sylvain
    Berry, Vincent
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 274 - +
12345