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 条
  • [31] Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
    Ganian, Robert
    Peitl, Tomas
    Slivovsky, Friedrich
    Szeider, Stefan
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 392 - 402
  • [32] Fixed-parameter tractability and data reduction for multicut in trees
    Guo, J
    Niedermeier, R
    NETWORKS, 2005, 46 (03) : 124 - 135
  • [33] Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
    Guillemot, Sylvain
    Berry, Vincent
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2010, 7 (02) : 342 - 353
  • [34] Fixed-Parameter Tractability and Characterizations of Small Special Treewidth
    Bodlaender, Hans L.
    Kratsch, Stefan
    Kreuzen, Vincent J. C.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2013, 2013, 8165 : 88 - 99
  • [35] Fixed-parameter tractability and lower bounds for stabbing problems
    Giannopoulos, Panos
    Knauer, Christian
    Rote, Guenter
    Werner, Daniel
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2013, 46 (07): : 839 - 860
  • [36] On fixed-parameter tractability and approximability of NP optimization problems
    Cai, LM
    Chen, JN
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 54 (03) : 465 - 474
  • [37] Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables
    Crowston, Robert
    Gutin, Gregory
    Jones, Mark
    Raman, Venkatesh
    Saurabh, Saket
    Yeo, Anders
    ALGORITHMICA, 2014, 68 (03) : 739 - 757
  • [38] Fixed-Parameter Tractability of Integer Generalized Scoring Rules
    Xia, Lirong
    AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 1599 - 1600
  • [39] Fixed-parameter tractability, definability, and model-checking
    Flum, J
    Grohe, M
    SIAM JOURNAL ON COMPUTING, 2001, 31 (01) : 113 - 145
  • [40] Drawing (Complete) Binary TanglegramsHardness, Approximation, Fixed-Parameter Tractability
    Kevin Buchin
    Maike Buchin
    Jaroslaw Byrka
    Martin Nöllenburg
    Yoshio Okamoto
    Rodrigo I. Silveira
    Alexander Wolff
    Algorithmica, 2012, 62 : 309 - 332
12345