Show simple item record

dc.contributor.convenorM. Veloso, S. Kambhampati
dc.contributor.authorWang, K
dc.contributor.authorSattar, A
dc.contributor.authorSu, K
dc.contributor.editorManuela M. Veloso, Subbarao Kambhampati
dc.date.accessioned2017-05-03T14:11:00Z
dc.date.available2017-05-03T14:11:00Z
dc.date.issued2005
dc.date.modified2008-07-20T22:58:44Z
dc.identifier.refurihttp://www.aaai.org/Conferences/National/2005/aaai05.html
dc.identifier.urihttp://hdl.handle.net/10072/2699
dc.description.abstractThe study of forgetting for reasoning has attracted considerable attention in AI. However, much of the work on forgetting, and other related approaches such as independence, irrelevance and novelty, has been restricted to the classical logics. This paper describes a detailed theoretical investigation of the notion of forgetting in the context of logic programming. We first provide a semantic definition of forgetting under the answer sets for extended logic programs. We then discuss the desirable properties and some motivating examples. An important result of this study is an algorithm for computing the result of forgetting in a logic program. Furthermore, we present a modified version of the algorithm and show that the time complexity of the new algorithm is polynomial with respect to the size of the given logic program if the size of certain rules is fixed. We show how the proposed theory of forgetting can be used to characterize the logic program updates.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent167345 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoeng
dc.publisherAAAI Press
dc.publisher.placeAAAI
dc.publisher.urihttps://aaai.org/Library/AAAI/aaai05contents.php
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofconferencename20th National Conference on Artificial Intelligence (AAAI-2005)
dc.relation.ispartofconferencetitleProceedings of the National Conference on Artificial Intelligence
dc.relation.ispartofdatefrom2005-07-09
dc.relation.ispartofdateto2005-07-13
dc.relation.ispartoflocationPitsburgh
dc.relation.ispartofpagefrom682
dc.relation.ispartofpageto687
dc.relation.ispartofvolume2
dc.rights.retentionY
dc.subject.fieldofresearchcode280213
dc.titleA theory of forgetting in logic programming
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.rights.copyright© 2005 AAAI Press. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Use hypertext link for access to conference website.
gro.date.issued2005
gro.hasfulltextFull Text
gro.griffith.authorSattar, Abdul
gro.griffith.authorWang, Kewen
gro.griffith.authorSu, Kaile


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record