Computing and Library Services - delivering an inspiring information environment

Forgetting for Defeasible Logic

Antoniou, Grigoris, Eiter, Thomas and Wang, Kewen (2012) Forgetting for Defeasible Logic. In: Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes on Computer Science, 7180 . Springer, pp. 77-91. ISBN 9783642287169

[img] PDF - Accepted Version
Restricted to Repository staff only

Download (169kB)


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.

Item Type: Book Chapter
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering
Related URLs:
Depositing User: Grigoris Antoniou
Date Deposited: 03 Jul 2012 12:16
Last Modified: 03 Jul 2012 12:16


Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©