Forgetting for Defeasible Logic

  • Grigoris Antoniou
  • Thomas Eiter
  • Kewen Wang
Conference paper

DOI: 10.1007/978-3-642-28717-6_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7180)
Cite this paper as:
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. LPAR 2012. Lecture Notes in Computer Science, vol 7180. Springer, Berlin, Heidelberg


The concept of forgetting has received significant interest in artificial intelligence recently. Informally, given a knowledge base, we may wish to forget about (or discard) some redundant parts (such as atoms, predicates, concepts, etc) but still preserve the consequences for certain forms of reasoning. In nonmonotonic reasoning, so far forgetting has been studied only in the context of extension based approaches, mainly answer-set programming. In this paper forgetting is studied in the context of defeasible logic, which is a simple, efficient and sceptical nonmonotonic reasoning approach.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Grigoris Antoniou
    • 1
    • 2
  • Thomas Eiter
    • 3
  • Kewen Wang
    • 4
  1. 1.FORTH-ICSGreece
  2. 2.University of HuddersfieldUK
  3. 3.Institut für InformationssystemeTechnische Universität WienAustria
  4. 4.School of Information and Communication TechnologyGriffith UniversityAustralia

Personalised recommendations