You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Fundamenta Informaticae - Volume 79, issue 1-2

Purchase individual online access for 1 year to this journal.

Price: EUR 410.00
ISSN 0169-2968 (P)
ISSN 1875-8681 (E)

Impact Factor 2024: 0.4

Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:


- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.

Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.

results per page

Bounded Model Checking for the Existential Fragment of TCTL_{-G} and Diagonal Timed Automata

Authors: Woźna, Bożena | Zbrzezny, Andrzej

Article Type: Research Article

Abstract: Bounded Model Checking (BMC) is one of the well known SAT based symbolic model checking techniques. It consists in searching for a counterexample of a particular length, and generating a propositional formula that is satisfiable iff such a counterexample exists. The BMC method is feasible for the various classes of temporal logic; in particular it is feasible for TECTL (the existential fragment of Time Computation Tree Logic) and Diagonal-free Timed Automata. The main contribution of the … Show more

Citation: Fundamenta Informaticae, vol. 79, no. 1-2, pp. 229-256, 2007

Price: EUR 27.50

A Comparative Analysis of Possibilistic Variances and Covariances of Fuzzy Numbers

Authors: Zhang, Wei-Guo | Wang, Ying-Luo

Article Type: Research Article

Abstract: In this paper, we introduce a new crisp possibilistic variance and a new crisp possibilistic covariance of fuzzy numbers, which are different from those introduced by Carlsson and Fullér. We show that the possibilistic variance and covariance preserve many properties of variance and covariance in probability theory. Furthermore, we investigate the relationship between several crisp possibilistic variances and covariances of fuzzy numbers.

Keywords: Fuzzy number, Possibility theory, Possibilistic variance, Possibilistic covariance

Citation: Fundamenta Informaticae, vol. 79, no. 1-2, pp. 257-263, 2007

Price: EUR 27.50
Show more