Chapter

Specification of a Contraction Algorithm

Neil Tennant

in Changes of Mind

Published in print June 2012 | ISBN: 9780199655755
Published online September 2012 | e-ISBN: 9780191742125 | DOI: http://dx.doi.org/10.1093/acprof:oso/9780199655755.003.0005
Specification of a Contraction Algorithm

More Like This

Show all results sharing this subject:

  • Philosophy of Mathematics and Logic

GO

Show Summary Details

Preview

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

Chapter.  15870 words. 

Subjects: Philosophy of Mathematics and Logic

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.