Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ivan Kramosil

dblp:74/2128 · DBLP profile ↗
← Back
23ranked-venue papers
23as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 18 · 18 first-authorTheory of computation · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › proof systems
deduction rules
0.011975
A Note on Deduction Rules with Negative Premises · IJCAI 1975
Logic in computer science › concurrency theory
negative premises
0.011975
A Note on Deduction Rules with Negative Premises · IJCAI 1975
YearPublicationVenuePosition
2011 Statistical Estimations of Lattice-Valued Possibilistic Distributions
Ivan Kramosil, Milan Daniel
ECSQARU1
2009 Possibilistic Measures Taking Their Values in Spaces Given by Inclusion-Closed Fragments of Power-Sets
Ivan Kramosil
ECSQARU1
2008 Lattice-Valued Possibilistic Entropy Measure
abstract
Since almost fifty years, Shannon entropy measure has been used as a very powerful tool when quantifying and processing the amount of randomness contained in probability distributions. In this paper we propose a lattice-valued entropy measure H ascribing to each lattice-valued possibilistic distribution π the value H(π) defined as the expected value (in the sense of lattice-valued Sugeno integral with infimum in the role of t-norm) of certain nonincreasing function of the values ascribed to the elements of the basic space by the possibilistic distribution π in question. The main result reads that, for completely distributive complete lattices, the entropy value ascribed to possibilistically independent product of a finite number of lattice-valued possibilistic distributions is defined by the supremum of the entropy values ascribed to particular distributions.
Ivan Kramosil
Int. J. Uncertain. Fuzziness Knowl. Based Syst.1
2006 Extensions of Partial Lattice-valued Possibilistic Measures from Nested Domains
abstract
We investigate a partial non-numerical possibilistic measure taking its values in a complete lattice and defined on a nested system of subsets of the universe under consideration. Our aim is to extend this measure conservatively to the power-set of all systems of this universe using the same idea as that when introducing outer measures. Hence, we ascribe to each subset of the universe its minimal (in the sense of set inclusion) covering by a set from the nested domain and define its possibility degree as identical with the value ascribed to this covering. Also analyzed is the case when they are two lattice-valued possibilistic measures on the same universe, each with its own nested domain and our aim is to define one possibilistic measure on the power-set in question in a way sophistically taking profit of the information offered by both the particular partial lattice-valued measures.
Ivan Kramosil
Int. J. Uncertain. Fuzziness Knowl. Based Syst.1
2005 Second-Level Possibilistic Measures Induced by Random Variables
Ivan Kramosil
ECSQARU1
2003 Partial Lattice-Valued Possibilistic Measures and Some Relations Induced by Them
Ivan Kramosil
ECSQARU1
2003 Belief functions generated by fuzzy and randomized compatibility relations
Ivan Kramosil
Fuzzy Sets Syst.1
2003 Products And Marginals Of Poset-Valued Fuzzy And Possibilistic Measures
abstract
Fuzzy measures and possibilistic measures taking their values in partially ordered sets, in particular, in semilattices and lattices, are introduced. Suggested and investigated in more detail are Cartesian products and marginals of poset-valued fuzzy and possibilistic measures. The conditions under which the resulting set functions possess the properties of poset-valued fuzzy and possibilistic measures are analyzed and some relevant assertions are stated and proved.
Ivan Kramosil
Int. J. Uncertain. Fuzziness Knowl. Based Syst.1
2001 Belief Functions with Partially Ordered Values
Ivan Kramosil
ECSQARU1
2001 Dempster Combination Rule with Boolean-Like Processed Belief Functions
abstract
It is a well-known fact that the Dempster combination rule for combination of uncertainty degrees coming from two or more sources is legitimate only if the combined empirical data, charged with uncertainty and taken as random variables, are statistically (stochastically) independent. We shall prove, however, that for a particular but large enough class of probability measures, an analogy of Dempster combination rule, preserving its extensional character but using some nonstandard and boolean-like structures over the unit interval of real numbers, can be obtained without the assumption of statistical independence of input empirical data charged with uncertainty.
Ivan Kramosil
Int. J. Uncertain. Fuzziness Knowl. Based Syst.1
2001 Boolean-like and frequentistic nonstandard semantics for first-order predicate calculus without functions
Ivan Kramosil
Soft Comput.1
1999 Towards Possibilistic Decision Functions with Minimum-Based Sugeno Integrals
Ivan Kramosil
SOFSEM1
1999 Measure-theoretic approach to the inversion problem for belief functions
Ivan Kramosil
Fuzzy Sets Syst.1
1998 Dempster Combination Rule for Signed Belief Functions
abstract
A possibility to define a binary operation over the space of pairs of belief functions, inverse or dual to the well-known Dempster combination rule in the same sense in which substraction is dual with respect to the addition operation in the space of real numbers, can be taken as an important problem for the purely algebraic as well as from the application point of view. Or, it offers a way how to eliminate the modification of a belief function obtained when combining this original belief function with other pieces of information, later proved not to be reliable. In the space of classical belief functions definable by set-valued (generalized) random variables defined on a probability space, the invertibility problem for belief functions, resulting from the above mentioned problem of "dual" combination rule, can be proved to be unsolvable up to trivial cases. However, when generalizing the notion of belief functions in such a way that probability space is replaced by more general measurable space with signed measure, inverse belief functions can be defined for a large class of belief functions generalized in the corresponding way. "Dual" combination rule is then defined by the application of the Dempster rule to the inverse belief functions.
Ivan Kramosil
Int. J. Uncertain. Fuzziness Knowl. Based Syst.1
1997 Belief functions generated by signed measures
Ivan Kramosil
Fuzzy Sets Syst.1
1996 Nonstandard Approach to Possibility Measures
abstract
Possibility measures have been conceived by Zadeh [1], and developed by, e. g., Dubois, Prade and others, as very simple, if compared with, e.g., probability theory, but still nontrivial and reasonable uncertainty measures. The relatively poor descriptional and operational abilities of possibility measures seem to be closely related to the standard linear ordering relation and the corresponding supremum and infimum operations defined over the unit interval of real numbers. Having discussed, very briefly, the possibilities how to overcome these limitations, we propose and investigate possibility measures taking their values in the well-known Cantor subset of the unit interval but defined with respect to a nonstandard operation of supremum resulting from a nonstandard partial ordering of real numbers from the Cantor set. Such a nonstandard possibility measure is proved to be a sufficient tool to define an infinite sequence of probability measures defined over countable sets, consequently, the distribution of each continuous real-valued random variable defined over a general abstract probability space can be defined by an appropriate nonstandard possibility measure.
Ivan Kramosil
Int. J. Uncertain. Fuzziness Knowl. Based Syst.1
1995 An Axiomatic Approach to Extensional Probability Measures
Ivan Kramosil
ECSQARU1
1990 Model-preserving transformations of databases for rule-based expert systems with Boolean-valued weights
Ivan Kramosil
Knowl. Based Syst.1
1986 On Some Types of Pseudo-Random Sequences
Ivan Kramosil
MFCS1
1985 Statistical testing of finite sequences based on algorithmic complexity
Ivan Kramosil
FCT1
1979 A Note on Computational Complexity of a Statistical Deducibility Testing Procedure
Ivan Kramosil
MFCS1
1977 A Probabilistic Restriction of Branching Plans
Ivan Kramosil
MFCS1
1975 A Note on Deduction Rules with Negative Premises
Ivan Kramosil
IJCAI1