In the context of logic program updates, a knowledge base, which is presented as a logic program, can be updated in terms of another logic program, i.e. a set of update rules. In this paper, we investigate the complexity of logic program updates where conflict resolution on defeasible information is explicitly taken into account in an update. We show that in general the problem of model checking in logic program updates is co-NP-complete, and the corresponding inference problem is ΠP 2 -complete. We also characterize particular classes of update specifications where the inference problem has a lower computational complexity. These results confirm that logic program update, even if with the issue of conflict resolution on defeasible information to be presented, is not harder than the principal update tasks.
CITATION STYLE
Zhang, Y. (2001). The complexity of logic program updates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2256, pp. 631–642). Springer Verlag. https://doi.org/10.1007/3-540-45656-2_54
Mendeley helps you to discover research relevant for your work.