default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvan Kramosil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j56]Ivan Kramosil, Milan Daniel
:
Several results on set-valued possibilistic distributions. Kybernetika 51(3): 391-407 (2015)- 2011
- [c15]Ivan Kramosil, Milan Daniel:
Statistical Estimations of Lattice-Valued Possibilistic Distributions. ECSQARU 2011: 688-699
2000 – 2009
- 2009
- [c14]Ivan Kramosil:
Possibilistic Measures Taking Their Values in Spaces Given by Inclusion-Closed Fragments of Power-Sets. ECSQARU 2009: 688-699 - 2008
- [j55]Ivan Kramosil:
Partial Convergence and Continuity of Lattice-Valued Possibilistic Measures. Comput. Informatics 27(3): 297-313 (2008) - [j54]Ivan Kramosil:
Lattice-Valued Possibilistic Entropy Measure. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 16(6): 829-846 (2008) - 2007
- [c13]Ivan Kramosil:
Lattice-Valued Possibilistic Entropy Functions. EUSFLAT Conf. (2) 2007: 375-379 - 2006
- [j53]Ivan Kramosil:
Continuity and completeness of lattice-valued possibilistic measures. Int. J. Gen. Syst. 35(5): 555-574 (2006) - [j52]Ivan Kramosil:
Extensions of Partial Lattice-valued Possibilistic Measures from Nested Domains. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 14(2): 175-198 (2006) - [j51]Ivan Kramosil:
Decision-making under uncertainty processed by lattice-valued possibilistic measures. Kybernetika 42(6): 629-646 (2006) - 2005
- [j50]Ivan Kramosil:
Approximations of lattice-valued possibilistic measures. Kybernetika 41(2): 177-204 (2005) - [c12]Ivan Kramosil:
Second-Level Possibilistic Measures Induced by Random Variables. ECSQARU 2005: 884-895 - 2004
- [j49]Ivan Kramosil:
Almost-measurability relation induced by lattice-valued partial possibilistic measures. Int. J. Gen. Syst. 33(6): 679-704 (2004) - 2003
- [j48]Ivan Kramosil:
Belief functions generated by fuzzy and randomized compatibility relations. Fuzzy Sets Syst. 135(3): 341-366 (2003) - [j47]Ivan Kramosil:
Products And Marginals Of Poset-Valued Fuzzy And Possibilistic Measures. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 11(6): 729-748 (2003) - [c11]Ivan Kramosil:
Partial Lattice-Valued Possibilistic Measures and Some Relations Induced by Them. ECSQARU 2003: 395-406 - 2002
- [j46]Ivan Kramosil:
Boolean-valued belief functions. Int. J. Gen. Syst. 31(2): 153-181 (2002) - [j45]Ivan Kramosil:
A nonstandard modification of Dempster combination rule. Kybernetika 38(1): 1-12 (2002) - 2001
- [j44]Ivan Kramosil:
Dempster Combination Rule with Boolean-Like Processed Belief Functions. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 9(1): 105-122 (2001) - [j43]Ivan Kramosil:
Possibilistic alternatives of elementary notions and relations of the theory of belief functions. Kybernetika 37(2): 109-126 (2001) - [j42]Ivan Kramosil:
Boolean-like and frequentistic nonstandard semantics for first-order predicate calculus without functions. Soft Comput. 5(1): 45-57 (2001) - [c10]Ivan Kramosil:
Belief Functions with Partially Ordered Values. ECSQARU 2001: 303-315
1990 – 1999
- 1999
- [j41]Ivan Kramosil:
Nonspecificity Degrees of Basic Probability Assignments in Dempster-shafer Theory. Comput. Artif. Intell. 18(6): 559-574 (1999) - [j40]Ivan Kramosil:
Measure-theoretic approach to the inversion problem for belief functions. Fuzzy Sets Syst. 102(3): 363-369 (1999) - [j39]Ivan Kramosil:
Probability propositional calculus with doubled nonstandard semantics. Kybernetika 35(2): 195-207 (1999) - [c9]Ivan Kramosil:
Boolean-Like Interpretation of Sudeno Integral. ESCQARU 1999: 245-255 - [c8]Ivan Kramosil:
Towards Possibilistic Decision Functions with Minimum-Based Sugeno Integrals. SOFSEM 1999: 422-430 - 1998
- [j38]Ivan Kramosil:
Dempster Combination Rule for Signed Belief Functions. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 6(1): 79-102 (1998) - [j37]Ivan Kramosil:
Alternative definitions of conditional possibilistic measures. Kybernetika 34(2): 137-147 (1998) - 1997
- [j36]Ivan Kramosil:
Belief functions generated by signed measures. Fuzzy Sets Syst. 92(2): 157-166 (1997) - [c7]Ivan Kramosil:
Belief Functions with Nonstandard Values. ECSQARU-FAPR 1997: 380-391 - 1996
- [j35]Ivan Kramosil:
Nonstandard Approach to Possibility Measures. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 4(3): 275-306 (1996) - [j34]Ivan Kramosil:
An axiomatization of extensional probability measures. Kybernetika 32(4): 325-342 (1996) - 1995
- [j33]Ivan Kramosil:
Approximations of believability functions under incomplete identification of sets of compatible states. Kybernetika 31(5): 425-450 (1995) - [c6]Ivan Kramosil:
An Axiomatic Approach to Extensional Probability Measures. ECSQARU 1995: 267-276 - 1993
- [j32]Otto Exner, Ivan Kramosil, Igor Vajda:
Mathematical evaluation of the fit of a theory with experimental data. J. Chem. Inf. Comput. Sci. 33(3): 407-411 (1993) - 1992
- [j31]Ivan Kramosil:
An alternative approach to rough sets. Kybernetika 28(1): 1-25 (1992) - [j30]Ivan Kramosil, Jan Sindelár:
On pseudo-random sequences and their relation to a class of stochastical laws. Kybernetika 28(5): 383-391 (1992) - [j29]Ivan Kramosil:
Comparing alternative definitions of Boolean-valued fuzzy sets. Kybernetika 28(6): 425-443 (1992) - [j28]Ivan Kramosil:
From an alternative model of rough sets to fuzzy sets. Kybernetika 28(7): 12-16 (1992) - 1990
- [j27]Ivan Kramosil:
Model-preserving transformations of databases for rule-based expert systems with Boolean-valued weights. Knowl. Based Syst. 3(1): 21-24 (1990) - [j26]Ivan Kramosil:
Parallel probabilistic searching and sortin algorithms. Kybernetika 26(7): 1-93 (1990)
1980 – 1989
- 1989
- [j25]Ivan Kramosil:
Correction to: "A note on nonaxiomatizability of independence relations generated by certain probabilistic structures". Kybernetika 25(5): 422 (1989) - [j24]Ivan Kramosil:
Possible-worlds semantics for rule-based expert systems with set-valued weights. Kybernetika 25(7): 65-71 (1989) - 1988
- [j23]Ivan Kramosil:
Extremum-searching hierarchical parallel probabilistic algorithms. Kybernetika 24(2): 110-121 (1988) - [j22]Ivan Kramosil:
A note on nonaxiomatizability of independence relations generated by certain probabilistic structures. Kybernetika 24(6): 439-446 (1988) - 1987
- [j21]Ivan Kramosil:
Independent and identically distributed pseudo-random samples. Kybernetika 23(1): 1-12 (1987) - 1986
- [c5]Ivan Kramosil:
On Some Types of Pseudo-Random Sequences. MFCS 1986: 476-483 - 1985
- [c4]Ivan Kramosil:
Statistical testing of finite sequences based on algorithmic complexity. FCT 1985: 218-226 - 1984
- [j20]Ivan Kramosil, Jan Sindelár:
Infinite pseudo-random sequences of high algorithmic complexity. Kybernetika 20(6): 429-437 (1984) - [j19]Ivan Kramosil:
Recursive classification of pseudo-random sequences. Kybernetika 20(7): 1-34 (1984) - 1983
- [j18]Ivan Kramosil:
On extremum-searching approximate probabilistic algorithms. Kybernetika 19(5): 365-373 (1983) - 1982
- [j17]Ivan Kramosil:
Three semantical interpretations of a statistical theoremhood testing procedure. Kybernetika 18(5): 440-446 (1982) - 1981
- [j16]Ivan Kramosil:
On detectors with incomplete answers. Kybernetika 17(3): 191-208 (1981) - [j15]Ivan Kramosil:
Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs. Kybernetika 17(5): 359-367 (1981) - 1980
- [j14]Ivan Kramosil:
Statistical testing procedure for lengths of formalized proofs. Kybernetika 16(3): 209-224 (1980)
1970 – 1979
- 1979
- [j13]Ivan Kramosil:
Statistical approach to proof theory. Kybernetika 15(7): 1-97 (1979) - [c3]Ivan Kramosil:
A Note on Computational Complexity of a Statistical Deducibility Testing Procedure. MFCS 1979: 337-345 - 1978
- [j12]Ivan Kramosil:
A Boolean-valued probability theory. Kybernetika 14(1): 5-17 (1978) - [j11]Ivan M. Havel, Ivan Kramosil:
A stochastic approach to robot plan formation. Kybernetika 14(3): 143-173 (1978) - [j10]Ivan Kramosil, Jan Sindelár:
Statistical deducibility testing with stochastic parameters. Kybernetika 14(6): 385-396 (1978) - [j9]Ivan Kramosil:
An attempt to formalize the notion of heuristics in state space. Kybernetika 14(6): 461-465 (1978) - 1977
- [j8]Ivan Kramosil:
Mechanized experiment planning in automaton-environment systems. Kybernetika 13(4): 225-244 (1977) - [c2]Ivan Kramosil:
A Probabilistic Restriction of Branching Plans. MFCS 1977: 342-349 - 1976
- [j7]Ivan Kramosil:
A selection-based formal description of an environment. Kybernetika 12(3): 127-150 (1976) - 1975
- [j6]Ivan Kramosil:
A probabilistic approach to automaton-environment systems. Kybernetika 11(3): 173-206 (1975) - [j5]Ivan Kramosil, Jirí Michálek:
Fuzzy metrics and statistical metric spaces. Kybernetika 11(5): 336-344 (1975) - [c1]Ivan Kramosil:
A Note on Deduction Rules with Negative Premises. IJCAI 1975: 53-56 - 1974
- [j4]Ivan Kramosil, Zbigniew Zwinogrodzki:
Statistical methods for comparing theorem proving algorithms. Kybernetika 10(3): 221-240 (1974) - 1973
- [j3]Ivan Kramosil:
A method for random sampling of formulas of an elementary theory and statistical estimation of their deducibility equipped by a program. II. A method for statistical testing of an at random sampled formula. Kybernetika 9(3): 162-173 (1973) - 1972
- [j2]Ivan Kramosil:
A method for random sampling of well-formed formulas. (A method for random sampling of formulas of an elementary theory and statistical estimation of their deducibility equipped by a program. I.). Kybernetika 8(2): 133-148 (1972) - 1971
- [j1]Ivan Kramosil:
Statistical estimation of deducibility in polyadic algebras. Kybernetika 7(3): 181-200 (1971)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
