Answer sets for prioritized logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Preferred answer sets for extended logic programs
Artificial Intelligence
The complexity of belief update
Artificial Intelligence
Update by Means of Inference Rules
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
ACM Transactions on Computational Logic (TOCL)
Handling defeasibilities in action domains
Theory and Practice of Logic Programming
Two results for prioritized logic programming
Theory and Practice of Logic Programming
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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 驴2P -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.