Complexity results for restricted credulous default reasoning

Article type: Research Article

Authors: Zhao, Xishun^{; ;} | Ding, Decheng | Kleine Büning, Hans

Affiliations: Department of Mathematics, Henan Normal University, Xinxiang 453002, P.R. China E‐mail: zxsy@public.xxptt.ha.cn | Department of Mathematics, Nanjing University, Nanjing 210093, P.R. China E‐mail: dcding@netra.nju.edu.cn | Department of Mathematics and Computer Science, Paderborn University, 33095 Paderborn, Germany E‐mail: kbcsl@uni‐paderborn.de

Note: [] Corresponding author.

Abstract: This paper concentrates on the complexity of the decision problem deciding whether a literal belongs to at least one extension of a default theory 〈D,W〉 in which D is a set of Horn defaults and W is a definite Horn formula or a Bi‐Horn formula.

Keywords: Default logic, Horn default, credulous reasoning

Journal: AI Communications, vol. 13, no. 4, pp. 249-257, 2000