Fundamenta Informaticae - Volume 28, issue 3-4

Authors: Skarbek, Władysław

Article Type: Research Article

Abstract: Spatial Signal OR Graphs (SSOG) are defined and specialized to fractal pattern generation (FSSOG) and cellular array pattern generation(CSSOG). It is proved that fractal patterns always stabilize after predictable transient time, while cellular pattern graphs enter in parallel mode into a stable state if the initial state is even, otherwise they enter into a cycle of length 2. If nondeterministic mode is considered then any G ∈ SSOG enters a stable state with probability one.

DOI: 10.3233/FI-1996-283410

Citation: Fundamenta Informaticae, vol. 28, no. 3-4, pp. 347-352, 1996

Authors: Suraj, Zbigniew

Article Type: Research Article

Abstract: The main objective of machine discovery is the determination of relations between data and of data models. In the paper we describe a method for discovery of data models represented by concurrent systems from experimental tables. The basic step consists in a determination of rules which yield a decomposition of experimental data tables; the components are then used to define fragments of the global system corresponding to a table. The method has been applied to automatic data models discovery from experimental tables with Petri nets as models for concurrency.

Keywords: data mining, system decomposition, rough sets, concurrent models, laws discovery from experimental data

DOI: 10.3233/FI-1996-283411

Citation: Fundamenta Informaticae, vol. 28, no. 3-4, pp. 353-376, 1996

Authors: Schlechta, Karl

Article Type: Research Article

Abstract: Our subject is the representation and analysis of simple first-order default statements of ordinary language, such as “normally, birds fly”. There are, among other approaches, two kinds of analysis, both semantic in style. One interprets “normally, birds fly” along the lines of “for every item x in the domain of discourse, the most normal models of “x is a bird” are models of “x flies””. This is the preferential models approach, first outlined by Bossu/Siegel and Shoham, and studied by Kraus, Lehmann, Magidor and others. The other interprets “normally, birds fly” along the lines of “there is an important subset …of the birds, all of whose elements fly”. This is the generalized quantifier approach, formulated and developed by the author. The purpose of the present paper is to show how the two approaches may usefully be combined into a single two-stage approach, and how such a combination provides an elegant account of certain problematic examples. Show more

Keywords: Nonmonotonic Logic, Defaults, Preferential Models, Generalized Quantifiers

DOI: 10.3233/FI-1996-283412

Citation: Fundamenta Informaticae, vol. 28, no. 3-4, pp. 377-402, 1996

Authors: Winkowski, Józef

Article Type: Research Article

Abstract: Structures called concatenable weighted pomsets are introduced which can serve as models of processes of Petri nets, including nets with time features. Operations on such structures are defined which allow to combine them sequentially and in parallel. These operations correspond to natural operations on processes. They make the universe of concatenable weighted pomsets a partial algebra which appears to be a symmetric strict monoidal category. Sets of processes of timed and time Petri nets are characterized as subsets of this algebra.

Keywords: concatenable weighted pomset, symmetry, table, sequential composition, parallel composition, interchange, algebra, timed Petri net, time Petri net, process, potential timed process, actual timed process

DOI: 10.3233/FI-1996-283413

Citation: Fundamenta Informaticae, vol. 28, no. 3-4, pp. 403-421, 1996

Authors: Wróblewski, Jakub

Article Type: Research Article

Abstract: A lot of research on genetic algorithms theory is concentrated on classical, binary case. However, there are many other types of useful genetic algorithms (GA), e.g. tree-based (genetic programming), or order-based ones. This paper shows, that many of classical results can be transferred into the order-based GAs. The analysis includes the Schema Theorem and Markov chain modelling of order-based GA.

DOI: 10.3233/FI-1996-283414

Citation: Fundamenta Informaticae, vol. 28, no. 3-4, pp. 423-430, 1996