Forgetting for defeasible logic
MetadataShow full item record
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.
18th International Conference, LPAR-18, Proceedings Series: Lecture Notes in Computer Science, Vol. 7180 Subseries: Theoretical Computer Science and General Issues
Copyright 2012 Springer. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.The original publication is available at www.springerlink.com
Artificial Intelligence and Image Processing not elsewhere classified