Abstract
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.
Information
Library
Documents
![[thumbnail of LPAR.pdf]](https://eprints.hud.ac.uk/style/images/fileicons/application_pdf.png "LPAR.pdf")
Statistics
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)
