Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 410.00Impact 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.
Authors: Alsolami, Fawaz | Amin, Talha | Moshkov, Mikhail | Zielosko, Beata | Żabiński, Krzysztof
Article Type: Research Article
Abstract: In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference between length of rules constructed by the best heuristic and minimum length of rules is at most 4%. The same situation is with coverage.
Keywords: Greedy heuristics, association rules, decision rules, dynamic programming, rough sets
DOI: 10.3233/FI-2019-1791
Citation: Fundamenta Informaticae, vol. 166, no. 1, pp. 1-14, 2019
Authors: Borzyszkowski, Andrzej M.
Article Type: Research Article
Abstract: Rozenberg and Ehrenfeucht has shown a duality between 2-structures (a.k.a. transition systems) and (elementary) Petri nets. The tool has been the notion of a region of a 2-structure, the regions then define a Petri net. Bernardinello et al. has observed that the regions of a 2-structure form an orthomodular poset and there is a similar relation between 2-structures and orthomodular posets. While in the theory of 2-structures we may ask if a 2-structure is full and forward closed, the analogous notion for orthomodular posets is their regularity. In the present paper we study the problem of closing a given …orthomodular poset to a regular one. This is a dual problem to closing a 2-structure, which has been studied by the author earlier. Also, as in a seminal work of Rozenberg and Ehrenfeucht, one can be interested in a concrete representation, i.e. as a family of sets. We show here an appropriate construction for orthomodular posets too. Show more
Keywords: orthomodular poset, 2-structure, theory of regions, concurrency theory
DOI: 10.3233/FI-2019-1792
Citation: Fundamenta Informaticae, vol. 166, no. 1, pp. 15-28, 2019
Authors: Hartonas, Chrysafis | Orłowska, Ewa
Article Type: Research Article
Abstract: We study general lattices with normal unary operators for which we prove relational representation and duality results. Similar results have appeared in print, using Urquhart’s lattice representation, by the second author with Vakarelov, Radzikowska and Rewitzky. We base our approach in this article on the Hartonas and Dunn lattice duality, proven by Gehrke and Harding to deliver a canonical lattice extension, and on recent results by the first author on the relational representation of normal lattice operators. We verify that the operators at the representation level (appropriately generated by relations) are the canonical extensions of the lattice operators, in Gehrke …and Harding’s sense. Show more
DOI: 10.3233/FI-2019-1793
Citation: Fundamenta Informaticae, vol. 166, no. 1, pp. 29-56, 2019
Authors: Wei, Gui-Wu
Article Type: Research Article
Abstract: In this paper, we utilize Hamacher operations and power aggregation operators to develop some Pythagorean fuzzy Hamacher power aggregation operators: Pythagorean fuzzy Hamacher power average (PFHPA) operator, Pythagorean fuzzy Hamacher power geometric (PFHPG) operator, Pythagorean fuzzy Hamacher power weighted average (PFHPWA) operator, Pythagorean fuzzy Hamacher power weighted geometric (PFHPWG) operator, Pythagorean fuzzy Hamacher power ordered weighted average (PFHPOWA) operator, Pythagorean fuzzy Hamacher power ordered weighted geometric (PFHPOWG) operator, Pythagorean fuzzy Hamacher power hybrid average (PFHPHA) operator and Pythagorean fuzzy Hamacher power hybrid geometric (PFHPHG) operator. The prominent characteristic of these proposed operators are studied. Then, we utilize these operators to …develop some approaches to solve the multiple attribute decision making problems with Pythagorean fuzzy numbers (PFNs). Finally, a practical example is given to verify the developed approach and deliver a comparative analysis. Show more
Keywords: multiple attribute decision making (MADM), Pythagorean fuzzy numbers(PFNs), Hamacher aggregation operators, Pythagorean fuzzy Hamacher power hybrid average (PFHPHA) operator, Pythagorean fuzzy Hamacher power hybrid geometric (PFHPHG) operator
DOI: 10.3233/FI-2019-1794
Citation: Fundamenta Informaticae, vol. 166, no. 1, pp. 57-85, 2019
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl