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 94, issue 1

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.

Timed P Automata

Authors: Barbuti, Roberto | Maggiolo-Schettini, Andrea | Milazzo, Paolo | Tesei, Luca

Article Type: Research Article

Abstract: To study systems whose dynamics changes with time, an extension of timed P systems is introduced in which evolution rules may vary with time. The proposed model is a timed automaton with a discrete time domain and in which each state is a timed P system. A result on expressive power and on features of the formalism sufficient for full expressiveness is proved and, as an application example, the model of an ecological system is given.

DOI: 10.3233/FI-2009-114

Citation: Fundamenta Informaticae, vol. 94, no. 1, pp. 1-19, 2009

Price: EUR 27.50

Clausal Tableaux for Multimodal Logics of Belief

Authors: Goré, Rajeev | Nguyen, Linh Anh

Article Type: Research Article

Abstract: We develop clausal tableau calculi for six multimodal logics variously designed for reasoning about multi-degree belief, reasoning about distributed systems of belief and for reasoning about epistemic states of agents in multi-agent systems. Our tableau calculi are sound, complete, cut-free and have the analytic superformula property, thereby giving decision procedures for all of these logics. We also use our calculi to obtain complexity results for five of these logics. The complexity of the remaining … Show more

Keywords: modal logics for agent-based systems, theorem proving for modal logics, complexity and decidability of modal logics

DOI: 10.3233/FI-2009-115

Citation: Fundamenta Informaticae, vol. 94, no. 1, pp. 21-40, 2009

Price: EUR 27.50

Algebraic Properties of Generalized Rough Sets

Authors: Kondo, Michiro

Article Type: Research Article

Abstract: In this paper we consider the problem whether for a map φ : A(B) → B there is a relation R on A(B) such that properties of a map φ: B → B are reflected to R. This is a converse problem that J. Järvinen proved in [5]. We give an affirmative answer to the problem. Moreover we give equational bases which characterize properties of the map φ. This means that the classes of some types of algebras form varieties. … Show more

Keywords: generalized rough sets, atomic Boolean algebra, modal algebra

DOI: 10.3233/FI-2009-116

Citation: Fundamenta Informaticae, vol. 94, no. 1, pp. 41-48, 2009

Price: EUR 27.50

First-order Generalization of the MPMA Belief Update Operator

Authors: Madalińska-Bugaj, Ewa | Łukaszewicz, Witold

Article Type: Research Article

Abstract: In this paper we generalize the MPMA belief update operator by admitting first-order knowledge bases and restricted first-order update formulae. This allows us to consider scenarios which cannot be properly formalized either in the originalMPMA or in other existing approaches to belief update.

DOI: 10.3233/FI-2009-117

Citation: Fundamenta Informaticae, vol. 94, no. 1, pp. 49-61, 2009

Price: EUR 27.50

The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable

Authors: Margenstern, Maurice

Article Type: Research Article

Abstract: In this paper, we look at the following question. We consider cellular automata in the hyperbolic plane, see [6, 22, 9, 12] and we consider the global function defined on all possible configurations. Is the injectivity of this function undecidable? The problem was answered positively in the case of the Euclidean plane by Jarkko Kari, in 1994, see [4]. In the present paper, we show that the answer is also positive for the hyperbolic plane: the problem … Show more

Keywords: cellular automata, hyperbolic plane, tessellations

DOI: 10.3233/FI-2009-118

Citation: Fundamenta Informaticae, vol. 94, no. 1, pp. 63-99, 2009

Price: EUR 27.50

Greedy Algorithms withWeights for Construction of Partial Association Rules

Authors: Ju. Moshkov, Mikhail | Piliszczu, Marcin | Zielosko, Beata

Article Type: Research Article

Abstract: This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.

Keywords: Rough sets, information systems, weights, association rules, greedy algorithms

DOI: 10.3233/FI-2009-119

Citation: Fundamenta Informaticae, vol. 94, no. 1, pp. 101-120, 2009

Price: EUR 27.50
Show more