Show simple item record

dc.contributor.convenorL. Kaelbling, A. Saffiottien_AU
dc.contributor.authorZhang, Yan
dc.contributor.authorFoo, Norman
dc.contributor.authorWang, Kewen
dc.contributor.editorL. Kaelbling, A. Saffiotti
dc.date.accessioned2017-12-05T00:04:23Z
dc.date.available2017-12-05T00:04:23Z
dc.date.issued2005
dc.date.modified2007-03-21T21:25:39Z
dc.identifier.refuriwww.ijcai-05.org/en_AU
dc.identifier.urihttp://hdl.handle.net/10072/2700
dc.description.abstractWe consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from this program in some way, and other atoms related to them in the program might also be affected. We define notions of strong and weak forgettings in logic programs to capture such intuition and reveal their close connections to the notion of forgetting in classical propositional theories. Based on these notions, we then propose a framework for conflict solving in logic programs, which is genarl enough to represent many important conflict solving problems. We also study some essential semantic and computational properties in relation to strong and weak forgettings and conflict solving in our framework.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherInternational Joint Conferences on Artificial Intelligenceen_US
dc.publisher.placeUSAen_US
dc.publisher.urihttps://www.ijcai.org/proceedings/2005en_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencename19th International Joint Conference on Artificial Intelligence (IJCAI-2005)en_US
dc.relation.ispartofconferencetitleIJCAI-05 : Proceedings of the 19th International Joint Conference on Artificial Intelligenceen_US
dc.relation.ispartofdatefrom2005-07-30
dc.relation.ispartofdateto2005-08-05
dc.relation.ispartoflocationEdinburghen_US
dc.relation.ispartofpagefrom627en_US
dc.relation.ispartofpageto634en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode280213en_US
dc.titleSolving Logic Program Conflict through Strong and Weak Forgettingsen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
dc.description.versionPublisheden_US
gro.rights.copyrightCopyright 2005 International Joint Conference on Artificial Intelligence. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the Conference's website for access to the definitive, published version.en_US
gro.date.issued2005
gro.hasfulltextFull Text


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