1. Ackermann W (1935) Untersuchungen über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen 110:390–413.
http://eudml.org/doc/159730
2. Alassaf R, Schmidt RA (2017) A preliminary comparison of the forgetting solutions computed using SCAN, LETHE and FAME. In: Koopmann P, Rudolph S, Schmidt RA, Wernhard C (eds) Proceedings of the workshop on second-order quantifier elimination and related topics (SOQE 2017), 6–8 Dec 2017. CEUR workshop proceedings, vol 2013. Dresden, Germany, pp 21–26.
http://ceur-ws.org/Vol-2013/paper12.pdf
3. Alchourrón C, Gärdenfors P, Makinson D (1985) On the logic of theory change: partial meet contraction and revision functions. J Symb Log 50(2):510–530
4. Alferes JJ, Knorr M, Wang K (2013) Forgetting under the well-founded semantics. In: Cabalar P, Son TC (eds) Logic programming and nonmonotonic reasoning, 12th international conference, LPNMR 2013, Corunna, Spain, 15–19 Sept 2013. Lecture notes in computer science, vol 8148. Proceedings, Springer, pp 36–41.
https://doi.org/10.1007/978-3-642-40564-8_4
5. Antoniou G, Eiter T, Wang K (2012) Forgetting for defeasible logic. In: Bjørner N, Voronkov A (eds) Logic for programming, artificial intelligence, and reasoning—18th international conference, LPAR-18, Mérida, Venezuela, 11–15 March 2012. Lecture notes in computer science, vol 7180. Proceedings, Springer, pp 77–91.
https://doi.org/10.1007/978-3-642-28717-6_9