Results 1  10
of
122
Toward a Logic for Qualitative Decision Theory
 In Proceedings of the KR'94
, 1992
"... We present a logic for representing and reasoning with qualitative statements of preference and normality and describe how these may interact in decision making under uncertainty. Our aim is to develop a logical calculus that employs the basic elements of classical decision theory, namely proba ..."
Abstract

Cited by 196 (4 self)
 Add to MetaCart
We present a logic for representing and reasoning with qualitative statements of preference and normality and describe how these may interact in decision making under uncertainty. Our aim is to develop a logical calculus that employs the basic elements of classical decision theory, namely probabilities, utilities and actions, but exploits qualitative information about these elements directly for the derivation of goals. Preferences and judgements of normality are captured in a modal/conditional logic, and a simple model of action is incorporated. Without quantitative information, decision criteria other than maximum expected utility are pursued. We describe how techniques for conditional default reasoning can be used to complete information about both preferences and normality judgements, and we show how maximin and maximax strategies can be expressed in our logic.
Representing Default Rules in Possibilistic Logic
, 1992
"... A key issue when reasoning with default rules is how to order them so as to derive plausible conclusions according to the more specific rules applicable to the situation under concern, to make sure that default rules are not systematically inhibited by more general rules, and to cope with the proble ..."
Abstract

Cited by 97 (36 self)
 Add to MetaCart
A key issue when reasoning with default rules is how to order them so as to derive plausible conclusions according to the more specific rules applicable to the situation under concern, to make sure that default rules are not systematically inhibited by more general rules, and to cope with the problem of irrelevance of facts with respect to exceptions. Pearl's system Z enables us to rankorder default rules. In this paper we show how to encode such a rankordered set of defaults in possibilistic logic. We can thus take advantage of the deductive machinery available in possibilistic logic. We point out that the notion of inconsistency tolerant inference in possibilistic logic corresponds to the bold inference ; 1 in system Z. We also show how to express defaults by means of qualitative possibility relations. Improvements to the ordering provided by system Z are also proposed.
Plausibility Measures and Default Reasoning
 Journal of the ACM
, 1996
"... this paper: default reasoning. In recent years, a number of different semantics for defaults have been proposed, such as preferential structures, fflsemantics, possibilistic structures, and rankings, that have been shown to be characterized by the same set of axioms, known as the KLM properties. W ..."
Abstract

Cited by 79 (12 self)
 Add to MetaCart
this paper: default reasoning. In recent years, a number of different semantics for defaults have been proposed, such as preferential structures, fflsemantics, possibilistic structures, and rankings, that have been shown to be characterized by the same set of axioms, known as the KLM properties. While this was viewed as a surprise, we show here that it is almost inevitable. In the framework of plausibility measures, we can give a necessary condition for the KLM axioms to be sound, and an additional condition necessary and sufficient to ensure that the KLM axioms are complete. This additional condition is so weak that it is almost always met whenever the axioms are sound. In particular, it is easily seen to hold for all the proposals made in the literature. Categories and Subject Descriptors: F.4.1 [Mathematical Logic and Formal Languages]:
Logical preference representation and combinatorial vote
 ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
, 2002
"... We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of nonindependent variables to assign. We study two key issues pertaining to combinatorial vote, namely preference representation and ..."
Abstract

Cited by 72 (16 self)
 Add to MetaCart
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of nonindependent variables to assign. We study two key issues pertaining to combinatorial vote, namely preference representation and the automated choice of an optimal decision. For each of these issues, we briefly review the state of the art, we try to define the main problems to be solved and identify their computational complexity.
Nonmonotonic Reasoning, Conditional Objects and Possibility Theory
 Artificial Intelligence
, 1997
"... . This short paper relates the conditional objectbased and possibility theorybased approaches for reasoning with conditional statements pervaded with exceptions, to other methods in nonmonotonic reasoning which have been independently proposed: namely, Lehmann's preferential and rational closure en ..."
Abstract

Cited by 68 (17 self)
 Add to MetaCart
. This short paper relates the conditional objectbased and possibility theorybased approaches for reasoning with conditional statements pervaded with exceptions, to other methods in nonmonotonic reasoning which have been independently proposed: namely, Lehmann's preferential and rational closure entailments which obey normative postulates, the infinitesimal probability approach, and the conditional (modal) logicsbased approach. All these methods are shown to be equivalent with respect to their capabilities for reasoning with conditional knowledge although they are based on different modeling frameworks. It thus provides a unified understanding of nonmonotonic consequence relations. More particularly, conditional objects, a purely qualitative counterpart to conditional probabilities, offer a very simple semantics, based on a 3valued calculus, for the preferential entailment, while in the purely ordinal setting of possibility theory both the preferential and the rational closure entai...
Argumentative Inference in Uncertain and Inconsistent Knowledge Bases
 In Proceedings of Uncertainty in Artificial Intelligence
, 1993
"... : This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A socalled argumentativeconsequence relation, taking into account the existence of consistent arguments in favor of a conclusion and the absence of consistent arguments in favor of its contrary, is ..."
Abstract

Cited by 66 (3 self)
 Add to MetaCart
: This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A socalled argumentativeconsequence relation, taking into account the existence of consistent arguments in favor of a conclusion and the absence of consistent arguments in favor of its contrary, is particularly investigated. Flat knowledge bases, i.e. without any priority between their elements, as well as prioritized ones where some elements are considered as more strongly entrenched than others are studied under the different consequence relations which are considered. Lastly a paraconsistentlike treatment of prioritized knowledge bases is proposed, where both the level of entrenchment and the level of paraconsistency attached to a formula are propagated. The priority levels are handled in the framework of possibility theory. Keywords: Inconsistency; consequence relation; prioritized knowledge base; uncertainty; possibilistic logic; possibility theory. Submitted to the Ninth Annual...
Statistical Foundations for Default Reasoning
, 1993
"... We describe a new approach to default reasoning, based on a principle of indifference among possible worlds. We interpret default rules as extreme statistical statements, thus obtaining a knowledge base KB comprised of statistical and firstorder statements. We then assign equal probability to all w ..."
Abstract

Cited by 45 (8 self)
 Add to MetaCart
We describe a new approach to default reasoning, based on a principle of indifference among possible worlds. We interpret default rules as extreme statistical statements, thus obtaining a knowledge base KB comprised of statistical and firstorder statements. We then assign equal probability to all worlds consistent with KB in order to assign a degree of belief to a statement '. The degree of belief can be used to decide whether to defeasibly conclude '. Various natural patterns of reasoning, such as a preference for more specific defaults, indifference to irrelevant information, and the ability to combine independent pieces of evidence, turn out to follow naturally from this technique. Furthermore, our approach is not restricted to default reasoning; it supports a spectrum of reasoning, from quantitative to qualitative. It is also related to other systems for default reasoning. In particular, we show that the work of [ Goldszmidt et al., 1990 ] , which applies maximum entropy ideas t...
Iterated Revision and Minimal Change of Conditional Beliefs
 JOURNAL OF PHILOSOPHICAL LOGIC
, 1995
"... We describe a model of iterated belief revision that extends the AGM theory of revision to account for the effect of a revision on the conditional beliefs of an agent. In particular, this model ensures that an agent makes as few changes as possible to the conditional component of its belief set. Ado ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
We describe a model of iterated belief revision that extends the AGM theory of revision to account for the effect of a revision on the conditional beliefs of an agent. In particular, this model ensures that an agent makes as few changes as possible to the conditional component of its belief set. Adopting the Ramsey test, minimal conditional revision provides acceptance conditions for arbitrary rightnested conditionals. We show that problem of determining acceptance of any such nested conditional can be reduced to acceptance tests for unnested conditionals. Thus, iterated revision can be accomplished in a “virtual” manner, using uniterated revision.
Belief Functions and Default Reasoning
, 2000
"... We present a new approach to deal with default information based on the theory of belief functions. Our semantic structures, inspired by Adams' epsilon semantics, are epsilonbelief assignments, where mass values are either close to 0 or close to 1. In the first part of this paper, we show that t ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
We present a new approach to deal with default information based on the theory of belief functions. Our semantic structures, inspired by Adams' epsilon semantics, are epsilonbelief assignments, where mass values are either close to 0 or close to 1. In the first part of this paper, we show that these structures can be used to give a uniform semantics to several popular nonmonotonic systems, including Kraus, Lehmann and Magidor's system P, Pearl's system Z, Brewka's preferred subtheories, Geffner's conditional entailment, Pinkas' penalty logic, possibilistic logic and the lexicographic approach. In the second part, we use epsilonbelief assignments to build a new system, called LCD, and show that this system correctly addresses the wellknown problems of specificity, irrelevance, blocking of inheritance, ambiguity, and redundancy.