Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
842
Beyond Counter-Examples to Nonmonotonic Formalisms: A Possibility-Theoretic Analysis
- of Anti-Bits, International Conference on Computer Science, ICCS, Genf
, 1996
"... . In nonmonotonic reasoning, Lehmann's preferential System P is known to provide reasonable but very cautious conclusions, while the inference machinery may still remain too cautious or on the contrary provide counter-intuitive conclusions when using the rational closure inference. These two ty ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
. In nonmonotonic reasoning, Lehmann's preferential System P is known to provide reasonable but very cautious conclusions, while the inference machinery may still remain too cautious or on the contrary provide counter-intuitive conclusions when using the rational closure inference. These two
Applications Of Circumscription To Formalizing Common Sense Knowledge
- Artificial Intelligence
, 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract
-
Cited by 532 (12 self)
- Add to MetaCart
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects
Notes On Formalizing Context
, 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract
-
Cited by 417 (9 self)
- Add to MetaCart
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit
Nonmonotonic Causal Theories
- ARTIFICIAL INTELLIGENCE
, 2004
"... The nonmonotonic causal logic defined in this paper can be used to represent properties of actions, including actions with conditional and indirect effects, nondeterministic actions, and concurrently executed actions. It has been applied to several challenge problems in the theory of commonsense kno ..."
Abstract
-
Cited by 274 (31 self)
- Add to MetaCart
knowledge. We study the relationship between this formalism and other work on nonmonotonic reasoning and knowledge representation, and discuss its implementation, called the Causal Calculator.
Answer Sets in General Nonmonotonic Reasoning
, 1992
"... Languages of declarative logic programming differ from other modal nonmonotonic formalisms by lack of syntactic uniformity. For instance, negation as failure can be used in the body of a rule, but not in the head; in disjunctive programs, disjunction is used in the head of a rule, but not in the bod ..."
Abstract
-
Cited by 104 (8 self)
- Add to MetaCart
Languages of declarative logic programming differ from other modal nonmonotonic formalisms by lack of syntactic uniformity. For instance, negation as failure can be used in the body of a rule, but not in the head; in disjunctive programs, disjunction is used in the head of a rule
Biconsequence Relations for Nonmonotonic Reasoning
- Principles of Knowledge Representation and Reasoning: Proc. Fifth Int. Conference (KR'96
, 1996
"... In this study we suggest a general formalism for nonmonotonic reasoning. The formalism, called biconsequence relations, provides a general framework of reasoning with respect to a pair of contexts. As is shown in [Bochman 1996], it allows to give a uniform representation for various semantics fo ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
In this study we suggest a general formalism for nonmonotonic reasoning. The formalism, called biconsequence relations, provides a general framework of reasoning with respect to a pair of contexts. As is shown in [Bochman 1996], it allows to give a uniform representation for various semantics
A Formal Theory of Plan Recognition
, 1987
"... The problem of recognizing an agent's plans arises in many contexts in work in artificial intelligence. The plan recognition techniques suggested in the literature are rarely formally justified. We view plan recognition as a special kind of non-monotonic reasoning, and demonstrate how formal te ..."
Abstract
-
Cited by 202 (3 self)
- Add to MetaCart
The problem of recognizing an agent's plans arises in many contexts in work in artificial intelligence. The plan recognition techniques suggested in the literature are rarely formally justified. We view plan recognition as a special kind of non-monotonic reasoning, and demonstrate how formal
Moral Dilemmas and Nonmonotonic Logic
, 1994
"... this paper is to establish some formal connections between deontic and nonmonotonic logics, and to suggest some ways in which the techniques developed in the study of nonmonotonic reasoning and the issues confronted there might help to illuminate deontic ideas. These two subjects have evolved within ..."
Abstract
-
Cited by 45 (9 self)
- Add to MetaCart
this paper is to establish some formal connections between deontic and nonmonotonic logics, and to suggest some ways in which the techniques developed in the study of nonmonotonic reasoning and the issues confronted there might help to illuminate deontic ideas. These two subjects have evolved
Nonmonotonic logics and their algebraic foundations
, 2006
"... The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the emergence of nonmonotonic logics and introduce two major nonmonotonic formalisms, default and autoepistemic logics. We th ..."
Abstract
- Add to MetaCart
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the emergence of nonmonotonic logics and introduce two major nonmonotonic formalisms, default and autoepistemic logics. We
Non-Monotonic Formalisms And Logic Programming
- In Levi and Martelli [89
, 1989
"... this paper is to discuss recent research developments, which ..."
Abstract
-
Cited by 20 (9 self)
- Add to MetaCart
this paper is to discuss recent research developments, which
Results 1 - 10
of
842
