Publikacje

Czasopismo: Fundamenta Informaticae

Liczba publikacji: 160

2019

• Justyna Grudzińska i Marek Witold Zawadowski, Continuation Semantics for Multi-Quantifier Sentences: Operation-Based Approaches, Fundamenta Informaticae 164 (4) 2019, s. 327–344.zobacz w PBN
• Marek Witold Zawadowski, co-Semi-analytic Functors, Fundamenta Informaticae 164 (4) 2019, s. 359–373.zobacz w PBN

2018

• Anh Linh Nguyen, Computing Bisimulation-Based Comparisons, Fundamenta Informaticae 157 (4) 2018, s. 385–401.zobacz w PBN
• Marek Grabowski, Grzegorz Bokota, Jacek Sroka i Andrzej M. Kierzek, Verification of Dynamic Behaviour in Qualitative Molecular Networks Describing Gene Regulation, Signalling and Whole-cell Metabolism, Fundamenta Informaticae 160 (1-2) 2018, s. 199–219.zobacz w PBN
• Jacek Pomykała i Robert Dryło, Jacobians of hyperelliptic curves over Z_n and factorization of n, Fundamenta Informaticae 2018.zobacz w PBN
• Szymon Grabowski, Tomasz Kociumaka i Jakub Radoszewski, On Abelian Longest Common Factor with and without RLE, Fundamenta Informaticae 163 (3) 2018, s. 225–244.zobacz w PBN
• Marcin Michalak i Dominik Ślęzak, Boolean Representation for Exact Biclustering, Fundamenta Informaticae 161 (3) 2018, s. 275–297.zobacz w PBN
• Barbara Dunin-Kęplicz i Alina Powała, Multi-party persuasion: a paraconsistent approach., Fundamenta Informaticae vol 158 (1) 2018, s. 1–39.zobacz w PBN
• Anna Gambin i Monika Heiner, Advances in Biological processes and Petri nets (BioPPN) Preface, Fundamenta Informaticae 2018.zobacz w PBN

2017

• Jacek Pomykała i Konrad Durnoga, Large sieve, Miller-Rabin compositeness witnesses and integer factoring problem, Fundamenta Informaticae 156 (DOI 10.3233/FI-2017) 2017, s. 179–185.zobacz w PBN
• Soma Dutta, Jankowski i Andrzej Skowron, Interactive logical structures, Fundamenta Informaticae 154 (1-4) 2017, s. 95–108.zobacz w PBN
• Mikołaj Bojańczyk, It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton, Fundamenta Informaticae 154 (1-4) 2017, s. 37–46.zobacz w PBN
• Jacek Sroka i Jan Hidders, On Determining the AND-OR Hierarchy in Workflow Nets, Fundamenta Informaticae 156 (1) 2017, s. 95–123.zobacz w PBN
• Eryk Kopczyński, Computational Complexity on the Blackboard, Fundamenta Informaticae 152 (4) 2017, s. 323–339.zobacz w PBN
• Jacek Pomykała, On Deterministic Reduction of Factoring Integers to Computing the Exponents of Elements in Modular Group, Fundamenta Informaticae 152 (3) 2017, s. 289–295.zobacz w PBN

2016

• Soma Dutta i Andrzej Skowron, Generalized quantifiers in the context of rough set semantics, Fundamenta Informaticae 142 (1-4) 2016, s. 213–236.zobacz w PBN
• Davide Ciucci, Dominik Ślęzak i Marcin Wolski, Preface, Fundamenta Informaticae 148 (1-2) 2016, s. v–vi.zobacz w PBN
• Jacek Pomykała, Small generating sets and DLPC Problem, Fundamenta Informaticae 145 (2) 2016, s. 143–150.zobacz w PBN
• Anh Linh Nguyen, A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic, Fundamenta Informaticae 143 (1-2) 2016, s. 113–139.zobacz w PBN
• Anh Linh Nguyen, ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic, Fundamenta Informaticae 147 (2-3) 2016, s. 261–288.zobacz w PBN
• Andrzej Skowron i Andrzej Jankowski, Rough Sets and Interactive Granular Computing, Fundamenta Informaticae 147 (1-2) 2016, s. 371–385.zobacz w PBN
• Jan Bazan, Stanisława Bazan - Socha, Sylwia Buregwa-Czuma, Łukasz Dydo, Wojciech Rząsa i Andrzej Skowron, A classifier based on a decision tree with verifying cuts, Fundamenta Informaticae 143 (1-2) 2016, s. 1–18.zobacz w PBN
• Chris Cornelis, Hung Son Nguyen, Sankar K. Pal, Wei-Zhi Wu i Andrzej Skowron, Preface: Special issue on rough sets and fuzzy sets, Fundamenta Informaticae 142 (1-4) 2016, s. v–viii.zobacz w PBN
• Ludwik Czaja, Wojciech Penczek i Krzysztof Stencel, Preface, Fundamenta Informaticae 147 (2-3) 2016, s. i–iii.zobacz w PBN

2015

• Wojciech Czerwiński, Tomasz Gogacz i Eryk Kopczyński, Non-dominating Sequences of Vectors Using only Resets and Increments, Fundamenta Informaticae 140 (2) 2015, s. 123–127.zobacz w PBN
• Konrad Durnoga i Bartosz Źrałek, On Computing Discrete Logarithms in Bulk and Randomness Extractors, Fundamenta Informaticae 141 (4) 2015, s. 345–366.zobacz w PBN
• Jacek Sroka, Piotr Chrząstowski-Wachtel i Jan Hidders, On Generating Hierarchical Workflow Nets and their Extensions and Verifying Hierarchicality, Fundamenta Informaticae 141 (4) 2015, s. 367–398.zobacz w PBN
• Robert Dąbrowski i Wojciech Plandowski, Complete characterization of zero-expressible functions, Fundamenta Informaticae 138 (3) 2015, s. 339–350.zobacz w PBN
• Dominik Ślęzak, Benjamin C. M. Fung i William Kwok-Wai Cheung, Preface, Fundamenta Informaticae 137 (2) 2015.zobacz w PBN
• Michał Meina i Hung Son Nguyen, Search Result Clustering Based on Query Context., Fundamenta Informaticae 137 (2) 2015, s. 273–290.zobacz w PBN
• Michał Korpusik, Witold Łukaszewicz i Ewa Madalińska-Bugaj, Consistency-based Revision of Structured Belief Bases, Fundamenta Informaticae 135 (4) 2015, s. 381–404.zobacz w PBN

2014

• Andrzej Jankowski, Andrzej Skowron i Roman Swiniarski, Perspectives on Uncertainty and Risk in Rough Sets and Interactive Rough-Granular Computing, Fundamenta Informaticae 129 (1-2) 2014, s. 69–84.zobacz w PBN
• Wojciech Michał Świeboda, Adam Krasuski, Hung Son Nguyen i Andrzej Piotr Janusz, Interactive Method for Semantic Document Indexing Based on Explicit Semantic Analysis, Fundamenta Informaticae 132 (3) 2014, s. 423–438.zobacz w PBN
• Piotr Wiśniewski i Krzysztof Stencel, Universal Query Language for Unified State Model, Fundamenta Informaticae 129 (1-2) 2014, s. 177–192.zobacz w PBN
• Anh Linh Nguyen i Joanna Golińska-Pilarek, An ExpTime Tableau Method for Dealing with Nominals and Qualified Number Restrictions in Deciding the Description Logic SHOQ, Fundamenta Informaticae 135 (4) 2014, s. 433–449.zobacz w PBN
• Piotr Przymus, Krzysztof Kaczmarski i Krzysztof Stencel, A Bi-objective Optimization Framework for Heterogeneous CPU/GPU Query Plans, Fundamenta Informaticae 135 (4) 2014, s. 483–501.zobacz w PBN
• Thanh-Luong Tran, Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen i Hung Son Nguyen, Bisimulation-Based Concept Learning in Description Logics, Fundamenta Informaticae 133 (2-3) 2014, s. 287–303.zobacz w PBN
• Piotr Wiśniewski i Krzysztof Stencel, Query Rewriting Based on Meta-Granular Aggregation, Fundamenta Informaticae 135 (4) 2014, s. 537–551.zobacz w PBN
• Marcin Szczuka, Łukasz Sosnowski, Adam Krasuski i Karol Kreński, Using Domain Knowledge in Initial Stages of KDD: Optimization of Compound Object Processing, Fundamenta Informaticae 129 (4) 2014, s. 341–364.zobacz w PBN
• Chi Mai Luong, Piuri Vincenzo i Hung Son Nguyen, Preface: Special Issue in Computing and Communication Technologies., Fundamenta Informaticae 130 (2) 2014, s. xv.zobacz w PBN
• Tianrui Li, Hongmei Chen, Jingtao Yao i Hung Son Nguyen, Preface: Special Issue in Advances on Rough Sets and Knowledge Technology, Fundamenta Informaticae 132 (3) 2014, s. i–iii.zobacz w PBN
• Andrzej Jankowski, Andrzej Skowron i Roman Świniarski, Interactive Complex Granules, Fundamenta Informaticae 133 (2-3) 2014, s. 181–196.zobacz w PBN

2013

• J.F. Peters, Andrzej Skowron i J. Stepaniuk, Nearness of Visual Objects. Application of Rough Sets in Proximity Spaces, Fundamenta Informaticae Vol. 128 (1-2) 2013, s. 156––176.zobacz w PBN
• Julien Cervelle, Alberto Dennunzio, Enrico Formenti i Andrzej Skowron, Preface, Fundamenta Informaticae 126 (2-3) 2013, s. i–iii.zobacz w PBN
• Dominik Ślęzak, Hung Son Nguyen i Marcin Szczuka, Preface, Fundamenta Informaticae 127 (1-4) 2013.zobacz w PBN
• Hung Son Nguyen i Gloria Virginia, Lexicon-based Document Representation,, Fundamenta Informaticae 124 (1,2) 2013, s. 27–46.zobacz w PBN
• Jingtao Yao, Andrzej Skowron, Guoyin Wang i Hung Son Nguyen, Preface, Fundamenta Informaticae 126 (4) 2013, s. i–iii.zobacz w PBN
• Patrick Doherty i Andrzej Szałas, Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination, Fundamenta Informaticae 127 (1-4) 2013, s. 135–149.zobacz w PBN
• Robert Dąbrowski, Grzegorz Timoszuk i Krzysztof Stencel, One Graph to Rule Them All Software Measurement and Management, Fundamenta Informaticae Vol. 128, nr 1-2 2013, s. 67––63.zobacz w PBN
• Sinh Hoa Nguyen, Tuan Trung Nguyen, Marcin Szczuka i Hung Son Nguyen, An Approach to Pattern Recognition Based on Hierarchical Granular Computing, Fundamenta Informaticae 127 (1-4) 2013, s. 369–384.zobacz w PBN
• Jan Hidders, Paolo Missier, Jacek Sroka i Jan Van den Bussche, Preface, Fundamenta Informaticae 128 (3) 2013.zobacz w PBN
• Adam Krasuski i Piotr Wasilewski, Outlier Detection by Interaction with Domain Experts, Fundamenta Informaticae 127 (1-4) 2013, s. 529–544.zobacz w PBN
• Dominik Ślęzak, Piotr Synak, A. Wojna i Jakub Wróblewski, Two Database Related Interpretations of Rough Approximations: Data Organization and Query Execution, Fundamenta Informaticae 127 (1-4) 2013, s. 445––459.zobacz w PBN

2012

• Andrzej Piotr Janusz, Dominik Ślęzak i Hung Son Nguyen, Unsupervised Similarity Learning from Textual Data, Fundamenta Informaticae 119 (3) 2012.zobacz w PBN
• P. Wiśniewski, M. Burzańska i K. Stencel, The Impedance Mismatch in Light of the Unified State Model, Fundamenta Informaticae Vol. 120, nr 3/4 2012, s. 359–374.zobacz w PBN
• Piotr Wiśniewski, Marta Burzańska i Krzysztof Stencel, The Impedance Mismatch in Light of the Unified State Model, Fundamenta Informaticae 120 (3-4) 2012, s. 359–374.zobacz w PBN
• Paweł Leszczyński i Krzysztof Stencel, Update Propagator for Joint Scalable Storage, Fundamenta Informaticae 119 (3-4) 2012, s. 337–355.zobacz w PBN
• Andrzej Skowron, Jarosław Stepaniuk, Andrzej Jankowski, Jan G. Bazan i Roman W. Swiniarski, Rough set based reasoning about changes, Fundamenta Informaticae 119 (3-4) 2012, s. 421–437.zobacz w PBN

2011

• Marcin Szczuka, Andrzej Skowron i Jarosław Stepaniuk, Function approximation and quality measures in rough-granular systems, Fundamenta Informaticae 109 (3) 2011, s. 339–354.zobacz w PBN

2010

• Anh Linh Nguyen, Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity, Fundamenta Informaticae 104 (4) 2010, s. 349–384.zobacz w PBN
• B. Wilczyński i T.R. Hvidste, A Computer Scientist's Guide to the Regulatory Genome, Fundamenta Informaticae Vol. 103, nr 1-4 2010, s. 323–332.zobacz w PBN
• Andrzej Skowron, Jarosław Stepaniuk i Roman Swiniarski, Approximation spaces in rough-granular computing, Fundamenta Informaticae 100 (1-4) 2010, s. 141–157.zobacz w PBN
• Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwonczyk-Syta i Michał Skrzypczak, On the Borel Complexity of MSO Definable Sets of Branches, Fundamenta Informaticae 98 (4) 2010, s. 337–349.zobacz w PBN
• Paweł Urzyczyn, The Logic of Persistent Intersection, Fundamenta Informaticae 103 (1-4) 2010, s. 303–322.zobacz w PBN
• Barbara Dunin-Kęplicz, Anh Linh Nguyen i Andrzej Szałas, A Framework for Graded Beliefs, Goals and Intentions, Fundamenta Informaticae 100 (1-4) 2010, s. 53–76.zobacz w PBN
• Maxime Crochemore, Marcin Kubica, Tomasz Waleń, Costas S. Iliopoulos i M. Sohel Rahman, Finding Patterns In Given Intervals, Fundamenta Informaticae 101 (3) 2010, s. 173–186.zobacz w PBN
• Anh Linh Nguyen i Andrzej Szałas, Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, Fundamenta Informaticae 102 (1) 2010, s. 97–113.zobacz w PBN
• Paweł Górecki, H-trees: a Model of Evolutionary Scenarios with Horizontal Gene Transfer, Fundamenta Informaticae 103 (1-4) 2010, s. 105–128.zobacz w PBN
• Anna Gambin i Bogusław Kluge, Modeling Proteolysis from Mass Spectrometry Proteomic Data, Fundamenta Informaticae 103 (1-4) 2010, s. 89–104.zobacz w PBN
• Anna Gambin, Damian Niwiński i Paweł Urzyczyn, Preface, Fundamenta Informaticae 103 (1-4) 2010.zobacz w PBN
• Jerzy Tyszkiewicz, Complexity of Type Inference, Fundamenta Informaticae 103 (1-4) 2010, s. 289–301.zobacz w PBN
• Norbert Dojer, An Efficient Algorithm for Learning Bayesian Networks from Data, Fundamenta Informaticae 103 (1-4) 2010, s. 53–67.zobacz w PBN

2009

• Aida Vitória, Jan Małuszyński i Andrzej Szałas, Modeling and Reasoning with Paraconsistent Rough Sets, Fundamenta Informaticae 97 (4) 2009, s. 405–438.zobacz w PBN
• Jacek Sroka i Jan Hidders, Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I, Fundamenta Informaticae 92 (3) 2009, s. 279–299.zobacz w PBN
• Anh Linh Nguyen, An Efficient Tableau Prover using Global Caching for the Description Logic ALC, Fundamenta Informaticae 93 (1-3) 2009, s. 273–288.zobacz w PBN
• Jacek Sroka i Jan Hidders, Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II, Fundamenta Informaticae 92 (4) 2009, s. 373–396.zobacz w PBN
• Ewa Madalińska-Bugaj i Witold Łukaszewicz, First-order Generalization of the MPMA Belief Update Operator, Fundamenta Informaticae 94 (1) 2009, s. 49–61.zobacz w PBN
• Mikhail Ju. Moshkov, Andrzej Skowron i Zbigniew Suraj, On minimal inhibitory rules for almost all k-valued information systems, Fundamenta Informaticae 93 2009, s. 261–272.zobacz w PBN
• Rajeev Gore i Anh Linh Nguyen, Clausal Tableaux for Multimodal Logics of Belief, Fundamenta Informaticae 94 (1) 2009, s. 21–40.zobacz w PBN
• J. Sroka i J. Hidders, Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I, Fundamenta Informaticae Vol. 92, nr 3 2009, s. 279–299.zobacz w PBN
• J. Sroka i J. Hidders, Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II, Fundamenta Informaticae Vol. 92, nr 4 2009, s. 373–396.zobacz w PBN

2008

• Grzegorz Góra, Jan Bazan, Piotr Kruczek, Stanisława Bazan-Socha i Andrzej Skowron, Case based planning of treatment of infants with respiratory failure, Fundamenta Informaticae 85 (1-4) 2008, s. 155–172.zobacz w PBN
• Andrzej Jankowski, James Peters, Andrzej Skowron i Jarosław Stepaniuk, Optimization in discovery of compound granules, Fundamenta Informaticae 85 (1-4) 2008, s. 249–265.zobacz w PBN
• Agata Janowska, Paweł Janowski i Dobiesław Wróblewski, Translation of Intermediate Language to Timed Automata with Discrete Data, Fundamenta Informaticae 85 (1-4) 2008, s. 235–248.zobacz w PBN
• Agata Janowska, Paweł Janowski i Wojciech Nabiałek, Translation of Timed Promela to Timed Automata with Discrete Data, Fundamenta Informaticae 85 (1-4) 2008, s. 409–424.zobacz w PBN
• Piotr Chrząstowski-Wachtel, Paweł Findeisen i Grzegorz Wolny, Time Distribution in Structural Workflow Nets, Fundamenta Informaticae 85 (1-4) 2008, s. 67–87.zobacz w PBN

2007

• J.G. Bazan, S. Bazan-Socha, J.J. Pietrzyk, P. Kruczek i A. Skowron, Rough Set Approach to Behavioral Pattern Identification, Fundamenta Informaticae Vol. 75, nr 1-4 2007, s. 27–47.zobacz w PBN
• Łukasz Bolikowski i Anna Gambin, New Metrics for Phylogenies, Fundamenta Informaticae 78 (2) 2007, s. 199–216.zobacz w PBN
• Jan Bazan, Piotr Kruczek, Stanisława Bazan-Socha, Andrzej Skowron i Jacek Pietrzyk, Rough Set Approach to Behavioral Pattern Identification, Fundamenta Informaticae 75 2007, s. 27–47.zobacz w PBN
• Sheela Ramanna, James Peters i Andrzej Skowron, Approaches to Conflict Dynamics Based on Rough Sets, Fundamenta Informaticae 75 2007, s. 453–468.zobacz w PBN
• A. Arnold i D. Niwiński, Continuous Separation of Game Languages, Fundamenta Informaticae Vol. 81, nr 1-3 2007, s. 19–28.zobacz w PBN
• James Peters, Andrzej Skowron i Jarosław Stepaniuk, Nearness of Objects: Extension of Approximation Space Model, Fundamenta Informaticae 79 2007, s. 497–512.zobacz w PBN
• P. Doherty i A. Szałas, A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning, Fundamenta Informaticae Vol. 75, nr 1-4 2007, s. 179–193.zobacz w PBN
• Andrzej Skowron, Mikhail Moshkov i Zbigniew Suraj, On minimal rule sets for almost all binary information systems, Fundamenta Informaticae 80 2007, s. 247–258.zobacz w PBN
• Marcin Konrad Dziubiński, Rineke Verbrugge i Barbara Dunin-Kęplicz, Complexity issues in multiagent logics, Fundamenta Informaticae 75 (1) 2007, s. 239–262.zobacz w PBN
• Ł. Bolikowski i A. Gambin, New Metrics for Phylogenies, Fundamenta Informaticae Vol. 78, nr 2 2007, s. 199–216.zobacz w PBN
• Anh Linh Nguyen, Foundations of Modal Deductive Databases, Fundamenta Informaticae 79 (1) 2007, s. 85–135.zobacz w PBN
• Agata Janowska i Wojciech Penczek, Path Compression in Timed Automata, Fundamenta Informaticae 79 (3-4) 2007, s. 379–399.zobacz w PBN
• M. Dziubiński, R. Verbrugge i B. Dunin-Kęplicz, Complexity Issues in Multiagent Logics, Fundamenta Informaticae Vol. 75, nr 1-4 2007, s. 239–262.zobacz w PBN

2006

• Andrzej Skowron, Jarosław Stepaniuk, James Peters i Roman Swiniarski, Calculi of Approximation Spaces, Fundamenta Informaticae 72 (1-3) 2006, s. 363–378.zobacz w PBN
• Agata Janowska i Paweł Janowski, Slicing of Timed Automata with Discrete Data, Fundamenta Informaticae 72 (3) 2006, s. 181–195.zobacz w PBN
• Anh Linh Nguyen, Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming, Fundamenta Informaticae 70 (4) 2006, s. 351–366.zobacz w PBN
• P. Claire, J. Paddon, Derek Willis, Sinh Hoa Nguyen, Trung Nguyen i Hung Son Nguyen, Learning sunspot classification, Fundamenta Informaticae 72 (1-3) 2006, s. 295–309.zobacz w PBN
• Jacek Pomykała i Sławomir Barabasz, Eliptic Curve Based Threshold Proxy Signature Scheme with Known Signers, Fundamenta Informaticae 69 2006, s. 411–425.zobacz w PBN
• W. Jaworski, Bounds for Validation, Fundamenta Informaticae Vol. 70, nr 3 2006, s. 261–275.zobacz w PBN

2005

• J. Stepaniuk, J.G. Bazan i A. Skowron, Modelling Complex Patterns by Information Systems, Fundamenta Informaticae Vol. 67, nr 1-3 2005, s. 203–217.zobacz w PBN
• Jan Bazan, Andrzej Skowron i Jarosław Stepaniuk, Modeling complex patterns by information systems, Fundamenta Informaticae 67 2005, s. 203–217.zobacz w PBN
• Andrzej Skowron, Rough sets and vague concepts, Fundamenta Informaticae 64 2005, s. 417–431.zobacz w PBN
• Jan Bazan, James Peters, Andrzej Skowron i Piotr Synak, Spatio-temporal approximate reasoning over complex objects, Fundamenta Informaticae 67 (1-3) 2005, s. 249–269.zobacz w PBN

2004

• N. Dojer, Applying term rewriting to partial algebra theory, Fundamenta Informaticae Vol. 63, nr 4 2004, s. 375–384.zobacz w PBN
• J. Bazan, Hung Son Nguyen i Marcin Szczuka, A view on rough set concept approximations, Fundamenta Informaticae 59 (2-3) 2004, s. 107–118.zobacz w PBN
• Andrzej Skowron i Piotr Synak, Reasoning in information maps, Fundamenta Informaticae 59 (2-3) 2004, s. 241–259.zobacz w PBN
• Andrzej Skowron i Piotr Synak, Complex patterns, Fundamenta Informaticae 60 (1-4) 2004, s. 351–366.zobacz w PBN
• Barbara Dunin-Kęplicz i Rieneke Verbrugge, Tuning machine for Cooperative Problem Solving, Fundamenta Informaticae 63 (2) 2004, s. 283–307.zobacz w PBN
• Marek Karpinski, Mirosław Kowaluk i Andrzej Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, Fundamenta Informaticae 62 (3) 2004, s. 369–375.zobacz w PBN
• M. Karpinski, M. Kowaluk i A. Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, Fundamenta Informaticae Vol. 62, nr 3,4 2004, s. 369–375.zobacz w PBN
• Agata Janowska i Paweł Janowski, Slicing Timed Systems, Fundamenta Informaticae 60 2004, s. 187–210.zobacz w PBN

2003

• Andrzej Skowron, J Peters i J Stepaniuk, Rough sets and infomorphisms: Towards approximation of relations in distributed environments, Fundamenta Informaticae 54(2-3) 2003, s. 263–277.zobacz w PBN
• Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski i Wojciech Rytter, Occurrence and substring heuristics for delta-matching, Fundamenta Informaticae 56 (1) 2003, s. 1–21.zobacz w PBN
• Barbara Dunin-Kęplicz i Rieneke Verbrugge, Evolution of collective commitments during teamwork, Fundamenta Informaticae 56 (4) 2003, s. 329–371.zobacz w PBN
• Anh Linh Nguyen, A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs, Fundamenta Informaticae 55 (1) 2003, s. 63–100.zobacz w PBN
• Ewa Madalińska-Bugaj i Witold Lukaszewicz, Formalizing Defeasible Logic in CAKE, Fundamenta Informaticae 57 2003, s. 193–213.zobacz w PBN
• P. Doherty, M. Grabowski, W. Łukaszewicz i A. Szałas, Towards a Framework for Approximate Ontologies, Fundamenta Informaticae Vol. 57, nr 2-4 2003, s. 147–165.zobacz w PBN
• B. Dunin-Kęplicz i R. Verbrugge, Evolution of Collective Commitment during Teamwork, Fundamenta Informaticae Vol. 56, nr 4 2003, s. 329–371.zobacz w PBN
• M. Crochemore, C.S. Iliopoulos, T. Lecroq, Y.J. Pinzon, W. Plandowski i W. Rytter, Occurrence and Substring Heuristics for [ro]-Matching, Fundamenta Informaticae Vol. 56, nr 1,2 2003, s. 1–21.zobacz w PBN
• Patrick Doherty, Andrzej Skowron, Witold Lukaszewicz i Andrzej Szałas, Preface, Fundamenta Informaticae 57 (2-4) 2003.zobacz w PBN

2002

• J.F. Peters, A. Skowron, J. Stepaniuk i S. Ramanna, Towards an Ontology of Approximate Reason, Fundamenta Informaticae Vol. 51, nr 1,2 2002, s. 157–173.zobacz w PBN
• V. Bono i J. Tiuryn, Products and Polymorphic Subtypes, Fundamenta Informaticae Vol. 51, nr 1,2 2002, s. 13–41.zobacz w PBN
• J Peters, Andrzej Skowron, J Stepaniuk i S Rammana, Towards an ontology of approximate reason, Fundamenta Informaticae 51 ((1-2)) 2002, s. 157–173.zobacz w PBN
• D. Ślęzak, Approximate Entropy Reducts, Fundamenta Informaticae 53 (3,4) 2002, s. 365–390.zobacz w PBN
• Jerzy Tiuryn i Viviana Bono, Products and Polymorphic Subtypes, Fundamenta Informaticae 51 (1,2) 2002, s. 13–41.zobacz w PBN
• Barbara Dunin-Kęplicz i R. Verbrugge, Collective intentions, Fundamenta Informaticae 51 (3) 2002, s. 271–295.zobacz w PBN
• B. Dunin-Kęplicz i R. Verbrugge, Collective Intentions, Fundamenta Informaticae Vol. 51, nr 3 2002, s. 271–295.zobacz w PBN

2001

• Anna Gambin, Sławomir Lasota i M. Dietzfelbinger, On different models for packet flow in multistage interconnection networks, Fundamenta Informaticae 46 (4) 2001, s. 287–314.zobacz w PBN
• Anh Linh Nguyen, The modal query language MDatalog, Fundamenta Informaticae 46 (4) 2001, s. 315–342.zobacz w PBN
• Jerzy Tyszkiewicz, Computability by Sequences of Queries, Fundamenta Informaticae 48 (4) 2001, s. 389–414.zobacz w PBN
• Hung Son Nguyen, On Efficient Handling of Continuous Attributes in Large Data Bases, Fundamenta Informaticae 48 (1) 2001, s. 61–81.zobacz w PBN
• M Dietzfelbiner, A. Gambin i S. Lasota, On different models for packet flow in Multistage Interconnection Networks, Fundamenta Informaticae Vol. 46, nr 4 2001, s. 287–314.zobacz w PBN
• S Rammana, Andrzej Skowron, M Borkowski i Z Suraj, Sensor, Filter, and Fusion Models with Rough Petri Nets, Fundamenta Informaticae 47 (3-4) 2001, s. 307–323.zobacz w PBN
• A. Skowron i J. Stepaniuk, Information Granule Decomposition, Fundamenta Informaticae Vol. 47, nr 3,4 2001, s. 337–350.zobacz w PBN
• Andrzej Skowron i J Stepaniuk, Information Granule Decomposition, Fundamenta Informaticae 47 (3-4) 2001, s. 337–350.zobacz w PBN
• J.F. Peters, S. Ramanna, M. Borkowski, A. Skowron i Z. Suraj, Sensor, Filter, and Fusion Models with Rough Petri Nets, Fundamenta Informaticae Vol. 47, nr 3,4 2001, s. 307–323.zobacz w PBN

2000

• J Peters, Andrzej Skowron i Zbigniew Suraj, An application of rough set methods in control design, Fundamenta Informaticae 43 (1-4) 2000, s. 269–290.zobacz w PBN
• Lech Polkowski i Andrzej Skowron, Rough mereology in information systems with applications in qualitative spatial reasoning, Fundamenta Informaticae 43 (1-4) 2000, s. 291–320.zobacz w PBN
• Witold Łukaszewicz, Ewa Madalińska-Bugaj i P Doherty, The PMA and relativizing minimal change for action update,, Fundamenta Informaticae 44 2000, s. 95–131.zobacz w PBN
• L. Polkowski i A. Skowron, Rough Mereology in information systems with applications to qualitative spatial, Fundamenta Informaticae Vol. 43, Nr 1-4 2000, s. 291–320.zobacz w PBN
• Marcin Engel, Janina Mincer-Daszkiewicz i Artur Kret, Towards automated consistency checking of module interface specifications, Fundamenta Informaticae 42 (3-4) 2000, s. 251–278.zobacz w PBN
• Anh Linh Nguyen, Constructing the Least Models for Positive Modal Logic Programs, Fundamenta Informaticae 42 (1) 2000, s. 29–60.zobacz w PBN
• J.F. Peters, A. Skowron i Z. Suraj, An application of rough set methods in control design, Fundamenta Informaticae Vol. 43, Nr 1-4 2000, s. 269–290.zobacz w PBN
• Dominik Ślęzak, Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis, Fundamenta Informaticae 44 (3) 2000, s. 291–319.zobacz w PBN

1999

• Hung Son Nguyen i Sinh Hoa Nguyen, Rough Sets and Association rule Generation, Fundamenta Informaticae 40 (4) 1999, s. 383–405.zobacz w PBN
• P Doherty, J Kachniarz i Andrzej Szałas, Meta-queries on deductive databases, Fundamenta Informaticae 40 (1) 1999, s. 17–30.zobacz w PBN

1998

• P. Doherty, Witold Łukaszewicz i Andrzej Szałas, General Domain Circumscription and its effective reductions, Fundamenta Informaticae Vol. 36, nr 1 1998, s. 23–55.zobacz w PBN

1996

• Andrzej Szałas, On Natural Deduction in First-Order Fixpoint Logics, Fundamenta Informaticae 26 (1) 1996, s. 81–94.zobacz w PBN
• Patrick Doherty, Witold Łukaszewicz i Andrzej Szałas, A Reduction Result for Circumscribed Semi-Horn Formulas, Fundamenta Informaticae 28 (3-4) 1996, s. 261–271.zobacz w PBN

1992

• Andrzej Ehrenfeucht i Marek Witold Zawadowski, A representation of partial Boolean algebras, Fundamenta Informaticae 16 (3-4) 1992, s. 349–353.zobacz w PBN

1989

• Uwe Petermann i Andrzej Szałas, On Temporal Logic for Distributed Systems and Its Application to Processes Communicating by Interrupts, Fundamenta Informaticae 12 (2) 1989, s. 191–204.zobacz w PBN

1988

• Andrzej Szałas, Towards the Temporal Approach to Abstract Data Types, Fundamenta Informaticae 11 (1) 1988, s. 49–64.zobacz w PBN

1984

• Andrzej Szałas, On an Application of Algorithmic Theory of Stacks, Fundamenta Informaticae 7 (3) 1984, s. 378–388.zobacz w PBN

1981

• Andrzej Szałas, Algorithmmic Logic with Recursive Functions, Fundamenta Informaticae 4 (4) 1981, s. 975–995.zobacz w PBN