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 7, issue 4

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.

Table of Contents

Article Type: Other

DOI: 10.3233/FI-1984-7401

Citation: Fundamenta Informaticae, vol. 7, no. 4, pp. i-vi, 1984

Get PDF

Algorithmic Logic with Stacks and Its Model-Theoretical Properties

Authors: Dańko, Wiktor

Article Type: Research Article

Abstract: In this paper we propose to transform the Algorithmic Theory of Stacks (cf. Salwicki [30]) into a logic for expressing and proving properties of programs with stacks. We compare this logic to the Weak Second Order Logic (cf. [11, 15]) and prove theorems concerning axiomatizability without quantifiers (an analogon of Łoś-Tarski theorem) and χ 0 - categoricity (an analogon of Ryll-Nardzewski’s theorem).

Keywords: logics of programs, infinitary logics, categoricity in power, data structures

DOI: 10.3233/FI-1984-7402

Citation: Fundamenta Informaticae, vol. 7, no. 4, pp. 391-428, 1984

Price: EUR 27.50

A Note on the Impact of Conflict Resolution to Liveness and Deadlock in Petri Nets

Authors: Burkhard, Hans-Dieter | Starke, Peter H.

Article Type: Research Article

Abstract: In this paper systems are investigated which consist of a Petri net and a control device. In any situation of the systems the control device selects one (or some) of the (concurrently) enabled transitions of the net and orders them to fire – this way solving conflicts, avoiding deadlocks etc. The results concern the corresponding decidability problems and the question whether it is possible to carry over such properties as deadlock avoidance and liveness from the uncontrolled net to a controlled net and vice versa.

Keywords: Petri net, conflict resolution, deadlock, liveness, controlled nets, counter machine

DOI: 10.3233/FI-1984-7403

Citation: Fundamenta Informaticae, vol. 7, no. 4, pp. 429-445, 1984

Price: EUR 27.50

Propositional Logics of Formal Languages

Authors: Radev, Slavian

Article Type: Research Article

Abstract: A family of propositional logics of programs with Kripke-style semantics is introduced. A global deductive system is given and the completeness of the logics from that family is proved.

Keywords: abstract languages, propositional logics of programs, modal theories, completeness theorem, propositional dynamic logics

DOI: 10.3233/FI-1984-7404

Citation: Fundamenta Informaticae, vol. 7, no. 4, pp. 447-482, 1984

Price: EUR 27.50

On Some Subset of the Partition Set

Authors: Grzymała-Busse, Jerzy W. | Pawlak, Zdzisław

Article Type: Research Article

Abstract: This paper contains a simple algorithm for minimal partition of a set, which is the departure point to study attribute dependencies in information system (see [3], [6], [7], [9]). Theoretical properties of such partitions have been studied by Łoś (see [5]) and the proposed algorithm has been implemented by Stevens (see [8]). The implementation shows many practical advantages of the proposed method.

Keywords: partition, block, minimal nontrivial partition, minimal number of partitions

DOI: 10.3233/FI-1984-7405

Citation: Fundamenta Informaticae, vol. 7, no. 4, pp. 483-488, 1984

Price: EUR 27.50

On Iteration in Robot Planning

Authors: Štěpánková, Olga | Havel, Ivan M.

Article Type: Research Article

Abstract: The paper discusses the role of iteration in robot plans constructed in the framework of predicate logic. It is shown that, unless some special axioms are added, the class of solvable tasks is not enlarged by admitting iteration in plans.

Keywords: robot planning, dynamic logic, situation calculus, iteration

DOI: 10.3233/FI-1984-7406

Citation: Fundamenta Informaticae, vol. 7, no. 4, pp. 489-501, 1984

Price: EUR 27.50
Show more