摘要
In this paper, the parameter which is the source of the complexity of disjunctionfree 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.
基金
the MOE project "Computational Complexity of Intelligent Reasoning"，国家自然科学基金
