Show simple item record

dc.contributor.authorEwin, Christopher James
dc.date.accessioned2018-12-04T23:16:35Z
dc.date.available2018-12-04T23:16:35Z
dc.date.issued2018en_US
dc.identifier.urihttp://hdl.handle.net/11343/219204
dc.description© 2018 Dr. Christopher James Ewin
dc.description.abstractAmong the most frequent reasoning tasks in the situation calculus are projection queries that query the truth of conditions in a future state of affairs. However, in long running action sequences involving thousands or millions of independent actions, solving the projection problem is complex. Existing approaches require either syntactically rewriting queries through each action that has occurred via a mechanism called regression or producing and maintaining an updated representation of the knowledge base via progression. This latter approach is often infeasible, as updating a knowledge base without loss of relevant information is not possible for many domains. This thesis introduces a new technique which allows the length of the action sequences to be reduced by reordering independent actions and removing dominated actions; maintaining semantic equivalence with respect to the original action theory. This transformation allows for the removal of actions that are problematic with respect to progression, allowing for periodic update of the action theory to reflect the current state of affairs. We provide the logical framework for the general case and give specific methods for important classes of action theories. We also show how more expressive cases may be handled, such as the reordering of sensing actions in order to delay progression. We investigate mechanisms for deciding which actions should be removed or reordered to improve the efficiency via a guided search and introduce appropriate heuristics. The end result is a method that allows long-running situation calculus based agents to reason more efficiently about their current and future situations.en_US
dc.rightsTerms and Conditions: Copyright in works deposited in Minerva Access is retained by the copyright owner. The work may not be altered without permission from the copyright owner. Readers may only download, print and save electronic copies of whole works for their own personal non-commercial use. Any use that exceeds these limits requires permission from the copyright owner. Attribution is essential when quoting or paraphrasing from these works.
dc.subjectsituation calculusen_US
dc.subjectartificial intelligenceen_US
dc.subjectoptimizingen_US
dc.subjectprojectionen_US
dc.subjectknowledge representationen_US
dc.subjectagent theoriesen_US
dc.titleOptimizing projection in the situation calculusen_US
dc.typePhD thesisen_US
melbourne.affiliation.departmentComputing and Information Systems
melbourne.affiliation.facultyEngineering
dc.identifier.orcid0000-0002-4468-8519en_US
melbourne.thesis.supervisornamePearce, Adrian
melbourne.thesis.supervisoremailadrianrp@unimelb.edu.auen_US
melbourne.contributor.authorEwin, Christopher James
melbourne.accessrightsOpen Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record