Jump to ContentJump to Main Navigation
Changes of MindAn Essay on Rational Belief Revision$
Users without a subscription are not able to see the full content.

Neil Tennant

Print publication date: 2012

Print ISBN-13: 9780199655755

Published to Oxford Scholarship Online: September 2012

DOI: 10.1093/acprof:oso/9780199655755.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2017. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see http://www.oxfordscholarship.com/page/privacy-policy).date: 20 November 2017

Specification of a Contraction Algorithm

Specification of a Contraction Algorithm

Chapter:
(p.140) Chapter 5 Specification of a Contraction Algorithm
Source:
Changes of Mind
Author(s):

Neil Tennant

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199655755.003.0005

The chapter explain the concept of a greedy algorithm, and provide four successively less-greedy versions of a contraction algorithm. Here, the earlier work familiarizing the reader with dependency networks and their coloration conventions is key. The chapter discusses further possible sophistications of our approach, which would involve relaxing some of our simplifying assumptions: (i) making use of information about relative entrenchment of beliefs; (ii) being able to give up transitional steps among beliefs, in addition to beliefs themselves; and (iii) weakening the degree of support that the premises of a step afford its conclusion, so that it is probabilistic rather than apodeictic. The fourth version of our algorithm addresses (i).

Keywords:   greedy algorithm, contraction, relative entrenchment

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .