Forgetting for defeasible logic

  • Authors:
  • Grigoris Antoniou;Thomas Eiter;Kewen Wang

  • Affiliations:
  • FORTH-ICS, Greece and University of Huddersfield, UK;Institut für Informationssysteme, Technische Universität Wien, Austria;School of Information and Communication Technology, Griffith University, Australia

  • Venue:
  • LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.