Chapter

Logic for Programming, Artificial Intelligence, and Reasoning

Volume 7180 of the series Lecture Notes in Computer Science pp 77-91

Forgetting for Defeasible Logic

  • Grigoris AntoniouAffiliated withLancaster UniversityFORTH-ICSUniversity of Huddersfield
  • , Thomas EiterAffiliated withCarnegie Mellon UniversityInstitut für Informationssysteme, Technische Universität Wien
  • , Kewen WangAffiliated withCarnegie Mellon UniversitySchool of Information and Communication Technology, Griffith University

* Final gross prices may vary according to local VAT.

Get Access

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.