نتایج جستجو برای: admissibility condition
تعداد نتایج: 316296 فیلتر نتایج به سال:
Abstract argumentation is a prominent reasoning framework. It comes with variety of semantics and has lately been enhanced by probabilities to enable quantitative treatment argumentation. While admissibility fundamental notion for classical in abstract frameworks, it barely reflected so far the probabilistic setting. In this paper, we address based on notions admissibility. Our approach follows...
Our paper investigates the linear logic of knowledge and time LTKr with reflexive intransitive time relation. The logic is defined semantically, – as the set of formulas true at special frames with intransitive and reflexive time binary relation. The LTKr-frames are linear chains of clusters connected by a reflexive intransitive relation RT . Elements inside a cluster are connected by several e...
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the modal logic S4. Our method is based on a standard semantic ground tableau approach. In particular, we reduce rule admissibility in S4 to satisfiability of a formula in a logic that extends S4. The extended logic is charac...
We contrast three decision rules that extend Expected Utility to contexts where a convex set of probabilities is used to depict uncertainty: Γ-Maximin, Maximality, and E-admissibility. The rules extend Expected Utility theory as they require that an option is inadmissible if there is another that carries greater expected utility for each probability in a (closed) convex set. If the convex set i...
The Pitman closeness ordering of statistical decision rules is considered in the general framework of comparative risk functions. The notions of admis-sibility and of the Bayes rule in this setting (C{admissibility and C{Bayes rule) are introduced. C{admissibility of C{Bayes procedures is demonstrated along with the geometric interpretation of these properties. It is shown that for general comp...
There are still ongoing debates on pro tability of momentumstrategies mainly due to its sensitivity to the choice of bench-mark asset pricing model in its risk adjustment. In this paper,we explore admissibility conditions for the benchmark asset pric-ing model which should be met, so they could be used as di-agnostic tool in risk adjustment of momentum strategies. Undert...
In this paper we extend Dung’s formal approach from admissibility to less demanding extension semantics allowing arguments in cycles of attacks. We present an acceptance criterion leading to the characterization of three semantics called pairwise cogency, weak cogency and cyclic cogency. Particular gametheoretic protocols allow us to identify winning strategies with extensions in different sema...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید