Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
542
Rational closure in SHIQ
"... Abstract. We define a notion of rational closure for the logic SHIQ, which does not enjoys the finite model property, building on the notion of rational closure introduced by Lehmann and Magidor in [24]. We provide a semantic characterization of rational closure in SHIQ in terms of a preferential se ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. We define a notion of rational closure for the logic SHIQ, which does not enjoys the finite model property, building on the notion of rational closure introduced by Lehmann and Magidor in [24]. We provide a semantic characterization of rational closure in SHIQ in terms of a preferential
Minimal models for rational closure in SHIQ
"... Abstract. We introduce a notion of rational closure for the logic SHIQ based on the well-known rational closure by Lehmann and Magidor [21]. We provide a semantic characterization of rational closure in SHIQ in terms of a preferential semantics, based on a finite rank characterization of minimal mod ..."
Abstract
- Add to MetaCart
Abstract. We introduce a notion of rational closure for the logic SHIQ based on the well-known rational closure by Lehmann and Magidor [21]. We provide a semantic characterization of rational closure in SHIQ in terms of a preferential semantics, based on a finite rank characterization of minimal
Rational closure for defeasible description logics.
- Logics in Artificial Intelligence - Proceedings of the12th European Conference (JELIA 2010). Volume 6341 of Lecture Notes in Computer Science (LNCS).,
, 2010
"... Abstract. In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means of a simple method in the context of propositional logic. We then propose an application of our approach to ra ..."
Abstract
-
Cited by 26 (4 self)
- Add to MetaCart
Abstract. In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means of a simple method in the context of propositional logic. We then propose an application of our approach
A modal reconstruction of Rational Closure
"... Abstract. This paper provides a general semantic framework for nonmonotonic reasoning, based on a minimal models semantics on the top of KLM systems for nonmonotonic reasoning. This general framework can be instantiated in order to provide a semantic reconstruction within modal logic of the notion o ..."
Abstract
- Add to MetaCart
of rational closure, introduced by Lehmann and Magidor. We give two characterizations of rational closure: the first one in terms of minimal models where propositional interpretations associated to worlds are fixed along minimization, the second one where they are allowed to vary. In both cases a knowledge
G.: A minimal model semantics for rational closure
- In: 14th International Workshop on Nonmonotonic Reasoning (NMR) (2012
"... This paper provides a general semantic framework for nonmonotonic reasoning, based on a minimal models semantics on the top of KLM systems for nonmonotonic reasoning. This general framework can be instantiated in order to provide a semantic reconstruction within modal logic of the notion of rational ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
of rational closure, introduced by Lehmann and Magidor. We give two characteriza-tions of rational closure: the first one in terms of min-imal models where propositional interpretations asso-ciated to worlds are fixed along minimization, the sec-ond one where they are allowed to vary. In both cases a
A semantics for Rational Closure: Preliminary Results
"... Abstract. We provide a semantical reconstruction of rational closure. We first consider rational closure as defined by Lehman and Magidor for propositional logic, and we provide a semantical characterization based on minimal models mechanism on rational models. Then, we extend the whole formalism an ..."
Abstract
- Add to MetaCart
Abstract. We provide a semantical reconstruction of rational closure. We first consider rational closure as defined by Lehman and Magidor for propositional logic, and we provide a semantical characterization based on minimal models mechanism on rational models. Then, we extend the whole formalism
Minimal Model Semantics and Rational Closure in Description Logics
"... Abstract. We define the notion of rational closure in the context of Description Logics. We start from an extension of ALC with a typicality operator T allowing to express concepts of the form T(C), whose meaning is to select the “most normal ” instances of a concept C. The semantics we consider is ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Abstract. We define the notion of rational closure in the context of Description Logics. We start from an extension of ALC with a typicality operator T allowing to express concepts of the form T(C), whose meaning is to select the “most normal ” instances of a concept C. The semantics we consider
Nonmonotonic Reasoning in Description Logics: Rational Closure for the ABox
"... Abstract. The introduction of defeasible reasoning in description logics has been a main research topic in the field in the last years. Despite the fact that various interesting formalizations of nonmonotonic reasoning for the TBox have been proposed, the application of such a kind of reasoning also ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
also to ABoxes is more problematic. In what follows we are going to present the adaptation for the ABox of a classical nonmonotonic form of reasoning, namely Lehmann and Magidor’s Rational Closure. We present both a procedural and a semantical characterization, and we conclude the paper with a
A Note on the Rational Closure of Knowledge Bases With Both Positive and Negative Knowledge
, 1998
"... The notion of the rational closure of a positive knowledge base K of conditional assertions # i # i (standing for if # i then normally # i ) was first introduced by Lehmann in [2] and developed by Lehmann and Magidor in [3]. Following those authors we would also argue that the rational closure is ..."
Abstract
-
Cited by 16 (4 self)
- Add to MetaCart
The notion of the rational closure of a positive knowledge base K of conditional assertions # i # i (standing for if # i then normally # i ) was first introduced by Lehmann in [2] and developed by Lehmann and Magidor in [3]. Following those authors we would also argue that the rational closure
Results 1 - 10
of
542
