In this thesis I implement belief revision in SNePS based on a user-supplied epistemic ordering of propositions. I provide a decision procedure that performs revision completely automatically when given a well preorder. I also provide a decision procedure that, when given a total preorder, performs revision with a minimal number of queries to the user when multiple propositions within a minimally-inconsistent set are minimally epistemically entrenched. These procedures are implemented in SNePS as options alongside the old belief revision subsystem, wherein revision must be done entirely by hand. I implement both prioritized and nonprioritized belief revision by adjusting the epistemic ordering function passed to the new procedures. The first procedure uses O(|Σ|) units of space, and completes within O(|Σ|² · smax) units of time, where Σ is the set of distinct minimally-inconsistent sets, and smax is the number of propositions in the largest minimally-inconsistent set. The second procedure uses O(|Σ|² · [special characters omitted]) space and O(|Σ|² · [special characters omitted]) time. The examples provided herein demonstrate that the new procedures generalize previous work on belief revision in SNePS.
|Advisor:||Shapiro, Stuart C.|
|Commitee:||Rapaport, William J.|
|School:||State University of New York at Buffalo|
|Department:||Computer Science and Engineering|
|School Location:||United States -- New York|
|Source:||MAI 49/06M, Masters Abstracts International|
|Subjects:||Artificial intelligence, Computer science|
|Keywords:||Automated, Belief revision, Knowledge representation, Reasoner, Sneps|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be