Abstract
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.
Similar content being viewed by others
References
Downey R, Fellows M. Parameterized Complexity. Springer, New York, 1999.
Gottlob G, Scarcello F, Sideri M. Fixed-parameter complexity in AI and nonmonotonic reasoning.Lecture Notes in Artificial Intelligence, Gelfond M, Leone N, Pfeifer G (eds.), 1999, Vol.1730, pp.1–18.
Truszczyński M. Computing large and small stable models. InProc. the 16th International Conference on Logic Programming, Las Cruces, New Mexico, 1999.
Reiter R. A logic for default reasoning.Artificial Intelligence, 1980, 13(1–2): pp.81–132.
Marek W, Truszczyński M. Nonmonotonic Logic. Springer-Verlag, Berlin, 1993.
Su K. Constraints on extensions of a default theory.Journal of Computer Science and Technology, 2001, 16(4): pp.329–340.
Su K. More on representation theory for default logic.Information and Computation, 2001, 169(1): pp.81–93.
Gottlob G. Complexity results for non-monotonic logics.J. Logic and Comput., 1992, 2(3): pp.397–425.
Cadoli M, Schaerf M. A survey of complexity results for non-monotonic logics.J. Logic Programming, 1993, 17(2): pp.127–160.
Stillman J. The complexity of propositional default logics. InProc. the 10th National Conference on Artificial Intelligence (AAA-92), San Jose, CA, 1992, pp.794–799.
Ben-Eliyahu R, Dechter R. Default logic, propositional logic and constraints. InProc. 9th National Conference on Artificial Intelligence (AAAI-91), 1991.
Ben-Eliyahu R, Dechter R. Propositional semantics for default logic. Technical Report R-163, Cognitive Systems Laboratory, Computer Science Department, University of California at Los Angeles, July, 1992.
Cadoli M. Tractable Reasoning in Artificial Intelligence. Springer, Berlin, 1994.
Cadoli M, Donini F M, Schaerf M. Is intractability of non-monotonic reasoning a real drawback?Artificial Intelligence, 1996, 88(2): 215–251.
Dimopoulos Y, Magirou V. A graph theoretic approach to default logic.Inform. and Comput., 1994, 112(3): 239–256.
Kautz H A, Selman B. Hard problems for simple default logics.Artificial Intelligence, 1990, 42(1–3): 311–348.
Stillman J. It's not my default: The complexity of membership problems in restricted propositional default logics. InProc. the 8th National Conference on Artificial Intelligence (AAA-90), Boston, MA, 1990, pp.571–579.
Zhao X S, Ding D C. Complexity results for restricted credulous default reasoning.AI Communications, 2000, 13(4): 249–257.
Zhao X S, Ding D C. Complexity results for 2CNF default theories.Fundamenta Informaticae, 2001, 45(4): 393–404.
Etherington D V. Reasoning with Incomplete Information. Morgan Kaufman, Los Altos, CA, 1987.
Touretzky D S. The Mathematics of Inheritance Systems. Morgan Kaufman, Los Altos, CA, 1988.
Konolige K. On the relation between default and autoepistemic logic.Artificial Intelligence, 1988, 35(3): 343–382.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by the MOE project “Computational Complexity of Intelligent Reasoning” (Grant No.01JB72040001) and the National Natural Science Foundation of China for the Project “Study of Fixed Parameter Complexity for Hard Computation Problems and Its Application” (Grant No.10161005).
Rights and permissions
About this article
Cite this article
Zhao, X., Ding, D. Fixed-parameter tractability of disjunction-free default reasoning. J. Comput. Sci. & Technol. 18, 118–124 (2003). https://doi.org/10.1007/BF02946660
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946660