Results 1  10
of
1,642
Default Reasoning
 Proc. of COLING'88
, 1988
"... In natural language, as iu Other computational task domains it is impmxam' to. operate by default assumptions. First, mmy constraints rc(tnirexl fbr constraint propagation are initially nitspecified, Second, ia highly ambiguous tasks sncll as text analysis, ambiguity cmi be reduced by consideri ..."
Abstract
 Add to MetaCart
by considering more plausi. ble scenarios first. Default reasoning is problematic for tirstorder logic when allowing nonmonotonic inferences. Whereas in monotonic logic [acts can only be asserted, in nonmonotonic logic a system must be maintained consistent even as previously assumed defaults are being
Default reasoning as likelihood reasoning
 In Proceedings of the 3rd National Conference on Artificial Intelligence
, 1983
"... Several attempts to define formal logic5 for some type of default reasoning have been made. All of these logics share the property that in any given state, a proposition p is either held to be true, it is held to be false, or no belief about it is held. But, if we ask what default reasoning really i ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Several attempts to define formal logic5 for some type of default reasoning have been made. All of these logics share the property that in any given state, a proposition p is either held to be true, it is held to be false, or no belief about it is held. But, if we ask what default reasoning really
Defaultreasoning with models
"... Reasoning with modelbased representations is an intuitive paradigm, which has been shown to be theoretically sound and to possess some computational advantages over reasoning with formulabased representations of knowledge. In this paper we present more evidence to the utility of such representatio ..."
Abstract

Cited by 82 (19 self)
 Add to MetaCart
be done efficiently in the presence of varying context information. We then consider the task of default reasoning. We show that default reasoning is a generalization of reasoning within context, in which the reasoner has many "context" rules, which may be conflicting. We characterize the cases
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 49 (7 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
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 87 (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
Toward Efficient Default Reasoning
 Presented at the 4th International Workshop on Nonmonotonic Reasoning
, 1996
"... Early work on default reasoning aimed to formalize the notion of quickly "jumping to conclusions". Unfortunately, the resulting formalisms have proven more computationally complex than classical logics. This has dramatically limited the applicability of formal methods to real problems invo ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Early work on default reasoning aimed to formalize the notion of quickly "jumping to conclusions". Unfortunately, the resulting formalisms have proven more computationally complex than classical logics. This has dramatically limited the applicability of formal methods to real problems
Evaluating an Algorithm for Default Reasoning
, 1995
"... In this paper performance of a lately proposed decision procedure for Reiter's default logic is evaluated. Recent complexity results indicate that there are two orthogonal sources of complexity in default reasoning: classical (firstorder) reasoning and conflict resolution (i.e. choosing an app ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
In this paper performance of a lately proposed decision procedure for Reiter's default logic is evaluated. Recent complexity results indicate that there are two orthogonal sources of complexity in default reasoning: classical (firstorder) reasoning and conflict resolution (i.e. choosing
Default Reasoning with Contexts
 In Context and Ontologies: Theory, Practice and Applications, Technical Report WS0501, AAAI Press, Menlo Park, CA
, 2005
"... We describe a system that combines default reasoning with contexts. Contexts are arranged in a hierarchy where more specific contexts represent revisions of the state of belief in more general contexts. We describe our algorithm for default reasoning in a context hierarchy and provide a translation ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We describe a system that combines default reasoning with contexts. Contexts are arranged in a hierarchy where more specific contexts represent revisions of the state of belief in more general contexts. We describe our algorithm for default reasoning in a context hierarchy and provide a translation
Another perspective on Default Reasoning
 Ann. Math. Artif. Intell
, 1992
"... The lexicographic closure of any given finite set D of normal defaults is defined. A conditional assertion a b is in this lexicographic closure if, given the defaults D and the fact a, one would conclude b. The lexicographic closure is essentially a rational extension of D, and of its rational ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
The lexicographic closure of any given finite set D of normal defaults is defined. A conditional assertion a b is in this lexicographic closure if, given the defaults D and the fact a, one would conclude b. The lexicographic closure is essentially a rational extension of D, and of its rational
PreferenceBased Default Reasoning
"... It is wellknown that default reasoning and preferencebased decision making both make use of preferential relations between possible worlds resp. alternatives. In this paper, we explore this methodological relationship in more detail by considering inference as a decision making problem. A founda ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is wellknown that default reasoning and preferencebased decision making both make use of preferential relations between possible worlds resp. alternatives. In this paper, we explore this methodological relationship in more detail by considering inference as a decision making problem. A foun
Results 1  10
of
1,642