Maximum Entropy and Variable Strength Defaults

Bourne, Rachel A.; Parsons, Simon

Maximum Entropy and Variable Strength Defaults

Download BibTeX Cite

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 50-54.

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.

Rachel A. Bourne, and Simon Parsons. 1999. Maximum Entropy and Variable Strength Defaults. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI, 50–54. https://ijcai.org/proceedings/1999/8

@inproceedings{ijcai1999p8,
  title     = {Maximum Entropy and Variable Strength Defaults},
  author    = {Bourne, Rachel A. and Parsons, Simon},
  booktitle = {Proceedings of the Sixteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-99}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Thomas Dean},
  pages     = {50--54},
  year      = {1999},
  note      = {Automated Reasoning},
  url       = {https://ijcai.org/proceedings/1999/8},
}

TY  - CPAPER
TI  - Maximum Entropy and Variable Strength Defaults
AU  - Bourne, Rachel A.
AU  - Parsons, Simon
T2  - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1999
SP  - 50
EP  - 54
UR  - https://ijcai.org/proceedings/1999/8
ER  -