Skip to main content

Advertisement

Springer Nature Link
Log in

A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective

  • Technical Contribution
  • Published:
KI - Künstliche Intelligenz Aims and scope Submit manuscript

Abstract

Forgetting is an ambivalent concept of (human) intelligence. By definition, it is negatively related to knowledge in that knowledge is lost, be it deliberately or not, and therefore, forgetting has not received as much attention in the field of knowledge representation and reasoning (KRR) as other processes with a more positive orientation, like query answering, inference, or update. However, from a cognitive view, forgetting also has an ordering function in the human mind, suppressing information that is deemed irrelevant and improving cognitive capabilities to focus and deal only with relevant aspects of the problem under consideration. In this regard, forgetting is a crucial part of reasoning. This paper collects and surveys approaches to forgetting in the field of knowledge representation and reasoning, highlighting their roles in diverse tasks of knowledge processing, and elaborating on common techniques. We recall forgetting operations for propositional and predicate logic, as well as for answer set programming (as an important representative of nonmonotonic logics) and modal logics. We discuss forgetting in the context of (ir)relevance and (in)dependence, and explicit the role of forgetting for specific tasks of knowledge representation, showing its positive impact on solving KRR problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. Judgment May 13, 2014, http://curia.europa.eu/juris/documents.jsf?num=C-131/12.

  2. https://eur-lex.europa.eu/legal-content/EN/ALL/?uri=CELEX:02016R0679-20160504, enforceable beginning 25 May 2018.

  3. In Latin “Entia non sunt mulitplicanda praeter necessitatem,” attributed to William of Ockham, 14th c.

  4. The rule of necessitation says that when a formula \(\phi\) is derived, we can also derive \(K\phi\). The modality K is here viewed akin to \(\Box\), for which this rule had been originally introduced.

  5. The notion of uniform interpolant will be described in Sect. 7, to which we also defer further discussion of the subject.

References

  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

    Article  MathSciNet  MATH  Google Scholar 

  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

  6. Baader F, Calvanese D, McGuinness D, Nardi D, Patel-Schneider PF (eds) (2003) The description logic handbook: theory, implementation and applications. Cambridge University Press, Cambridge

  7. Baral C, Zhang Y (2005) Knowledge updates: semantics and complexity issues. Artif Intell 164(1–2):209–243. https://doi.org/10.1016/j.artint.2005.01.005

    Article  MathSciNet  MATH  Google Scholar 

  8. Baral C, Giacomo GD, Eiter T (eds) (2014) Principles of knowledge representation and reasoning. In: Proceedings of the fourteenth international conference, KR 2014, 20–24 Jul 2014, AAAI Press, Vienna, Austria. http://www.aaai.org/Library/KR/kr14contents.php

  9. Bertossi LE (2011) Database repairing and consistent query answering. Synthesis lectures on data management. Morgan and Claypool Publishers, San Francisco. https://doi.org/10.2200/S00379ED1V01Y201108DTM020

  10. Boole G (1854) An investigation of the laws of thought on which are founded the mathematical theories of logic and probabilities. Macmillan, London

    MATH  Google Scholar 

  11. Botoeva E, Konev B, Lutz C, Ryzhikov V, Wolter F, Zakharyaschev M (2016) Inseparability and conservative extensions of description logic ontologies: a survey. In: Pan JZ, Calvanese D, Eiter T, Horrocks I, Kifer M, Lin F, Zhao Y (eds) Reasoning web: logical foundation of knowledge graph construction and query answering—12th international summer school 2016, 5-9 Sept 2016, Tutorial lectures, Lecture notes in computer science, vol 9885. Springer, Aberdeen, UK, pp 27–89. https://doi.org/10.1007/978-3-319-49493-7_2

  12. Boutilier C (1994) Toward a logic for qualitative decision theory. In: Doyle J, Sandewall E, Torasso P (eds) Proceedings of the 4th international conference on principles of knowledge representation and reasoning (KR’94), 24–27 May 1994. Morgan Kaufmann, Bonn, Germany, pp 75–86

  13. Boutilier C (ed) (2009) IJCAI 2009, Proceedings of the 21st international joint conference on artificial intelligence, Pasadena, California, USA, 11–17 Jul 2009. http://ijcai.org/proceedings/2009

  14. Brewka G, Eiter T, Truszczynski M (2011a) Answer set programming at a glance. Commun ACM 54(12):92–103. https://doi.org/10.1145/2043174.2043195

    Article  Google Scholar 

  15. Brewka G, Marek V, Truszczynski M (eds) (2011b) Nonmonotonic reasoning. Essays celebrating its 30th anniversary. College Publications, London

  16. Brewka G, Eiter T, McIlraith SA (eds) (2012) Principles of knowledge representation and reasoning: proceedings of the thirteenth international conference, KR 2012, 10–14 June 2012, AAAI Press, Rome, Italy

  17. Cabalar P, Pearce D, Valverde A (2018) Answer set programming from a logical point of view. KI - Künstliche Intelligenz. https://doi.org/10.1007/s13218-018-0547-7

  18. Cadoli M, Donini F, Schaerf M, Silvestri R (2000) On compact representations of propositional circumscription. Theor Comput Sci 182(1–2):183–202

    MathSciNet  MATH  Google Scholar 

  19. Craig W (1957) Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J Symb Logic 22(3):269–285. https://doi.org/10.2307/2963594

    Article  MathSciNet  MATH  Google Scholar 

  20. Darwiche A (2001) Decomposable negation normal form. J ACM 48(4):608–647. https://doi.org/10.1145/502090.502091

    Article  MathSciNet  MATH  Google Scholar 

  21. Delgrande JP (2014) Towards a knowledge level analysis of forgetting. In: Baral et al. (2014). http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7979

  22. Delgrande JP (2017) A knowledge level account of forgetting. J Artif Intell Res 60:1165–1213. https://doi.org/10.1613/jair.5530

    Article  MathSciNet  MATH  Google Scholar 

  23. Delgrande JP, Wang K (2015) A syntax-independent approach to forgetting in disjunctive logic programs. In: Bonet B, Koenig S (eds) Proceedings of the twenty-ninth AAAI conference on artificial intelligence, 25–30 Jan 2015. AAAI Press, Austin, Texas, USA, pp 1482–1488. http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9555

  24. van Ditmarsch H, Herzig A, Lang J, Marquis P (2009) Introspective forgetting. Synthese 169(2):405–423. https://doi.org/10.1007/s11229-009-9554-4

    Article  MathSciNet  MATH  Google Scholar 

  25. Doherty P, Lukaszewicz W, Madalinska-Bugaj E (1998) The PMA and relativizing minimal change for action update. In: Cohn AG, Schubert LK, Shapiro SC (eds) Proceedings of the sixth international conference on principles of knowledge representation and reasoning (KR’98), 2–5 June 1998. Morgan Kaufmann, Trento, Italy, pp 258–269

  26. Ebbinghaus H (1885) Über das Gedächtnis. Untersuchungen zur experimentellen Psychologie. Duncker and Humblot, Leipzig

    Google Scholar 

  27. Eiter T, Gottlob G (1993) Propositional circumscription and extended closed-world reasoning are \({\Pi }^p_2\)-complete. Theor Comput Sci 114(2):231–245. https://doi.org/10.1016/0304-3975(93)90073-3

    Article  MATH  Google Scholar 

  28. Eiter T, Wang K (2008) Semantic forgetting in answer set programming. Artif Intell 172(14):1644–1672. https://doi.org/10.1016/j.artint.2008.05.002

    Article  MathSciNet  MATH  Google Scholar 

  29. Eiter T, Tompits H, Woltran S (2005) On solution correspondences in answer-set programming. In: Kaelbling and Saffiotti (2005), pp 97–102. http://ijcai.org/Proceedings/05/Papers/1177.pdf

  30. Erdem E, Ferraris P (2007) Forgetting actions in domain descriptions. In: Proceedings of the twenty-second AAAI conference on artificial intelligence, 22–26 July 2007, AAAI Press, Vancouver, British Columbia, Canada, pp 409–414. http://www.aaai.org/Library/AAAI/2007/aaai07-064.php

  31. Fagin R, Halpern J, Moses Y, Vardi M (1995) Reasoning about knowledge, 2nd edn. MIT Press, Cambridge

    MATH  Google Scholar 

  32. Fang L, Liu Y, van Ditmarsch H (2016) Forgetting in multi-agent modal logics. In: Kambhampati S (ed) Proceedings of the twenty-fifth international joint conference on artificial intelligence, IJCAI 2016, 9–15 July 2016, IJCAI/AAAI Press, New York, NY, USA, pp 1066–1073. http://www.ijcai.org/Abstract/16/155

  33. Fuhrmann A, Hansson SO (1994) A survey of multiple contractions. J Log Lang Inf 3:39–75

    Article  MathSciNet  MATH  Google Scholar 

  34. Gabbay DM, Pearce D, Valverde A (2011) Interpolable formulas in equilibrium logic and answer set programming. J Artif Intell Res 42:917–943. http://jair.org/papers/paper3329.html

  35. Gärdenfors P, Rott H (1994) Belief revision. In: Gabbay D, Hogger C, Robinson J (eds) Handbook of logic in artificial intelligence and logic programming. Oxford University Press, Oxford, pp 35–132

    Google Scholar 

  36. Ghilardi S, Lutz C, Wolter F (2006a) Did I damage my ontology? A case for conservative extensions in description logics. In: Doherty P, Mylopoulos J, Welty CA (eds) Proceedings, tenth international conference on principles of knowledge representation and reasoning, 2–5 June 2006, AAAI Press, Lake District of the United Kingdom, pp 187–197. http://www.aaai.org/Library/KR/2006/kr06-021.php

  37. Ghilardi S, Lutz C, Wolter F, Zakharyaschev M (2006b) Conservative extensions in modal logic. In: Governatori G, Hodkinson IM, Venema Y (eds) Advances in modal logic 6, papers from the sixth conference on “advances in modal logic,” held in Noosa, Queensland, Australia, on 25–28 Sept 2006. College Publications, pp 187–207. http://www.aiml.net/volumes/volume6/Ghilardi-Lutz-Wolter-Zakharyaschev.ps

  38. Gonçalves R, Knorr M, Leite J (2016a) The ultimate guide to forgetting in answer set programming. In: Baral C, Delgrande JP, Wolter F (eds) Principles of knowledge representation and reasoning: proceedings of the fifteenth international conference, KR 2016, 25 April 2016. AAAI Press, Cape Town, South Africa, pp 135–144. http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12849

  39. Gonçalves R, Knorr M, Leite J (2016b) You can’t always forget what you want: on the limits of forgetting in answer set programming. In: Kaminka GA, Fox M, Bouquet P, Hüllermeier E, Dignum V, Dignum F, van Harmelen F (eds) ECAI 2016—22nd European conference on artificial intelligence, 29 Aug–2 Sept 2016, . Including prestigious applications of artificial intelligence (PAIS 2016). Frontiers in artificial intelligence and applications, vol 285. IOS Press, pp 957–965. https://doi.org/10.3233/978-1-61499-672-9-957

  40. Grau BC, Motik B (2010) Pushing the limits of reasoning over ontologies with hidden content. In: Lin F, Sattler U, Truszczynski M (eds) Principles of knowledge representation and reasoning: proceedings of the twelfth international conference, KR 2010, 9–13 May 2010. AAAI Press, Toronto, Ontario, Canada. http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1244

  41. Hansson S (1999) A textbook of belief dynamics. Kluwer Academic Publishers, Dordrecht

    Book  MATH  Google Scholar 

  42. Herzig A, Rifi O (1999) Propositional belief base update and minimal change. Artif Intell 115(1):107–138. https://doi.org/10.1016/S0004-3702(99)00072-7

    Article  MathSciNet  MATH  Google Scholar 

  43. Hintikka J (1962) Knowledge and belief. Cornell University Press, Ithaca

    MATH  Google Scholar 

  44. Kaelbling LP, Saffiotti A (eds) (2005) IJCAI-05, Proceedings of the nineteenth international joint conference on artificial intelligence, Jul 30–Aug 5, 2005, Professional Book Center, Edinburgh, Scotland, UK. http://ijcai.org/proceedings/2005

  45. Katsuno H, Mendelzon AO (1991a) On the difference between updating a knowledge base and revising it. In: Proceedings second international conference on principles of knowledge representation and reasoning (KR-91), pp 387–395

  46. Katsuno H, Mendelzon AO (1991b) Propositional knowledge base revision and minimal change. Artif Intell 52:253–294

    Article  MathSciNet  MATH  Google Scholar 

  47. Kern-Isberner G, Bock T, Sauerwald K, Beierle C (2017) Iterated contraction of propositions and conditionals under the principle of conditional preservation. In: Benzmüller C, Lisetti C, Theobald M (eds) Proceedings 3rd global conference on artificial intelligence, GCAI 2017, EPiC series in computing, vol 50, pp 78–92

  48. Klir G, Yuan B (eds) (1996) Fuzzy sets, fuzzy logic, fuzzy systems. Selected papers by Lotfi A. Zadeh. World Scientific Press, Singapore

    Google Scholar 

  49. Knorr M, Alferes JJ (2014) Preserving strong equivalence while forgetting. In: Fermé E, Leite J (eds) Logics in artificial intelligence –14th European conference, JELIA 2014, 24–26 Sept 2014. Proceedings, lecture notes in computer science, vol 8761. Springer, Funchal, Madeira, Portugal, pp 412–425, https://doi.org/10.1007/978-3-319-11558-0_29

  50. Konev B, Walther D, Wolter F (2008) The logical difference problem for description logic terminologies. In: Armando A, Baumgartner P, Dowek G (eds) Automated reasoning, 4th international joint conference, IJCAR 2008, 12–15 Aug 2008, Proceedings, lecture notes in computer science, vol 5195. Springer, Sydney, Australia, pp 259–274. https://doi.org/10.1007/978-3-540-71070-7_21

  51. Konev B, Walther D, Wolter F (2009) Forgetting and uniform interpolation in large-scale description logic terminologies. In: Boutilier (2009), pp 830–835. http://ijcai.org/Proceedings/09/Papers/142.pdf

  52. Konev B, Lutz C, Walther D, Wolter F (2013) Model-theoretic inseparability and modularity of description logic ontologies. Artif Intell 203:66–103. https://doi.org/10.1016/j.artint.2013.07.004

    Article  MathSciNet  MATH  Google Scholar 

  53. Konieczny S, Pino Pérez R (2017) On iterated contraction: syntactic characterization, representation theorem and limitations of the levi identity. In: Moral S, Pivert O, Sánchez D, Marín N (eds) Proceedings of the 11th international conference of scalable uncertainty management, sum 2017, lecture notes in computer science, vol 10564. Springer, Berlin, pp 348–362

  54. Koopmann P (2015) Practical uniform interpolation for expressive description logics. PhD thesis, University of Manchester, UK. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.674705

  55. Koopmann P, Schmidt RA (2013) Uniform interpolation of—ontologies using fixpoints. In: Fontaine P, Ringeissen C, Schmidt RA (eds) Frontiers of combining systems—9th international symposium, FroCoS 2013, 18–20 Sept 2013. Proceedings, Lecture notes in computer science, vol 8152. Springer, Nancy, France, pp 87–102. https://doi.org/10.1007/978-3-642-40885-4_7

  56. Kripke SA (1959) A completeness theorem in modal logic. J Symb Log 24(1):1–14. https://doi.org/10.2307/2964568

    Article  MathSciNet  MATH  Google Scholar 

  57. Kripke SA (1963) Semantical analysis of modal logic I: normal modal propositional calculi. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 9(5–6):67–96. https://doi.org/10.1002/malq.19630090502

    Article  MathSciNet  MATH  Google Scholar 

  58. Lakemeyer G (1997) Relevance from an epistemic perspective. Artif Intell 97(1–2):137–167. https://doi.org/10.1016/S0004-3702(97)00038-6

    Article  MathSciNet  MATH  Google Scholar 

  59. Lang J, Marquis P (2002) Resolving inconsistencies by variable forgetting. In: Fensel D, Giunchiglia F, McGuinness DL, Williams M (eds) Proceedings of the eights international conference on principles and knowledge representation and reasoning (KR-02), April 22–25, 2002, Morgan Kaufmann, Toulouse, France, pp 239–250

  60. Lang J, Liberatore P, Marquis P (2003) Propositional independence: formula-variable independence and forgetting. J Artif Intell Res 18:391–443. https://doi.org/10.1613/jair.1113

    Article  MathSciNet  MATH  Google Scholar 

  61. Leite J (2017) A bird’s-eye view of forgetting in answer-set programming. In: Balduccini M, Janhunen T (eds) Logic programming and nonmonotonic reasoning—14th international conference, LPNMR 2017, 3–6 July 2017. Proceedings, Lecture notes in computer science, vol 10377. Springer, Espoo, Finland, pp 10–22. https://doi.org/10.1007/978-3-319-61660-5_2

  62. Lenat DB, Feigenbaum EA (1987) On the thresholds of knowledge. In: McDermott JP (ed) Proceedings of the 10th international joint conference on artificial intelligence. 23–28 Aug 1987. Morgan Kaufmann, Milan, Italy, pp 1173–1182. http://ijcai.org/Proceedings/87-2/Papers/122.pdf

  63. Lifschitz V, Pearce D, Valverde A (2001) Strongly equivalent logic programs. ACM Trans Comput Log 2(4):526–541. https://doi.org/10.1145/502166.502170

    Article  MathSciNet  MATH  Google Scholar 

  64. Lin F (2001) On strongest necessary and weakest sufficient conditions. Artif Intell 128(1–2):143–159. https://doi.org/10.1016/S0004-3702(01)00070-4

    Article  MathSciNet  MATH  Google Scholar 

  65. Lin F, Reiter R (1994) Forget it! In: In Proceedings of the AAAI fall symposium on relevance, pp 154–159

  66. Lin F, Reiter R (1997) How to progress a database. Artif Intell 92(1–2):131–167. https://doi.org/10.1016/S0004-3702(96)00044-6

    Article  MathSciNet  MATH  Google Scholar 

  67. Liu Y, Lakemeyer G (2009) On first-order definability and computability of progression for local-effect actions and beyond. In: Boutilier (2009), pp 860–866. http://ijcai.org/Proceedings/09/Papers/147.pdf

  68. Ludwig M, Konev B (2014) Practical uniform interpolation and forgetting for ALC tboxes with applications to logical difference. In: Baral et al. (2014). http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7985

  69. Lutz C, Wolter F (2011) Foundations for uniform interpolation and forgetting in expressive description logics. In: Walsh T (ed) IJCAI 2011, Proceedings of the 22nd international joint conference on artificial intelligence, 16–22 July 2011, IJCAI/AAAI, , Barcelona, Catalonia, Spain, pp 989–995. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-170

  70. Lutz C, Seylan I, Wolter F (2012) An automata-theoretic approach to uniform interpolation and approximation in the description logic EL. In: Brewka et al. (2012). http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4511

  71. Marek W, Truszczyński M (1993) Nonmonotonic logics–context-dependent reasoning. Springer, Berlin

    MATH  Google Scholar 

  72. McCarthy J (1959) Programs with common sense. In: Proc. of the Teddington conference on the mechanization of thought processes, 1958, Her Majesty’s Stationery Office, London, pp 75–91

  73. McCarthy J (1963) Situations, actions and causal laws. Tech. rep., Stanford artificial intelligence project: Memo 2

  74. McCarthy J (1986) Applications of circumscription to formalizing common-sense knowledge. Artif Intell 28:89–116

    Article  MathSciNet  Google Scholar 

  75. Newell A, Simon HA (1976) Computer science as empirical inquiry: symbols and search. Commun ACM 19(3):113–126. https://doi.org/10.1145/360018.360022

    Article  MathSciNet  Google Scholar 

  76. Nikitina N, Rudolph S (2012) Expexpexplosion: uniform interpolation in general EL terminologies. In: Raedt LD, Bessière C, Dubois D, Doherty P, Frasconi P, Heintz F, Lucas PJF (eds) ECAI 2012—20th European conference on artificial intelligence. Including prestigious applications of artificial intelligence (PAIS-2012) system demonstrations track, Montpellier, France, August 27–31 , 2012, IOS Press, frontiers in artificial intelligence and applications, vol 242, pp 618–623. https://doi.org/10.3233/978-1-61499-098-7-618

  77. Ohlbach HJ, Engel T, Schmidt RA, Gabbay DM (2018) SCAN: home page. http://www.mettel-prover.org/scan/index.html. Accessed 28 Aug 2018 (online)

  78. Pearce D (2006) Equilibrium logic. Ann Math Artif Intell 47(1–2):3–41. https://doi.org/10.1007/s10472-006-9028-z

    Article  MathSciNet  MATH  Google Scholar 

  79. Pearl J (1988) Probabilistic reasoning in intelligent systems. Morgan Kaufmann, San Mateo

    MATH  Google Scholar 

  80. Peckhaus V (2004) Calculus ratiocinator versus characteristica universalis? the two traditions in logic, revisited. Hist Philos Log 25(1):3–14. https://doi.org/10.1080/01445340310001609315

    Article  MathSciNet  MATH  Google Scholar 

  81. Rajaratnam D, Levesque HJ, Pagnucco M, Thielscher M (2014) Forgetting in action. In: Baral et al. (2014). http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7983

  82. Schaub T, Woltran S (2018) Answer set programming unleashed! KI - Künstliche Intelligenz. Special issue of KI on answer set programming (editorial). https://doi.org/10.1007/s13218-018-0550-z

  83. Su K, Sattar A, Lv G, Zhang Y (2009) Variable forgetting in reasoning about knowledge. J Artif Intell Res 35:677–716. https://doi.org/10.1613/jair.2750

    Article  MathSciNet  MATH  Google Scholar 

  84. Wang K, Sattar A, Su K (2005) A theory of forgetting in logic programming. In: Veloso MM, Kambhampati S (eds) Proceedings, the twentieth national conference on artificial intelligence and the seventeenth innovative applications of artificial intelligence conference, 9–13 July 2005, USA, AAAI Press/The MIT Press, Pittsburgh, Pennsylvania, pp 682–688. http://www.aaai.org/Library/AAAI/2005/aaai05-107.php

  85. Wang Y, Zhang Y, Zhou Y, Zhang M (2012) Forgetting in logic programs under strong equivalence. In: Brewka et al. (2012). http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4389

  86. Wang Y, Wang K, Zhang M (2013) Forgetting for answer set programs revisited. In: Rossi F (ed) IJCAI 2013, Proceedings of the 23rd international joint conference on artificial intelligence, Beijing, China, 3–9 Aug 2013, IJCAI/AAAI, pp 1162–1168. http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6807

  87. Wang Z, Wang K, Topor RW, Pan JZ (2008) Forgetting concepts in dl-lite. In: Bechhofer S, Hauswirth M, Hoffmann J, Koubarakis M (eds) The semantic web: research and applications, 5th European semantic web conference, ESWC 2008, June 1–5, 2008, Proceedings. Lecture notes in computer science, vol 5021. Springer, Tenerife, Canary Islands, Spain, pp 245–257. https://doi.org/10.1007/978-3-540-68234-9_20

  88. Weber A (1986) Updating propositional formulas. In: Proceedings of the first conference on expert database systems, pp 487–500

  89. Wikipedia (2018) https://de.wikipedia.org/wiki/Martin_Lampe

  90. Wong KS (2009) Forgetting in logic programs. PhD thesis, School of Computer Science and Engineering, University of New South Wales

  91. Xiao P, Wang K, Wang Z (2017) Incosistency-tolerant forgetting in dl-lite. In: Nikitina N, Song D, Fokoue A, Haase P (eds) Proceedings of the ISWC 2017 Posters and demonstrations and industry tracks co-located with 16th international semantic web conference (ISWC 2017), Vienna, Austria, 23–25 Oct 2017. CEUR workshop proceedings, vol 1963. http://ceur-ws.org/Vol-1963/paper649.pdf

  92. Zhang Y, Zhou Y (2009) Knowledge forgetting: properties and applications. Artif Intell 173(16–17):1525–1537. https://doi.org/10.1016/j.artint.2009.07.005

    Article  MathSciNet  MATH  Google Scholar 

  93. Zhang Y, Zhou Y (2010) Forgetting revisited. In: Lin F, Sattler U, Truszczynski M (eds) (2010) Principles of knowledge representation and reasoning: proceedings of the twelfth international conference, KR 2010, 9–13 May 2010. AAAI Press, Toronto, Ontario, Canada. http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1292

  94. Zhang Y, Foo NY, Wang K (2005) Solving logic program conflict through strong and weak forgettings. In: Kaelbling and Saffiotti (2005), pp 627–634. http://ijcai.org/Proceedings/05/Papers/0488.pdf

  95. Zhao Y, Schmidt RA (2017) Role forgetting for alcoqh(universal role)-ontologies using an ackermann-based approach. In: Sierra C (ed) Proceedings of the twenty-sixth international joint conference on artificial intelligence, IJCAI 2017, Melbourne, Australia, 19–25 Aug 2017, ijcai.org, pp 1354–1361. https://doi.org/10.24963/ijcai.2017/188

  96. Zhao Y, Schmidt RA (2018a) FAME: an automated tool for semantic forgetting in expressive description logics. In: Galmiche D, Schulz S, Sebastiani R (eds) Automated reasoning—9th international joint conference, IJCAR 2018, held as part of the federated logic conference, FloC 2018, July 14–17, 2018. Proceedings, Lecture Notes in Computer Science, vol 10900. Springer, Oxford, UK, pp 19–27. https://doi.org/10.1007/978-3-319-94205-6_2

  97. Zhao Y, Schmidt RA (2018b) On concept forgetting in description logics with qualified number restrictions. In: Lang J (ed) Proceedings of the twenty-seventh international joint conference on artificial intelligence, IJCAI 2018, 13–19 Jul 2018, Stockholm, Sweden, ijcai.org, pp 1984–1990. https://doi.org/10.24963/ijcai.2018/274

Download references

Acknowledgements

The authors are grateful to the reviewers for their constructive comments to improve this article. This work was partly supported by DFG Priority Programme 1921 Intentional Forgetting. The first author is grateful to DFG for supporting his attendance of the internal workshop of the Programme in Limburg, Germany, May 3–4, 2018.

Author information

Authors and Affiliations

  1. Institute of Logic and Computation, TU Wien, Vienna, Austria

    Thomas Eiter

  2. Department of Computer Science, TU Dortmund, Dortmund, Germany

    Gabriele Kern-Isberner

Authors
  1. Thomas Eiter
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Gabriele Kern-Isberner
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Gabriele Kern-Isberner.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Eiter, T., Kern-Isberner, G. A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective. Künstl Intell 33, 9–33 (2019). https://doi.org/10.1007/s13218-018-0564-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13218-018-0564-6

Keywords