Abstract
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 π p2 -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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.J. Alferes, et al, Dynamic logic programming. In Proceedings of KR-98, pp 98–109, 1998.
R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12 (1994) 53–87.
G. Brewka and T. Eiter, Preferred answer sets for extended logic programs. Artificial Intelligence, 109 (1999) 297–356.
T. Eiter and G. Gottlob, On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15 (1995) 289–323.
M. Garey and D. Johnson, Computers and Intractability, Freeman, San Franciso, 1979.
M. Gelfond and V. Lifschitz, The stable model semantics for logic programming. In Proceedings of the Fifth Joint International Conference and Symposium, pp 1070–1080. MIT Press, 1988.
M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases. New Generation Computing, 9 (1991) 365–386.
P. Liberatore, The complexity of belief update. Artificial Intelligence 119 (2000) 141–190.
T.C. Przymusinski and H. Turner, Update by means of inference rules. In Proceedings of LPNMR’95, pp 156–174, 1995.
Zhang and N.Y. Foo, Answer sets for prioritized logic programs. In Proceedings of the 1997 International Logic Programming Symposium (ILPS’97), pp 69–83. MIT Press, 1997
Y. Zhang, Logic program based update (full version). Manuscript, November, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Y. (2001). The Complexity of Logic Program Updates. In: Stumptner, M., Corbett, D., Brooks, M. (eds) AI 2001: Advances in Artificial Intelligence. AI 2001. Lecture Notes in Computer Science(), vol 2256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45656-2_54
Download citation
DOI: https://doi.org/10.1007/3-540-45656-2_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42960-9
Online ISBN: 978-3-540-45656-8
eBook Packages: Springer Book Archive