Show simple item record

dc.contributor.convenorVladimir Estivill-Castro (Editor)en_AU
dc.contributor.authorGoodwin, Scotten_US
dc.contributor.authorHagen, Richarden_US
dc.contributor.authorSattar, Abdulen_US
dc.contributor.editorVladimir Estivill-Castroen_US
dc.date.accessioned2017-04-04T15:47:37Z
dc.date.available2017-04-04T15:47:37Z
dc.date.issued2004en_US
dc.date.modified2008-07-11T04:58:50Z
dc.identifier.doihttp://dl.acs.org.au/en_AU
dc.identifier.urihttp://hdl.handle.net/10072/2095
dc.description.abstractWe have been investigating ways in which the performance of model elimination based systems can be improved and in this paper we present some of our results. Firstly, we have investigated code improvements based on local and global analysis of the internal knowledge base used by the theorem prover. Secondly, we have looked into the use of a n lists to represent ancestor goal information to see if this gives a performance boost over the traditional two list approach. This n list representation might be thought of as a simple hash table. Thirdly, we conducted initial investigations into the effect of rule body literal ordering on performance. The results for the code improvements show them to be worthwhile, producing gains in some example problems. Using the n list representation gave mixed results: for some examples it improved execution speed, in others it degraded it. A rule body literal ordering that placed instantiated goals (including hypotheses) early in the bodies of rules showed an improvement in execution time.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent224997 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherAustralian Computer Society, Inc.en_US
dc.publisher.placeSydneyen_US
dc.publisher.urihttp://crpit.com/Vol26.htmlen_AU
dc.relation.ispartof0en_AU
dc.relation.ispartofconferencenameTwenty-Seventh Australasian Computer Science Conference (ACSC2004)en_US
dc.relation.ispartofconferencetitleComputer Science 2004en_US
dc.relation.ispartofdatefrom2004-01-18en_US
dc.relation.ispartofdateto2004-01-22en_US
dc.relation.ispartoflocationDunedin, New Zealanden_US
dc.subject.fieldofresearchHISTORY AND ARCHAEOLOGYen_US
dc.subject.fieldofresearchcode210000en_US
dc.titleCode Improvements for Model Elimination Based Reasoning Systemsen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2004 Australian Computer Society Inc. The attached file is reproduced here in accordance with the copyright policy of the publisher. Use hypertext link to access the publisher's website.en_AU
gro.date.issued2004
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