Article thumbnail
Location of Repository

Maximum Entropy and Variable Strength Defaults

By Rachel A. Bourne and Simon Parsons

Abstract

A new algorithm for computing the maximum entropy ranking over models is presented. The algorithm handles arbitrary sets of propositional defaults with associated strength assignments and succeeds whenever the set satisfies a robustness condition. Failure of this condition implies the problem may not be sufficiently specified for a unique solution to exist. This work extends the applicability of the maximum entropy approach detailed in [ Goldszmidt et al., 1993 ] , and clarifies the assumptions on which the method is based.

Publisher: Morgan Kaufmann
Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.22.7171
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www2.elec.qmul.ac.uk/~r... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.