Maximum entropy and variable strength defaults

Authors:
Rachel A. Bourne;Simon Parsons
Affiliations:
Department of Electronic Engineering, Queen Mary & Westfield, University of London, London, UK;Department of Electronic Engineering, Queen Mary & Westfield, University of London, London, UK
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Year:
1999

Citing 5
Cited 7

Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
Floating conclusions and zombie paths: two deep difficulties in the “directly skeptical” approach to defeasible inheritance nets

Artificial Intelligence
What does a conditional knowledge base entail?

Artificial Intelligence
From statistical knowledge bases to degrees of belief

Artificial Intelligence
A Maximum Entropy Approach to Nonmonotonic Reasoning

IEEE Transactions on Pattern Analysis and Machine Intelligence

Supporting Inheritance Mechanisms in Ontology Representation

EKAW '00 Proceedings of the 12th European Workshop on Knowledge Acquisition, Modeling and Management
New Tractable Cases in Default Reasoning from Conditional Knowledge Bases

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Z-log: Applying System-Z

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Connecting Lexicographic with Maximum Entropy Entailment

ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Rankings We Prefer

ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Handling Conditionals Adequately in Uncertain Reasoning

ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Conditionals in nonmonotonic reasoning and belief revision: considering conditionals as agents

Conditionals in nonmonotonic reasoning and belief revision: considering conditionals as agents

Quantified Score

Hi-index	0.00

Visualization

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.