1. Adaricheva, K., Sloan, R.H., Szörényi, B., Turán, G.: Horn belief contraction: remainders, envelopes and complexity. In: Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR), May 2012
2. Ajtai, M., Fagin, R.: Reachability is harder for directed than for undirected finite graphs. J. Symbolic Logic 55(1), 113–150 (1990)
3. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symbolic Logic 50(2), 510–530 (1985)
4. Ben-Naim, J.: Lack of finite characterizations for the distance-based revision. In: 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 239–248 (2006)
5. Booth, R., Meyer, T., Varzinczak, I., Wassermann, R.: A contraction core for Horn belief change: preliminary report. In: 13th International Workshop on Non-monotonic Reasoning (NMR) (2010)