bases (Motik and Rosati 2007) and Winslett's minimal change update operator (Winslett 1990).

We believe that this new area of research brings exciting new problems to solve and bridges a number of existing research areas. It will certainly provide useful results for many applications and perhaps even contribute to finding further philosophical insights into how human knowledge evolves.

## References

Alchourron, C. E. ´ , Gardenfors, P. ¨ , and Makinson, D. **1985. On the logic of theory**
change: Partial meet contraction and revision functions. **Journal of Symbolic Logic 50,** 2, 510–530.

Alferes, J. J., Banti, F., Brogi, A., and Leite, J. A. **2005. The refined extension**
principle for semantics of dynamic logic programming. Studia Logica 79, **1, 7–32.**
Alferes, J. J., Knorr, M., and Swift, T. **2009. Queries to hybrid MKNF knowledge**
bases through oracular tabling. In **Proceedings of the 8th International Semantic Web** Conference (ISWC 2009)**. 1–16.**
Alferes, J. J., Leite, J. A., Pereira, L. M., Przymusinska, H., and Przymusinski, T. C. 2000. Dynamic updates of non-monotonic knowledge bases. **The Journal of Logic**
Programming 45, **1-3 (September/October), 43–70.**
Baader, F., Calvanese, D., McGuinness, D. L., Nardi, D., and Patel-Schneider, P. F., Eds. 2003. The Description Logic Handbook: Theory, Implementation, and Applications**. Cambridge University Press.**
Berners-Lee, T., Hendler, J., and Lassila, O. 2001. The semantic web. **Scientific**
American 284, **5, 28–37.**
Dalal, M. 1988. Investigations into a theory of knowledge base revision. In **Proceedings**
of the 7th National Conference on Artificial Intelligence (AAAI 1988)**. AAAI Press /** The MIT Press, St. Paul, MN, USA, 475–479.

Davey, B. A. and Priestley, H. A. 1990. Introduction to Lattices and Order**. Cambridge**
University Press.

Delgrande, J. P., Schaub, T., Tompits, H., and Woltran, S. 2008. Belief revision of logic programs under answer set semantics. In **Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR**
2008)**, G. Brewka and J. Lang, Eds. AAAI Press, Sydney, Australia, 411–421.**
Dix, J. **1995. A classification theory of semantics of normal logic programs: I. Strong**
properties. Fundamenta Informaticae 22, **3, 227–255.**
Eiter, T., Fink, M., Sabbatini, G., and Tompits, H. 2002. On properties of update sequences based on causal rejection. **Theory and Practice of Logic Programming**
(TPLP) 2, **6, 721–777.**
Eiter, T. and Wang, K. 2008. Semantic forgetting in answer set programming. **Artificial**
Intelligence 172, **14, 1644–1672.**
Flouris, G., Makanatas, D., Kondylakis, H., Plexousakis, D., and Antoniou, G. 2008. Ontology change: classification and survey. The Knowledge Engineering Review 23, **2, 117–152.**
Gelder, A. V., Ross, K. A., and Schlipf, J. S. **1991. The well-founded semantics for**
general logic programs. Journal of the ACM 38, **3, 620–650.**
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In **Proceedings of the 5th International Conference and Symposium on Logic**
Programming (ICLP/SLP 1988)**, R. A. Kowalski and K. A. Bowen, Eds. MIT Press,** Seattle, Washington, 1070–1080.